Optimal scheduling plan for a coal shipment problem: An efficient approach

An MIP formulation for solving a coal shipment problem is presented. Benders Decomposition algorithm is adopted in this study due to its capability of solving complicated mixed integer programming problem. The run time results shows that the proposed algorithm consumes much less run time than the original MIP formulation.