Have a personal or library account? Click to login
Optimal vehicle route schedules in picking up and delivering cargo containers considering time windows in logistics distribution networks: A case study Cover

Optimal vehicle route schedules in picking up and delivering cargo containers considering time windows in logistics distribution networks: A case study

Open Access
|Dec 2020

References

  1. An, H., Li, W. 2011. Synthetically improved genetic algorithm on the traveling salesman problem in material transportation, In Proceedings of 2011 International Conference on Electronic & Mechanical Engineering and Information Technology, 7, IEEE, 3368-3371.10.1109/EMEIT.2011.6023808
  2. Afifi, S., Dang, D.C., Moukrim, A., 2016. Heuristic solutions for the vehicle routing problem with time windows and synchronized visits, Optimization Letters, 10(3), 511-525.10.1007/s11590-015-0878-3
  3. Aggarwal, D., Kumar, V., 2019. Mixed integer programming for vehicle routing problem with time windows, International Journal of Intelligent Systems Technologies and Applications, 18(1-2), 4-19.10.1504/IJISTA.2019.097744
  4. Alsheddy, A., 2011. Empowerment scheduling: a multi-objective optimization approach using guided local search, Doctoral dissertation, University of Essex.
  5. Archetti, C., Speranza, M.G., Hertz, A., 2006. A tabu search algorithm for the split delivery vehicle routing problem, Transportation science, 40(1), 64-73.10.1287/trsc.1040.0103
  6. Barbarosoglu, G., Ozgur, D., 1999. A tabu search algorithm for the vehicle routing problem, Computers Operations Research, 26(3), 255-270.10.1016/S0305-0548(98)00047-1
  7. Bent, R., & Van Hentenryck, P. (2006). A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers & Operations Research, 33(4), 875-893.10.1016/j.cor.2004.08.001
  8. Birim, Ş., 2016. Vehicle routing problem with cross docking: A simulated annealing approach, Procedia-Social and Behavioral Sciences, 235(Supplement C), 149-158.10.1016/j.sbspro.2016.11.010
  9. Busetti, F., 2003. Simulated annealing overview, World Wide Web URL, www. geocities. com/francorbusetti/saweb. pdf, 4.
  10. Cao, W., Yang, W., 2017. A survey of vehicle routing problem, In MATEC Web of Conferences, 100, EDP Sciences,01006.10.1051/matecconf/201710001006
  11. Connor, A. M., Shea, K., 2000. A comparison of semi-deterministic and stochastic search techniques, In Evolutionary Design and Manufacture, Springer, London, 287-298.10.1007/978-1-4471-0519-0_23
  12. Chen, Q., Li, K., & Liu, Z. (2014). Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads. Transportation Research Part E: Logistics and Transportation Review, 69, 218-235.10.1016/j.tre.2014.06.010
  13. Dantzig, G. B., Ramser, J. H., 1959. The truck dispatching problem, Management science, 6(1), 80-91.10.1287/mnsc.6.1.80
  14. Dongyang, X., Kunpeng, L., Jiehui, Y., Ligang, C., 2020. A multicommodity unpaired pickup and delivery vehicle routing problem with split loads and unloads, Industrial Management & Data Systems.10.1108/IMDS-01-2020-0050
  15. Gan, X., Wang, Y., Li, S., Niu, B., 2012. Vehicle routing problem with time windows and simultaneous delivery and pick-up service based on MCPSO, Mathematical Problems in Engineering, 2012.10.1155/2012/104279
  16. Gunawan, A., Widjaja, A. T., Gan, B., Yu, V. F., Jodiawan, P., 2020. Vehicle routing problem for multi-product cross-docking.
  17. Huang, M., Yang, J., Ma, T., Li, X., Wang, T., 2017. The modeling of milkrun vehicle routing problem based on improved CW algorithm that joined time window, Transp. Res. Procedia, 25, 716-728.10.1016/j.trpro.2017.05.453
  18. Rodrigue J.P., 2020, New York: Routledge, ISBN 978-0-367-36463-2, 456.
  19. Kantawong, K., Pravesjit, S., 2020. An Enhanced ABC algorithm to Solve the Vehicle Routing Problem with Time Windows, ECTI Transactions on Computer and Information Technology (ECTI-CIT), 14(1), 46-52.10.37936/ecti-cit.2020141.200016
  20. Kilby, P., Prosser, P., Shaw, P., 1999. Guided local search for the vehicle routing problem with time windows, In Meta-heuristics, Springer, Boston, MA, 473-486.10.1007/978-1-4615-5775-3_32
  21. Kuo, Y., 2010. Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem, Computers Industrial Engineering, 59(1), 157-165.10.1016/j.cie.2010.03.012
  22. Masmoudi, M., Mellouli, R. 2014. MILP for synchronized-mTSPTW: application to home healthCare scheduling, In 2014 International Conference on Control, Decision and Information Technologies (CoDIT), IEEE, 297-302.10.1109/CoDIT.2014.6996910
  23. Mohammed, M.A., Abd Ghani, M.K., Hamed, R.I., Mostafa, S.A., Ahmad, M.S., Ibrahim, D.A., 2017. Solving vehicle routing problem by using improved genetic algorithm for optimal solution, Journal of computational science, 21, 255-262.10.1016/j.jocs.2017.04.003
  24. Londoño, J.C., Tordecilla, R.D., Martins, L.D.C., Juan, A.A., 2020. A biasedrandomized iterated local search for the vehicle routing problem with optional backhauls, TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, 1-30.10.1007/s11750-020-00558-x
  25. Pérez-Rodríguez, R., Hernández-Aguirre, A., 2019. A hybrid estimation of distribution algorithm for the vehicle routing problem with time windows, Computers & Industrial Engineering, 130, 75-96.10.1016/j.cie.2019.02.017
  26. Qi, C., Hu, L., 2020. Optimization of vehicle routing problem for emergency cold chain logistics based on minimum loss, Physical Communication, 101085.10.1016/j.phycom.2020.101085
  27. Ruiz, E., Soto-Mendoza, V., Barbosa, A.E.R., Reyes, R., 2019. Solving the open vehicle routing problem with capacity and distance constraints with a biased random key genetic algorithm, Computers & Industrial Engineering, 133, 207-219.10.1016/j.cie.2019.05.002
  28. Setamanit, S.-O. 2019. Improving transportation contract management using simulation, Polish Journal of Management Studies, 20 (2), 466-477.10.17512/pjms.2019.20.2.39
  29. Shuai, Y., Yunfeng, S., Kai, Z., 2019. An effective method for solving multiple travelling salesman problem based on NSGA-II, Systems Science & Control Engineering, 7(2), 108-116.10.1080/21642583.2019.1674220
  30. Straka, M., Rosová, A., Lenort, R., Besta, P., & Šaderová, J. 2018. Principles of computer simulation design for the needs of improvement of the raw materials combined transport system. Acta Montanistica Slovaca, 23(2), 163-174.
  31. Tasar, B., Türsel Eliiyi, D., Kandiller, L., 2019. Vehicle Routing with Compartments Under Product Incompatibility Constraints, Promet-Traffic& Transportation, 31(1), 25-36.10.7307/ptt.v31i1.2670
  32. Toth, P., & Vigo, D. (Eds.). (2014). Vehicle routing: problems, methods, and applications. Society for Industrial and Applied Mathematics.10.1137/1.9781611973594
  33. Van Brummelen, G., 2012. Heavenly mathematics: The forgotten art of spherical trigonometry, Princeton University Press.10.1515/9781400844807
  34. Vincent, F.Y., Jewpanya, P., Redi, A.P., 2016. Open vehicle routing problem with cross-docking, Computers & Industrial Engineering, 94, 6-17.10.1016/j.cie.2016.01.018
  35. Voudouris, C., Tsang, E. P., 2003. Guided local search, In Handbook of metaheuristics, Springer, Boston, MA, 185-218.10.1007/0-306-48056-5_7
  36. Spliet, R., Desaulniers, G., 2015. The discrete time window assignment vehicle routing problem, European Journal of Operational Research, 244(2), 379-391.10.1016/j.ejor.2015.01.020
  37. Wang, C., Mu, D., Zhao, F., Sutherland, J. W., 2015. A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup–delivery and time windows, Computers & Industrial Engineering, 83, 111-122.10.1016/j.cie.2015.02.005
  38. Wei, L., Zhang, Z., Zhang, D., Leung, S.C., 2018. A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints, European Journal of Operational Research, 265(3), 843-859.10.1016/j.ejor.2017.08.035
  39. Xu, X., Yuan, H., Liptrott, M., & Trovati, M. (2018). Two phase heuristic algorithm for the multiple-travelling salesman problem. Soft Computing, 22(19), 6567-6581.10.1007/s00500-017-2705-5
  40. Zhang, D., Cai, S., Ye, F., Si, Y. W., Nguyen, T.T., 2017. A hybrid algorithm for a vehicle routing problem with realistic constraints, Information Sciences, 394, 167-182.10.1016/j.ins.2017.02.028
  41. Zhu, L., Hu, D., 2019. Study on the vehicle routing problem considering congestion and emission factors, International Journal of Production Research, 57(19), 6115-6129.10.1080/00207543.2018.1533260
DOI: https://doi.org/10.30657/pea.2020.26.31 | Journal eISSN: 2353-7779 | Journal ISSN: 2353-5156
Language: English
Page range: 174 - 184
Submitted on: Aug 26, 2020
Accepted on: Oct 12, 2020
Published on: Dec 31, 2020
Published by: Quality and Production Managers Association
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2020 Thi Diem Chau Le, Duy Duc Nguyen, Judit Oláh, Miklós Pakurár, published by Quality and Production Managers Association
This work is licensed under the Creative Commons Attribution-ShareAlike 4.0 License.