Abstract
With the growth of market competition on manufacture, milk-run becomes a popular just-in-time (JIT) logistic strategy to ensure vehicle pickups and delivers goods on multiple round trips with fixed time window. Reasonable milk-run vehicle routing planning is able to improve the utilization of vehicle, so that logistic cost can be reduced. In order to better capture the real-world scenes, we build a novel milk-run model called MOPDPTW (Multiple-Orders Pickup and Delivery Problem with Time-bound Window) based on PDPTW (Pickup and Delivery Problem with Time Window). Aiming at minimizing the number of used vehicles and total travel distance in this model, a two-layers heuristic search algorithm is proposed to solve this problem. The inner layer of proposed algorithm searches possible solutions in global and sends them to the outer layer to find local optimal solution. We validate our algorithm against an improved large neighborhood algorithm on standard Li and Lim’s benchmark and instances modified for MOPDPTW. The experiment results show that our algorithm performs better in reducing the logistic cost of milk-run.
This work is financially supported by National Key R&D Program of China under Grant No. 2017YFB0803002 and No. 2016YFB0800804, National Natural Science Foundation of China under Grant No. 61672195 and No. 61732022.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. In: Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2001, Dallas, TX, USA, pp. 160–167 (2001). https://doi.org/10.1109/ICTAI.2001.974461
Männel, D., Bortfeldt, A.: A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints. Eur. J. Oper. Res. 254(3), 840–858 (2016)
Kong, J.-L., Jia, G.-Z., Gan, C.-Y.: A new mathematical model of vehicle routing problem based on milk-run. In: International Conference on Management Science & Engineering. IEEE (2013)
Miao, Z., Xu, K.L.: Modeling and simulation of lean supply chain with the consideration of delivery consolidation. Key Eng. Mater. 467–469(467–469), 853–858 (2011)
Desrochers, M., Desrosiers, J., Solomon, M.: A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40, 342–354 (1992)
Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40, 455–472 (2006)
Nguyen, T.H.D. Dao, T.M.: Novel approach to optimize milk-run delivery: a case study. In: 2015 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), Singapore, pp. 351–355 (2015). https://doi.org/10.1109/IEEM.2015.7385667
Nagata, Y., Kobayashi, S.: Guided ejection search for the pickup and delivery problem with time windows. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 202–213. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-12139-5_18
Huang, M., Yang, J., et al.: The modeling of milk-run vehicle routing problem based on improved C-W algorithm that joined time window. Transp. Res. Proc. 25, 716–728 (2017)
Ma, H.J., Wei, J.: Milk-run vehicle routing optimization model and algorithm of automobile parts. Appl. Mech. Mater. 1463–1467 (2013)
Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., et al.: Static pickup and delivery problems: aclassification scheme and survey. TOP 15(1), 1–31 (2007)
Montero, A., Jose Miranda-Bront, J., Mendez-Diaz, I.: An ILP-based local search procedure for the VRP with pickups and deliveries. Ann. Oper. Res. 259(1–2), 327–350 (2017)
Sintef: Li and Lim benchmark. https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/100-customers/
Alnahhal, M., Ridwan, A., Noche, B.: In-plant milk run decision problems. In: International Conference on Logistics & Operations Management. IEEE (2014)
Gyulai, D., Pfeiffer, A., Sobottka, T., et al.: Milkrun vehicle routing approach for shop-floor logistics. Proc. Cirp 7, 127–132 (2013)
Urru, A., Bonini, M., Echelmeyer, W.: Planning of a milk-run systems in high constrained industrial scenarios. In: 2018 IEEE 22nd International Conference on Intelligent Engineering Systems (INES). IEEE (2018)
Nalepa, J., Blocho, M.: A parallel memetic algorithm for the pickup and delivery problem with time windows. In: Euromicro International Conference on Parallel. IEEE (2017)
Alaia, E.B., Dridi, I.H., Bouchriha, H., et al.: Optimization of the multi-depot & multi-vehicle pickup and delivery problem with time windows using genetic algorithm. In: International Conference on Control. IEEE (2013)
Huang, Y., Ting, C.: Ant Colony optimization for the single vehicle pickup and delivery problem with time window. In: International Conference on Technologies & Applications of Artificial Intelligence. IEEE Computer Society (2010)
Li, L., Yaohua, W., Hongchun, H., et al.: A hybrid intelligent algorithm for vehicle pick-up and delivery problem with time windows. In: Control Conference. IEEE (2007)
Bent, R., Hentenryck, P.V.: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Comput. Oper. Res. 33(4), 875–893 (2006)
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Cai, X., Jiang, L., Guo, S., Huang, H., Du, H. (2020). A Two-Layers Heuristic Search Algorithm for Milk Run with a New PDPTW Model. In: Wu, W., Zhang, Z. (eds) Combinatorial Optimization and Applications. COCOA 2020. Lecture Notes in Computer Science(), vol 12577. Springer, Cham. https://doi.org/10.1007/978-3-030-64843-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-030-64843-5_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-64842-8
Online ISBN: 978-3-030-64843-5
eBook Packages: Computer ScienceComputer Science (R0)