Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
477593 | European Journal of Operational Research | 2008 | 16 Pages |
Abstract
A cost–time trade-off bulk transportation problem with the objectives to minimize the total cost and duration of bulk transportation without according priorities to them is considered. The entire requirement of each destination is to be met from one source only; however a source can supply to any number of destinations subject to the availability of the commodity at it. Two new algorithms are provided to obtain the set of Pareto optimal solutions of this problem. This work extends and generalizes the work related to single-objective and prioritized two-objective bulk transportation problems done in the past while providing flexibility in decision making.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Satya Prakash, Pranav Kumar, B.V.N.S. Prasad, Anuj Gupta,