Abstract
This paper investigates perturbation operators for variable neighborhood search (VNS) approaches for two related problems, namely the pickup and delivery traveling salesman problem with LIFO loading (TSPPDL) and FIFO loading (TSPPDF). Our study is motivated by the fact that previously published results on VNS approaches on the TSPPDL suggest that the perturbation operation has the most significant effect on solution quality. We propose a new perturbation operator for the TSPPDL that achieves better results on average than the existing best approach. We also devise new perturbation operators for the TSPPDF that combine request removal and request insertion operations, and investigate which combination of request removal and request insertion operations produces the best results. Our resultant VNS that employs our best perturbation operator outperforms the best existing TSPPDF approach on benchmark test data.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Azi, N., Gendreau, M., Potvin, J.Y.: An adaptive large neighborhood search for a vehicle routing problem with multiple trips. Technical Report, CIRRELT-2010-08. https://www.cirrelt.ca/documentstravail/cirrelt-2010-08 (2010). Accessed 12 Sept 2011
Carrabs, F., Cerulli, R., Cordeau, J.F.: An additive branch-and-bound algorithm for the pickup and delivery traveling salesman problem with LIFO or FIFO loading. INFOR Inf. Syst. Oper. Res. 45(4), 223–238 (2007a)
Carrabs, F., Cordeau, J.F., Laporte, G.: Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. INFORMS J. Comput. 19(4), 618–632 (2007b)
Cassani, L., Righini, G.: Heuristic algorithms for the TSP with rear-loading. In: 35th Annual Conference of the Italian Operational Research Society (AIRO XXXV), Lecce (2004)
Cordeau, J.F., Dell’Amico, M., Iori, M.: Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading. Comput. Oper. Res. 37(5), 970–980 (2010a)
Cordeau, J.F., Iori, M., Laporte, G., Salazar González, J.J.: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks 55(1), 46–59 (2010b)
Duin, C., Voß, S.: The pilot method: a strategy for heuristic repetition with application to the steiner problem in graphs. Networks 34(3), 181–191 (1999)
Dumitrescu, I., Ropke, S., Cordeau, J.F., Laporte, G.: The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm. Math. Program. 121(2), 269–305 (2009)
Erdoǧan, G., Cordeau, J.F., Laporte, G.: The pickup and delivery traveling salesman problem with first-in-first-out loading. Comput. Oper. Res. 36(6), 1800–1808 (2009)
Healy, P., Moll, R.: A new extension of local search applied to the dial-a-ride problem. Eur. J. Oper. Res. 83(1), 83–104 (1995)
Iori, M., Martello, S.: Routing problems with loading constraints. TOP 18(1), 4–27 (2010)
Kalantari, B., Hill, A.V., Arora, S.R.: An algorithm for the traveling salesman problem with pickup and delivery customers. Eur. J. Oper. Res. 22(3), 377–386 (1985)
Li, Y., Lim, A., Oon, W.C., Qin, H., Tu, D.: The tree representation for the pickup and delivery traveling salesman problem with LIFO loading. Eur. J. Oper. Res. 212(3), 482–496 (2011)
Pisinger, D., Roke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, pp. 399–419. Springer, Berlin (2010)
Potvin, J.Y., Rousseau, J.M.: A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. Eur. J. Oper. Res. 66(3), 331–340 (1993)
Reinelt, G.: TSPLIB- traveling salesman problem library. ORSA J. Comput. 3(4), 376–384 (1991)
Renaud, J., Boctor, F.F., Ouenniche, J.: A heuristic for the pickup and delivery traveling salesman problem. Comput. Oper. Res. 27(10), 905–916 (2000)
Renaud, J., Boctor, F.F., Laporte, G.: Perturbation heuristics for the pickup and delivery traveling salesman problem. Comput. Oper. Res. 29(9), 1129–1141 (2002)
Ribeiro, G.M., Laporte, G.: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 39(3), 728–735 (2012)
Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455–472 (2006)
Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Principles and Practice of Constraint Programming-CP98, pp. 417–431 (1998)
Trick, M.A.: A linear relaxation heuristic for the generalized assignment problem. Nav. Res. Logist. 39(2), 137–151 (1992)
Voß, S., Fink, A., Duin, C.: Looking ahead with the pilot method. Ann. Oper. Res. 136(1), 285–302 (2005)
Weng, Y., Guo, S., Zhu, W., Lim, A., Oon, W.C.: The 6 key elements to SCLP block building approaches. In: 2010 International Conference on Educational and Information Technology (ICEIT), vol. 1, pp. 402–407, Chongqing (2010)
Acknowledgments
This work was supported by the National Nature Science Foundation of China (Grant No. 71401065, 71201065).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wei, L., Qin, H., Zhu, W. et al. A study of perturbation operators for the pickup and delivery traveling salesman problem with LIFO or FIFO loading. J Heuristics 21, 617–639 (2015). https://doi.org/10.1007/s10732-015-9293-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-015-9293-2