A cost and pipeline trade-off in a transportation problem
DOI:
https://doi.org/10.2298/YJOR130214030SKeywords:
Transportation problem, Combinatorial optimization, Bottleneck transportation problem, Bi-criteria transportation problem, Efficient pointsAbstract
The present paper deals with a trade off between cost and pipeline at a given time in a transportation problem. The time lag between commissioning a project and the time when the last consignment of goods reaches the project site is an important factor. This motivates the study of a bi-criteria transportation problem at a pivotal time T. An exhaustive set E of all independent cost-pipeline pairs (called efficient pairs) at time T is constructed in such a way that each pair corresponds to a basic feasible solution and in turn, gives an optimal transportation schedule. A convergent algorithm has been proposed to determine non-dominated cost pipeline pairs in a criteria space instead of scanning the decision space, where the number of such pairs is large as compared to those found in the criteria space.References
Aneja, Y. P., and Nair, K. P. K., “Bi-criteria transportation problem,” Management Science, 25(1) (1979) 73-78.
Arora, S., and Puri, M. C., “On a standard time transportation problem,” Bulletin of Australian Society for Operations Research, 20(4) (2001) 2-14.
Arora, S., and Puri, M. C., “On lexicographic optimal solutions in transportation problem,” Optimization, 39 (1997) 383-403.
Bhatia, H. L., Swarup, K., and Puri, M. C., “Time-cost trade-off in a transportation problem,” Opsearch, 13 (1976) 129-142.
Bhatia, H. L., Swarup, K., and Puri, M. C., “A procedure for time minimizing transportation problem,” Indian Journal of Pure and Applied Mathematics, 8(8) (1977) 920-929.
Orlin, J. B., “A faster strongly polynomial minimum cost flow algorithm,” Proceedings of 20th ACM symposium on the theory of computing, 11 (1988) 377-387.
Garfinkel, R. S., and Rao, M. R., “The bottleneck transportation problem,” Naval Research Logistics Quarterly, 18 (1971) 465-472.
Glickman, R. S., and Berger, P. D., “Cost/completion date trade-offs in the transportation problem,” Operations Research, 25 (1977) 163-168.
Hammer, P. L., “Time minimization transportation problem,” Naval Research Logistics Quarterly, 18 (1969) 345-357.
Khurana, A., Thirwani, D., and Arora, S. R., “An algorithm for solving fixed charge bi-criterion indefinite quadratic transportation problem with restricted flow,” International Journal of Optimization. Theory Methods and Applications, 1 (4) (2009) 367-380.
Malhotra, R., and Puri, M. C., “Pricing of bottlenecks at optimal time in a transportation problem,” in: N. K. Jaiswal (ed.), Scientific management of transport systems, North Holland Publishing Company, 1981, 254-261.
Prakash, S., “A transportation problem with objective to minimize cost and duration of transportation,” Opsearch, 18 (1981) 235-238.
Prakash, S., “On minimizing the duration of transportation,” Proceedings of Indian Academy of Science, 91(1) (1982) 53-57.
Prakash, S., Balaji, B. V., and Tuteja, D., “Optimizing dead mileage in urban bus routes through a non-dominated solution approach,” European Journal of Operations Research, 114 (1999) 465-473.
Prakash, S., Kumar, P., Prasad, B. V. N. S., and Gupta, A., “Pareto optimal solutions of a cost-time trade-off bulk transportation problem,” European Journal of Operations Research, 188 (2008) 85-100.
Purushotam, S., Prakash, S., and Dhyani, P., “A transportation problem with minimization of duration and total cost of transportation as high and low priority objectives respectively,” Bulletin of Technical University of Istanbul, 37 (1984) 1-11.
Sharma, V., Dahiya, K., and Verma, V., “Capacitated two-stage time minimization transportation problem,” Asia-Pacific Journal of Operational Research, 27(4) (2010) 457-476.
Szwarc, W., “Some remarks on time transportation problem,” Naval Research Logistics Quarterly, 18 (1971) 465-472.
Downloads
Published
Issue
Section
License
Copyright (c) 2013 YUJOR
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
