Abstract
With the continuous development of urban distribution services, customers have increasingly strict requirements for the delivery time windows. Therefore it is necessary to study the vehicle routing problem with simultaneous pickup-delivery and time windows (VRPSPDTW) in urban distribution. However, as one of the most important classification of the much anticipated reverse logistics, the VRPSPDTW problem has not received much attention, and lacks an efficient and simple implementation. Our method combines the enhanced Late Acceptance Hill Climbing algorithm (enhanced LAHC) to ensure the diversity of solutions and the Multi-armed Bandit Algorithm (MAB) to choose a neighborhood structure which has the best performance. In order to enhance its search ability at a later stage, a perturbation strategy is designed to effectively prevent premature convergence. To our best knowledge, the proposed h_LAHC (hybrid LAHC) algorithm is applied to the VRPSPDTW for the first time. We provide abundant experiments were conducted on 93 benchmark instances, and the results demonstrated that our algorithm can achieve better, totally equal or approximately equal results in 97.85%, 56.99% and 73.12% instances compared with the latest three mainstream algorithms respectively. In particular, the proposed algorithm has a prominent performance in scenarios with relatively narrow time windows. Moreover, we conduct an empirical analysis on critical components of the algorithm to highlight their impact on the performance of the proposed algorithm.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Almoustafa, S., Hanafi, S., Mladenović, N.: New exact method for large asymmetric distance-constrained vehicle routing problem. Eur. J. Oper. Res. 226(3), 386–394 (2013). https://doi.org/10.1016/j.ejor.2012.11.040
Appleby, J.S., Blake, D.V., Newman, E.A.: Techniques for producing school timetables on a computer and their application to other scheduling problems. Comput. J. 3(4), 237–245 (1961). https://doi.org/10.1093/comjnl/3.4.237
Auer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47 (2002). https://doi.org/10.1023/A:1013689704352
Avci, M., Topaloglu, S.: An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries. Comput. Ind. Eng. 83, 15–29 (2015). https://doi.org/10.1016/j.cie.2015.02.002
Avci, M., Topaloglu, S.: A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery. Expert Syst. Appl. (2016). https://doi.org/10.1016/j.eswa.2016.01.038
Azi, N., Gendreau, M., Potvin, J.Y.: An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur. J. Oper. Res. 202(3), 756–763 (2007). https://doi.org/10.1016/j.ejor.2009.06.034
Battarra, M., Erdoğan, G., Vigo, D.: Exact algorithms for the clustered vehicle routing problem. Oper. Res. (2014). https://doi.org/10.1287/opre.2013.1227
Boubahri, L., Addouche, S.A., El Mhamedi, A., et al.: Multi-ant colonies algorithms for the vrpspdtw. In: 2011 International Conference on Communications, Computing and Control Applications, CCCA (2011) https://doi.org/10.1109/CCCA.2011.6031488
Braekers, K., Ramaekers, K., Nieuwenhuyse, I.V.: The vehicle routing problem: state of the art classification and review. Comput. Ind. Eng. 99(Sep.):300–313. https://doi.org/10.1016/j.cie.2015.12.007 (2016)
Burke, E., Bykov, Y.: The late acceptance hillclimbing heuristic. In: Computing Science and Mathematics (2012)
Burke, E.K., Bykov, Y.: A late acceptance strategy in hill-climbing for examination timetabling problems. In: Proceedings of the Conference on the Practice and Theory of Automated Timetabling (PATAT 2008) (2008)
Burke, E.K., Bykov, Y.: The late acceptance hill-climbing heuristic. Eur. J. Oper. Res. 258(1), 70–78 (2017). https://doi.org/10.1016/j.ejor.2016.07.012
Castro, O.R., et al.: Evaluating selection methods on hyper-heuristic multi-objective particle swarm optimization. J. Heuristics 24(4), 581–616 (2018). https://doi.org/10.1007/s10732-018-9369-x
Crispim, J., Brandão, J.: Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls. J. Oper. Res. Soc. 56(11), 1296–1302 (2005). https://doi.org/10.1057/palgrave.jors.2601935
Dethloff, J.: Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR-Spektrum 23(1), 79–96 (2001)
Dueck, G.: New optimization heuristics: the great deluge algorithm and the record-to-record travel. J. Comput. Phys. 104(1), 86–92 (1993). https://doi.org/10.1006/jcph.1993.1010
Dueck, G., Scheuer, T.: Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing. J. Comput. Phys. 90(1), 161–175 (1990). https://doi.org/10.1016/0021-9991(90)90201-B
Ferreira, A., Gonçalves, R., Pozo, A.: A multi-armed bandit selection strategy for hyper-heuristics. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 525–532. https://doi.org/10.1109/CEC.2017.7969356 (2017)
Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle dispatching problem. Oper. Res. 22(2). https://doi.org/10.1287/opre.22.2.340(1974)
Glover, F.: New ejection chain and alternating path methods for traveling salesman problems. In: Balci, O., Sharda, R., Zenios, S.A. (eds) Computer Science and Operations Research. Pergamon, Amsterdam, pp. 491–509. https://doi.org/10.1016/B978-0-08-040806-4.50037-X (1992)
Goetschalckx, M., Jacobs-Blecha, C.: The vehicle routing problem with backhauls. Eur. J. Oper. Res. 42(1), 39–51 (1989). https://doi.org/10.1016/0377-2217(89)90057-X
Gong, W., Fialho, Á., Cai, Z,.Li, H.: Adaptive strategy selection in differential evolution for numerical optimization: an empirical study. Inf. Sci. 181(24), 5364–5386 (2011). https://doi.org/10.1016/j.ins.2011.07.049
Govindan, K., Soleimani, H., Kannan, D.: Reverse logistics and closed-loop supply chain: a comprehensive review to explore the future. Eur. J. Oper. Res. 240(3), 603–626 (2015). https://doi.org/10.1016/j.ejor.2014.07.012
Hof, J., Schneider, M.: An adaptive large neighborhood search with path relinking for a class of vehicle-routing problems with simultaneous pickup and delivery. Networks (2019). https://doi.org/10.1002/net.21879
Homberger, J., Gehring, H.: Two evolutionary metaheuristics for the vehicle routing problem with time windows. INFOR: Inf. Syst. Oper. Res. 37(3) 297–318 (1999). https://doi.org/10.1080/03155986.1999.11732386
Jun, Y., Kim, B.I.: New best solutions to VRPSPD benchmark problems by a perturbation based algorithm. Expert Syst. Appl. 39(5), 5641–5648 (2012). https://doi.org/10.1016/j.eswa.2011.11.053
Kalayci, C.B., Kaya, C.: An ant colony system empowered variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery. Expert Syst. Appl. 66(Dec):163–175. https://doi.org/10.1016/j.eswa.2016.09.017 (2016)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983). https://doi.org/10.1126/science.220.4598.671
Lai, M., Tong, X.: A metaheuristic method for vehicle routing problem based on improved ant colony optimization and tabu search. J. Ind. Manag. Optim. 8(2), 469–484 (2017)
Liu, F., Gui, M., Yi, C., et al.: A fast decomposition and reconstruction framework for the pickup and delivery problem with time windows and lifo loading. IEEE Access PP(99):1–1. https://doi.org/10.1109/ACCESS.2019.2920444 (2019)
Liu, J., Yuan, C., Hafeez, M., et al.: The relationship between environment and logistics performance: evidence from Asian countries. J. Clean. Prod. 204, 282–291 (2018). https://doi.org/10.1016/j.jclepro.2018.08.310
Liu, R., Xie, X., Augusto, V., et al.: Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care. Eur. J. Oper. Res. 230(3), 475–486 (2013). https://doi.org/10.1016/j.ejor.2013.04.044
Maashi, M., Özcan, E., Kendall, G.: A multi-objective hyper-heuristic based on choice function. Expert Syst. Appl. 41(9), 4475–4493 (2014). https://doi.org/10.1016/j.eswa.2013.12.050
Mingyong, L., Erbao, C.: An improved differential evolution algorithm for vehicle routing problem with simultaneous pickups and deliveries and time windows. Eng. Appl. Artif. Intell. 23(2), 188–195 (2010). https://doi.org/10.1016/j.engappai.2009.09.001
Nagy, G., Salhi, S.: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. Eur. J. Oper. Res. 162(1), 126–141 (2005). https://doi.org/10.1016/j.ejor.2002.11.003
Polat, O., Kalayci, C.B., Kulak, O., et al.: A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit. Eur. J. Oper. Res. 242(2), 369–382 (2015). https://doi.org/10.1016/j.ejor.2014.10.010
Robbins, H.: Some aspects of the sequential design of experiments. Bull. Am. Math. Soc. 58(5):527–535 (1985)
Sabar, N.R., Ayob, M., Kendall, G., et al.: A dynamic multiarmed bandit-gene expression programming hyper-heuristic for combinatorial optimization problems. IEEE Trans. Cybern. 45(2), 217–228 (2015). https://doi.org/10.1109/TCYB.2014.2323936
Shi, Y., Zhou, Y., Boudouh, T., et al.: A lexicographic-based two-stage algorithm for vehicle routing problem with simultaneous pickup-delivery and time window. Eng. Appl. Artif. Intell. 95(103), 901 (2020). https://doi.org/10.1016/j.engappai.2020.103901
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254–265 (1987). https://doi.org/10.1287/opre.35.2.254
Subramanian, A., Uchoa, E., Ochi, L.S.: New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery. Springer, Berlin (2010)
Subramanian, A., Uchoa, E., Pessoa, A.A., et al.: Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery. Oper. Res. Lett. 39(5), 338–341 (2011). https://doi.org/10.1016/j.orl.2011.06.012
Subramanian, A., Uchoa, E., Pessoa, A.A.: Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery. Optim. Lett. 7(7), 1569–1581 (2013)
Wang, C., Mu, D., Zhao, F., et al.: A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup-delivery and time windows. Comput. Ind. Eng. 83(may), 111–122 (2015). https://doi.org/10.1016/j.cie.2015.02.005
Wang, H.F., Chen, Y.Y.: A genetic algorithm for the simultaneous delivery and pickup problems with time window. Comput. Ind. Eng. 62(1), 84–95 (2012). https://doi.org/10.1016/j.cie.2011.08.018
Wassan, N.A.: A reactive tabu search for the vehicle routing problem. J. Oper. Res. Soc. 57(1), 111–116 (2006)
Yousefikhoshbakht, M., Didehvar, F., Rahmati, F.: A combination of modified tabu search and elite ant system to solve the vehicle routing problem with simultaneous pickup and delivery. J. Chin. Inst. Ind. Eng. 31(2), 65–75 (2014). https://doi.org/10.1080/21681015.2014.893928
Acknowledgements
This work is supported by the Major Program of Guangdong Basic and Applied Research under Grant 2019B030302 002, the Science and Technology Major Project of Guangzhou under Grant 202007030006, the Engineering and Technology Research Center of Guangdong Province for Logistics Supply Chain and Internet of Things under Grant GDDST[2016]176, the Industrial Development Fund Project of Guangzhou under Project x2jsD8183470.
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
Conflict of interest
The authors declare that there are no conflict of interests, we do not have any potential conflicts of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
A Experimental results
A Experimental results
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Liu, F., Wang, L., Gui, M. et al. A hybrid heuristic algorithm for urban distribution with simultaneous pickup-delivery and time window. J Heuristics 29, 269–311 (2023). https://doi.org/10.1007/s10732-023-09510-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-023-09510-1