Multiple objective cost–bottleneck time transportation problem with additional impurity constraints

This paper discusses Multiple Objective Linear Cost–Bottleneck Time Transportation Problem with additional impurity constraints. An algorithm is also developed to generate efficient transportation schedules with respect to the minimization of the multiple linear cost functions, the bottleneck time and the distribution that requires the bottleneck time. The algorithm takes into account the special structure of the problem and is supported by a numerical example of minimizing transportation cost, loading and unloading cost and overtime cost, and the time of shipping crude ore with the phosphorus impurity.