{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T03:55:13Z","timestamp":1777607713516,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2015,5,29]],"date-time":"2015-05-29T00:00:00Z","timestamp":1432857600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10732-015-9293-2","type":"journal-article","created":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T13:05:49Z","timestamp":1432818349000},"page":"617-639","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A study of perturbation operators for the pickup and delivery traveling salesman problem with LIFO or FIFO loading"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5685-4940","authenticated-orcid":false,"given":"Lijun","family":"Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenbin","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Wan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,29]]},"reference":[{"key":"9293_CR1","unstructured":"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"},{"key":"9293_CR2","doi-asserted-by":"crossref","unstructured":"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\u2013238 (2007a)","DOI":"10.3138\/infor.45.4.223"},{"key":"9293_CR3","doi-asserted-by":"crossref","unstructured":"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\u2013632 (2007b)","DOI":"10.1287\/ijoc.1060.0202"},{"key":"9293_CR4","unstructured":"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)"},{"key":"9293_CR5","doi-asserted-by":"crossref","unstructured":"Cordeau, J.F., Dell\u2019Amico, M., Iori, M.: Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading. Comput. Oper. Res. 37(5), 970\u2013980 (2010a)","DOI":"10.1016\/j.cor.2009.08.003"},{"key":"9293_CR6","doi-asserted-by":"crossref","unstructured":"Cordeau, J.F., Iori, M., Laporte, G., Salazar Gonz\u00e1lez, J.J.: A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks 55(1), 46\u201359 (2010b)","DOI":"10.1002\/net.20312"},{"issue":"3","key":"9293_CR7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/(SICI)1097-0037(199910)34:3<181::AID-NET2>3.0.CO;2-Y","volume":"34","author":"C Duin","year":"1999","unstructured":"Duin, C., Vo\u00df, S.: The pilot method: a strategy for heuristic repetition with application to the steiner problem in graphs. Networks 34(3), 181\u2013191 (1999)","journal-title":"Networks"},{"issue":"2","key":"9293_CR8","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s10107-008-0234-9","volume":"121","author":"I Dumitrescu","year":"2009","unstructured":"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\u2013305 (2009)","journal-title":"Math. Program."},{"issue":"6","key":"9293_CR9","doi-asserted-by":"crossref","first-page":"1800","DOI":"10.1016\/j.cor.2008.05.005","volume":"36","author":"G Erdo\u01e7an","year":"2009","unstructured":"Erdo\u01e7an, 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\u20131808 (2009)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9293_CR10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0377-2217(93)E0292-6","volume":"83","author":"P Healy","year":"1995","unstructured":"Healy, P., Moll, R.: A new extension of local search applied to the dial-a-ride problem. Eur. J. Oper. Res. 83(1), 83\u2013104 (1995)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9293_CR11","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/s11750-010-0144-x","volume":"18","author":"M Iori","year":"2010","unstructured":"Iori, M., Martello, S.: Routing problems with loading constraints. TOP 18(1), 4\u201327 (2010)","journal-title":"TOP"},{"issue":"3","key":"9293_CR12","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0377-2217(85)90257-7","volume":"22","author":"B Kalantari","year":"1985","unstructured":"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\u2013386 (1985)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9293_CR13","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1016\/j.ejor.2011.02.008","volume":"212","author":"Y Li","year":"2011","unstructured":"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\u2013496 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"9293_CR14","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/978-1-4419-1665-5_13","volume-title":"Handbook of Metaheuristics","author":"D Pisinger","year":"2010","unstructured":"Pisinger, D., Roke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, pp. 399\u2013419. Springer, Berlin (2010)"},{"issue":"3","key":"9293_CR15","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"JY Potvin","year":"1993","unstructured":"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\u2013340 (1993)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9293_CR16","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB- traveling salesman problem library. ORSA J. Comput. 3(4), 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"issue":"10","key":"9293_CR17","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/S0305-0548(99)00066-0","volume":"27","author":"J Renaud","year":"2000","unstructured":"Renaud, J., Boctor, F.F., Ouenniche, J.: A heuristic for the pickup and delivery traveling salesman problem. Comput. Oper. Res. 27(10), 905\u2013916 (2000)","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"9293_CR18","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1016\/S0305-0548(00)00109-X","volume":"29","author":"J Renaud","year":"2002","unstructured":"Renaud, J., Boctor, F.F., Laporte, G.: Perturbation heuristics for the pickup and delivery traveling salesman problem. Comput. Oper. Res. 29(9), 1129\u20131141 (2002)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9293_CR19","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1016\/j.cor.2011.05.005","volume":"39","author":"GM Ribeiro","year":"2012","unstructured":"Ribeiro, G.M., Laporte, G.: An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 39(3), 728\u2013735 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"9293_CR20","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40(4), 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"key":"9293_CR21","doi-asserted-by":"crossref","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Principles and Practice of Constraint Programming-CP98, pp. 417\u2013431 (1998)","DOI":"10.1007\/3-540-49481-2_30"},{"issue":"2","key":"9293_CR22","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1002\/1520-6750(199203)39:2<137::AID-NAV3220390202>3.0.CO;2-D","volume":"39","author":"MA Trick","year":"1992","unstructured":"Trick, M.A.: A linear relaxation heuristic for the generalized assignment problem. Nav. Res. Logist. 39(2), 137\u2013151 (1992)","journal-title":"Nav. Res. Logist."},{"issue":"1","key":"9293_CR23","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/s10479-005-2060-2","volume":"136","author":"S Vo\u00df","year":"2005","unstructured":"Vo\u00df, S., Fink, A., Duin, C.: Looking ahead with the pilot method. Ann. Oper. Res. 136(1), 285\u2013302 (2005)","journal-title":"Ann. Oper. Res."},{"key":"9293_CR24","doi-asserted-by":"crossref","unstructured":"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\u2013407, Chongqing (2010)","DOI":"10.1109\/ICEIT.2010.5607657"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-015-9293-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-015-9293-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-015-9293-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T18:54:35Z","timestamp":1559242475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-015-9293-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,29]]},"references-count":24,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9293"],"URL":"https:\/\/doi.org\/10.1007\/s10732-015-9293-2","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,5,29]]}}}