Research on the site selection and path layout of the logistics distribution center of marine ships based on a mathematical model

Haolin Tong

doi:10.5604/01.3001.0015.9925

Authors

Haolin Tong School of Economics and Management, Anyang University Author https://orcid.org/0000-0002-9588-0818

DOI:

https://doi.org/10.5604/01.3001.0015.9925

Keywords:

marine ships, distribution center, site selection, ship logistics, mathematical model

Abstract

For logistics enterprises, site selection and path layout are related to the cost and efficiency of distribution, which is a very critical issue and has an important impact on the development of enterprises. Compared with land logistics, the cost of marine ship logistics is higher due to the high cost of ships, so the research on the location and path layout of its distribution centers is also particularly important. This paper established a two-layer model under the assumption that unit transpor-tation costs and administration expenses are known for the site selection and path layout problems of marine ship logistics distribution centers. Corresponding constraint conditions were set. The upper layer was the optimization model of the site selection problem of the distribution center, and the objective function was to minimize operating and construction costs and was solved using the quantum particle swarm optimization (QPSO) algorithm. The lower layer was the optimization model of the distribution path layout, and the objective function was to minimize the logistics distribution cost and was solved using the ant colony optimization (ACO) algorithm. The model was verified through an example analysis. It was assumed that there were three ships, five candidate distribution centers, and ten customer points. The model was solved in MATLAB software. The results of the example analysis showed that compared with K-means, genetic algorithm (GA), and particle swarm optimization (PSO)-ACO algorithms, the QPSO-ACO algorithm had the shortest running time, about 60 s, which saved about 50% compared to the K-means algorithm. The optimal cost of the QPSO-ACO algorithm was 293,400 yuan, which was significantly lower than the K-means, GA, and PSO-ACO algorithms (459,600 yuan, 398,300 yuan, and 357,700 yuan). In this example, the site obtained by the QPSO-ACO algorithm was distribution center 2, and the obtained path distribution was 1-7-5-4, 2-6-3, and 10-8-9. The results verify the effectiveness of the QPSO-ACO algorithm in solving the problem of site selection and path layout. The QPSO-ACO algorithm can be applied in the actual marine ship logistics.

References

Alexahina, L.V. (2020). Mechanism of Strategic Development of Maritime Transport and Regional Logistics. IOP Conference Series Earth and Environmental Science, 459, 062037.

Andayani, U., Efendi, S., Siregar, N., Syahputra, M.F. (2021). Determination System for House Improvement Recipients In Serdang Bedagai By Using Clustering K-Means Method And Viekriterijumsko Kompromisno Rangiranje (Vikor). Journal of Physics: Conference Series, 1830(1), 012023.

Chi, R., Su, Y., Qu, Z., Chi, X. (2019). A Hybridization of Cuckoo Search and Differential Evolution for the Logistics Distribution Center Location Problem. Mathematical Problems in Engineering, 2019(1), 1-16.

Drexl, M., Schneider, M. (2015). A survey of variants and extensions of the location-routing problem. European Journal of Operational Research, 241(2), 283-308.

Drexl, M., Schneider, M. (2017). A survey of the standard location-routing problem. Publications of Darmstadt Technical University, Institute for Business Studies (BWL), 259(1-2), 389-414.

Droździel, P., Wińska, M., Madleňák, R., Szumski, P. (2017). Optimization of the Post Logistics Network and Location of the Local Distribution Center in Selected Area of the Lublin Province. Procedia Engineering, 192, 130-135.

Emiroglu, S., Uyaroglu, Y. (2021). Genetic algorithm (GA)-based delay feedback control of chaotic behavior in the voltage mode controlled direct current (DC) drive system. Zeitschrift für Naturforschung A, 76(1), 13-21.

Ghorbani, A., Jokar, M.R.A. (2016). A hybrid imperialist competitive-simulated annealing algorithm for a multisource multi-product location-routing-inventory problem. Computers & Industrial Engineering, 101(nov.), 116-127.

Hao, Y., Wei, S. (2016). An Improved Multi-Objective Programming with Augmented ε-Constraint Method for Hazardous Waste Location-Routing Problems. International Journal of Environmental Research & Public Health, 13(6), 548.

Hou, X., Ji, Y., Liu, W., Han, J., Zhang, J., He, C. (2021). Research on Logistics Distribution Routing Problem of Unmanned Vehicles Based on Genetic Simulated Annealing Algorithm. ICAIIS, 2021, 1-7.

Ikhlef, B. Rahmoune, C., Bettahar, T., Djamel, B. (2021). Gearboxes fault detection under operation varying condition based on MODWPT, Ant colony optimization algorithm and Random Forest classifier. Advances in Mechanical Engineering, 13(8), 4463-4478.

Jin C.X., Zhang, Y., Li, F.C. (2021). Research on Path Optimization Problem Based on Satisfaction Degree in Fuzzy Demand Environment. Journal of Physics: Conference Series, 1955(1), 012056-.

Kartono, A., Anggraini, D., Wahyudi, S. T., Setiawan, A.A., Sofian, I. (2021). Study of Parameters Estimation of The Three-Compartment Pharmacokinetic Model using Particle Swarm Optimization Algorithm. Journal of Physics: Conference Series, 1805(1), 1-11.

Koç, Ç., Bektaş, T., Jabali, O., Laporte, G. (2016). The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm. European Journal of Operational Research, 248(1), 33-51.

Marinakis, Y. (2015). An improved particle swarm optimization algorithm for the capacitated location routing problem and for the location routing problem with stochastic demands. Applied Soft Computing, 37, 680-701.

Moriyama, Y., Iimura, I., Ohno, T., Nakayama, S. (2015). An Experimental Study on Optimization in Permutation Spaces by Quantum-Inspired Evolutionary Algorithm Using Quantum Bit Representation. Journal of Signal Processing, 19(6), 227-234.

Peng, Y., Mo, Z., Liu, S. (2021). Passenger’s routes planning in stochastic common-lines’ multi-modal transportation network through integrating Genetic Algorithm and Monte Carlo simulation. Archives of Transport, 59(3), 73-92.

Sawicki, P., Sawicka, H. (2021). Combined optimisation and MCDA based solution of the tram depot location problem. Archives of Transport, 60(4), 87-103.

Schiffer, M., Walther, G. (2017). The electric location routing problem with time windows and partial recharging. European Journal of Operational Research, 260(1-2), 81-83.

Sun, Y., Wang, Y.T., Chen, C., Yu, B. (2018). Optimization of a regional distribution center location for parts of end-of-life vehicles. Simulation, 94(7), 577-591.

Wu, T., Yang, Z., Chu, F., Zhou, Z. (2015). A lagrangean relaxation approach for a two-stage capacitated facility location problem with choice of depot size. IEEE International Conference on Networking, 39-44.

Xiong, C., Xu, Y. (2021). Research on Logistics Distribution Path Planning Based on Fish Swarm Algorithm. Journal of Physics: Conference Series, 1883(1), 1-6.

Yang, J., Sun, H. (2015). Battery swap station location-routing problem with capacitated electric vehicles. Computers & Operations Research, 55, 217-232.

Zhang, L., Fu, M., Fei, T. (2021). Research on Location of Cold Chain Logistics Distribution Center with Low Carbon in Beijing-Tianjin-Hebei Area on the Basis of RNA-Artificial Fish Swarm Algorithm. Journal of Physics: Conference Series, 1861(1), 1-8.