Optimization of Multi-Objective Fixed Charge Bulk Transportation Problem

Authors

  • Sangita Sheoran, Kuldeep Tanwar

Keywords:

bulk transportation problem; fixed charge; multi objective optimization; optimal solution; zero suffix method; solution pairs.

Abstract

In this work, a multi-objective fixed charge bulk transportation problem (MOFCBTP) is considered that involves optimizing the transportation of bulk commodities from multiple sources to multiple destinations. The considered problem involves reducing the delivery cost and time simultaneously while satisfying supply and demand constraints and considering fixed charges associated with each transportation route. This problem is commonly encountered in logistics and supply chain management. Prior to this research, no work has been found on MOFCBTP in the literature. A method has been proposed in this work to provide acceptable optimal solutions of the problem. Finally, a numerical example is solved by using the proposed method to show the practical application of the method.

Downloads

Download data is not yet available.

References

Maio AD, Roveda, C. An all zero-one algorithm for a certain class of transportation problems. Operation Research. 1971; 19:1406-1418.

Srinivasan V, Thompsons GL. An algorithm for assigning users to sources in special classes of transportation problem. Operations Research. 1973; 21: 284-295.

Prakash S, Ram PP. A bulk transportation problem with objectives to minimize total cost and duration of transportation. The Mathematics Student. 1995; 64: 206-214.

Prakash S, Kumar P, Prasad BVNS, Gupta A. Pareto optimal solutions of a cost-time trade –off bulk transportation problem. European Journal of Operational Research. 2008; 188: 85-100.

Prakash S, Sharma MK, Singh A. An efficient heuristic for multi-objective bulk transportation problem. In proceedings of the 39th International Conference on Computers & Industrial Engineering 2009(pp. 1005-1009). IEEE.

Prakash S, Saluja RK, Singh P. Pareto optimal solutions to the cost-time trade-off bulk transportation problem through a newly devised efficacious novel algorithm. Journal of Data and Information Processing. 2014; 2:13-25.

Balinski ML. Fixed cost transportation problems. Naval Research Logistics Quarterly. 1961; 8: 41–54.

Cooper L, Drebes C. An approximate algorithm for the fixed charge problem. Naval Research Logistics Quarterly. 1967; 14: 101–13.

Hirsch WM, Dantzig GB. The fixed charge problem. Naval Research Logistics. 1968; 15: 413-424.

Steinberg DI. The fixed charge problem. Naval Research Logistics Quarterly. 1970; 17: 217–35.

Walker WE. A heuristic adjacent extreme point algorithm for the fixed charge problem. Management Science. 1976; 22: 587 –96.

Sadagopan S, Ravindran A. A vertex ranking algorithm for the fixed-charge transportation problem. Journal of Optimization Theory and application. 1982; 37: 221–230.

Sandrock K. A simple algorithm for solving small fixed-charge transportation problems. Journal of Operational Research Society. 1988; 39: 467-475.

Sun M, Aronson JE, Mckeown PG, Drinka D. A tabu search heuristic procedure for the fixed charge transportation problem. European Journal of Operations Research. 1998; 106: 441-456.

Adlakha V, Kowalski K. A simple heuristic for solving small fixed charge transportation problems. OMEGA: The International Journal of Management Science. 2003; 31: 205–211.

Kowalski K, Lev B. On step fixed-charge transportation problem. Omega. 2008; 36: 913-917.

Raj K, Rajendran C. Fast heuristic algorithms to solve a single-stage fixed-charge transportation problem. International Journal of Operational Research. 2009; 6: 304-329.

Adlakha V, Kowalski K, Lev B. A branching method for the fixed charge transportation problem. Omega. 2010; 38: 93-397.

Farag HH. An approach for solving the fixed charge transportation problem. Journal of University of Shanghai for Science and Technology. 2021; 23: 583-590.

Singh G, Singh A. Solving fixed-charge transportation problem using a modified particle swarm optimization algorithm. International Journal of System Assurance Engineering and Management. 2021; 12: 1073-1086.

Kaushal B, Arora S. Fixed charge bulk transportation problem. Operations Research and Optimization. 2017; 45:11-29.

Kaushal B, Arora S. Extension of fixed charge bulk transportation problem. Advanced Modelling and Optimization. 2018; 19: 517-525.

Roy SK, Midya S, Yu VF. Multi-objective fixed-charge transportation problem with random rough variables. International Journal of uncertainty, Fuzziness and Knowledge-Based Systems. 2018; 26: 971–996.

Roy SK, Midya S. Multi-objective fixed-charge solid transportation problem with product blending under intuitionistic fuzzy environment. Applied Intelligence. 2019; 49: 3524–3538.

Haque S, Bhurjee AK, Kumar P. Multi-objective non-linear solid transportation problem with fixed charge, budget constraints under uncertain environments. System Science and Control Engineering. 2022; 10: 899-909.

Sudhakar VJ, Arunasankar N, Karpagam T. A new approach for finding an optimal solution for transportation problems. European Journal of Scientific Research, 2012; 68: 254-257.

Downloads

Published

12.06.2024

How to Cite

Sangita Sheoran. (2024). Optimization of Multi-Objective Fixed Charge Bulk Transportation Problem. International Journal of Intelligent Systems and Applications in Engineering, 12(4), 3009 –. Retrieved from https://ijisae.org/index.php/IJISAE/article/view/6792

Issue

Vol. 12 No. 4 (2024)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

All papers should be submitted electronically. All submitted manuscripts must be original work that is not under submission at another journal or under consideration for publication in another form, such as a monograph or chapter of a book. Authors of submitted papers are obligated not to submit their paper for publication elsewhere until an editorial decision is rendered on their submission. Further, authors of accepted papers are prohibited from publishing the results in other publications that appear before the paper is published in the Journal unless they receive approval for doing so from the Editor-In-Chief.

IJISAE open access articles are licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. This license lets the audience to give appropriate credit, provide a link to the license, and indicate if changes were made and if they remix, transform, or build upon the material, they must distribute contributions under the same license as the original.