International Journal of Internet, Broadcasting and Communication

The Institute of Internet, Broadcasting and Communication (한국인터넷방송통신학회)
권호 표지
DOI QR코드

DOI QR Code

Optimizing delivery routing problem for logistics companies based on Integer Linear Programming method

  • Cao, Ngoc-Anh (University of Economics - Technology for Industries) ;
  • Phan, Thanh-Hang (VNU Information Technology Institute, Vietnam National University in Hanoi) ;
  • Chinh, Nguyen Thi (VNU Information Technology Institute, Vietnam National University in Hanoi) ;
  • Tran, Duc-Quynh (VNU International School, Vietnam National University in Hanoi) ;
  • Nguyen, Ha-Nam (VNU Information Technology Institute, Vietnam National University in Hanoi) ;
  • Trang, Ngo-Thi-Thu (Posts and Telecommunications Institute of Technology) ;
  • Choi, Gyoo-Seok (Department of Computer Science, Chungwoon University)
  • Received : 2022.10.17
  • Accepted : 2022.10.23
  • Published : 2022.11.30
Download PDF
⟨ Previous Next ⟩

Abstract

Currently, issues related to freight at Vietnamese logistics companies are becoming more and more urgent because of typical problems in Vietnam such as traffic, infrastructure, and application of information technology. This problem has been studied by applying many different approaches such as Integer Programming (LP), Mixed Integer Programming (MIP), hybrid, meta search, … In this paper, we applied the ILP model in order to deal with the VRP problem in a small size logistics company which is very popular in Vietnam. The experiments showed promising results with some optimal solutions with some small extra costs.

Keywords

Acknowledgement

This project is partially supported by the European Union's Horizon 2020 Research and Innovation Program RISE under grant agreement no. 823759 (REMESH)

References

  1. Alexander Gutierrez-Sanchez, Linda Bibiana Rocha-Medina, "VRP variants applicable to collecting donations and similar problems: A taxonomic review", Computers & Industrial Engineering 164 (2022)
  2. Victor Pillac, Michel Gendreau, Christelle Gueret, Andres L. Medaglia, "A Review of Dynamic Vehicle Routing Problems", interuniversity Research center on enterprise network, (2011).
  3. Eray Demirel, Neslihan Demirel, Hadi Goken, "A mixed integer linear programming model to optimize reverse logistics activities of end-of-life vehicles in Turkey", Journal of Cleaner Production No. 112, pp 2101-2113, (2016).
  4. Laszlo Kovacs, Anita Agardi and Tamas Banyai, "Fitness Landscape Analysis and Edge Weighting-Based Optimization of Vehicle Routing Problems", Processes 2020, 8, 1363. https://doi.org/10.3390/pr8111363
  5. Bagaria, V.; Ding, J.; Tse, D.; Wu, Y.; Xu, J. "Hidden hamiltonian cycle recovery via linear programming". Oper. Res. 2020, 68, 53-70 https://doi.org/10.1287/opre.2019.1886
  6. Jiuxia Zhao; Minjia Mao; Xi Zhao; Jianhua Zou, "A Hybrid of Deep Reinforcement Learning and Local Search for the Vehicle Routing Problems", IEEE Transactions on Intelligent Transportation Systems (Volume: 22, Issue: 11, November 2021)
  7. Zhao Wang; Yuusuke Nakano; Ken Nishimatsu, "The Vehicle Routing Problem with Time Windows and Time Costs", 2021 International Conference on Data Mining Workshops (ICDMW), Doi: 10.1109/ICDMW53433.2021.00042
  8. Penglin Li; Chen Zhi; Wei Li, "An Algorithm to Solve Heterogeneous Vehicle Routing Problem With Second Trip", IEEE Access (Volume: 9), Doi: 10.1109/ACCESS.2021.3049510
  9. Roberto Baldacci, Aristide Mingozzi, Eleni Hadjiconstantinou, "An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation", Institute for Operations Research and the Management Sciences (INFORMS), 2004, Doi: 10.1287/opre.1040.0111
  10. G.Clarke and J.W.Wright, Scheduling of vehicles from a central depot to anumber of delivery points, Operations Research, 12 (1964), pp. 568-581 https://doi.org/10.1287/opre.12.4.568
  11. Li-Jiao Wu; Zhi-Hui Zhan; Sam Kwong; Jun Zhang, "Real Traffic Distance-Aware Logistics Scheduling", 2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC), Doi: 10.1109/SMC52423.2021.9659167
  12. Ashraf Elneima; Mohamed Salih, "Optimisation of Vehicle Routing Problem using Hyper-heuristics", 2020 International Conference on Computer, Control, Electrical, and Electronics Engineering (ICCCEEE), Doi: 10.1109/ICCCEEE49695.2021.9429682
  13. Khadija Ait Mamoun; Lamia Hammadi; Antonio G.N Novaes; Abdessamad El Ballouti; Eduardo Souza De Cursi, "An optimisation solution of Capacitated Vehicle Routing Problem (CVRP)", 2022 11th International Symposium on Signal, Image, Video and Communications (ISIVC), Doi: 10.1109/ISIVC54825.2022.9800726
  14. S.Lin, Computer solutions of the traveling salesman problem, Bell System TechnicalJournal, 44 (1965), pp. 2245-2269 https://doi.org/10.1002/j.1538-7305.1965.tb04146.x
  15. S. Kirkpatrick, C.D.Gelatt, and M.P.Vecchi, Optimization by simulatedannealing, Science, 220 (1983), pp. 671-680 https://doi.org/10.1126/science.220.4598.671
  16. G. Dueck and T. Scheuer, Threshold accepting: A general purpose optimiza-tion algorithm appearing superior to simulated annealing, Journal of ComputationalPhysics, 90 (1990), pp. 161-175. https://doi.org/10.1016/0021-9991(90)90201-B
  17. Future paths for integer programming and links to artificial intelligence, Com-puters & Operations Research, 13 (1986), pp. 533-549 https://doi.org/10.1016/0305-0548(86)90048-1
  18. Dantzing, G., Ramster, R., "The truck dispatching problem", Management Science 6, page 80-91, (1995). https://doi.org/10.1287/mnsc.6.1.80
  19. G.Laporte, Y.Nobert, "A branch and bound algorithm for the capacitated vehicle routing problem", Operations Research Spektrum, pp 77-85, (1983)
  20. Department of Industrial Engineering, Baskent University, Baglica Kampusu, "The multiple traveling sales man problem: an overview of formulations and solution procedures", Eskisehir Yolu 20. km., 06530 Ankara, Turkey