|
|||||
|
|
Pareto optimal solutions of a cost–time trade-off bulk transportation problem |
|
| Authors: | Satya Prakash Pranav Kumar BVNS Prasad Anuj Gupta |
| Institution: | 1. Department of Mathematics, Birla Institute of Technology and Science, Pilani, India;2. Department of Mathematics, Amity School of Engineering and Technology, New Delhi, India;3. Department of Computer Science, Birla Institute of Technology and Science, Pilani, India;4. Department of Chemical Engineering, University of Cambridge, Cambridge, United Kingdom |
| 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. |
| Keywords: | Optimization Multi-objective programming Pareto optimal Transportation Bulk transportation |
| 本文献已被 ScienceDirect 等数据库收录！ | |