{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T23:11:10Z","timestamp":1769469070206,"version":"3.49.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,6,1]],"date-time":"2018-06-01T00:00:00Z","timestamp":1527811200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2020,10,20]],"date-time":"2020-10-20T00:00:00Z","timestamp":1603152000000},"content-version":"vor","delay-in-days":872,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100006041","name":"Innovate UK","doi-asserted-by":"publisher","award":["102037"],"award-info":[{"award-number":["102037"]}],"id":[{"id":"10.13039\/501100006041","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Transportation and Logistics"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s13676-017-0115-6","type":"journal-article","created":{"date-parts":[[2018,1,12]],"date-time":"2018-01-12T04:21:37Z","timestamp":1515730897000},"page":"151-192","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":27,"title":["Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows"],"prefix":"10.1016","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4743-416X","authenticated-orcid":false,"given":"Timothy","family":"Curtois","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dario","family":"Landa-Silva","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wasakorn","family":"Laesanklang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1007\/s13676-017-0115-6_bib1","doi-asserted-by":"crossref","unstructured":"Battarra M, Cordeau J, Iori M (2014) Chapter 6: pickup-and-delivery problems for goods transportation. In: Vehicle routing. Society for Industrial and Applied Mathematics. pp 161\u2013191","DOI":"10.1137\/1.9781611973594.ch6"},{"issue":"4","key":"10.1007\/s13676-017-0115-6_bib2","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.cor.2004.08.001","article-title":"A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows","volume":"33","author":"Bent","year":"2006","journal-title":"Comput Oper Res"},{"issue":"1","key":"10.1007\/s13676-017-0115-6_bib3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","article-title":"Static pickup and delivery problems: a classification scheme and survey","volume":"15","author":"Berbeglia","year":"2007","journal-title":"TOP"},{"key":"10.1007\/s13676-017-0115-6_bib4","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ejor.2016.07.012","article-title":"The late acceptance hill-climbing heuristic","volume":"258","author":"Burke","year":"2016","journal-title":"Eur J Oper Res"},{"key":"10.1007\/s13676-017-0115-6_bib5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.cor.2015.04.002","article-title":"A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading","volume":"62","author":"Cherkesly","year":"2015","journal-title":"Comput Oper Res"},{"issue":"1","key":"10.1007\/s13676-017-0115-6_bib6","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","article-title":"The pickup and delivery problem with time windows","volume":"54","author":"Dumas","year":"1991","journal-title":"Eur J Oper Res"},{"issue":"7","key":"10.1007\/s13676-017-0115-6_bib7","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/S0305-0548(98)00085-9","article-title":"Heuristics for the traveling salesman problem with pickup and delivery","volume":"26","author":"Gendreau","year":"1999","journal-title":"Comput Oper Res"},{"issue":"3","key":"10.1007\/s13676-017-0115-6_bib8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.trc.2006.03.002","article-title":"Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries","volume":"14","author":"Gendreau","year":"2006","journal-title":"Transp Res Part C Emerg Technol"},{"key":"10.1007\/s13676-017-0115-6_bib9","unstructured":"Hall R, Partyka J (2016) Vehicle routing software survey: higher expectations drive transformation. ORMS-Today 43(1):40\u201344"},{"key":"10.1007\/s13676-017-0115-6_bib10","unstructured":"Kammarti R et al. (2004) A new hybrid evolutionary approach for the pickup and delivery problem with time windows. In: systems, man and cybernetics, 2004 IEEE International Conference on"},{"issue":"02","key":"10.1007\/s13676-017-0115-6_bib11","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1142\/S0218213003001186","article-title":"A metaheuristic for the pickup and delivery problem with time windows","volume":"12","author":"Li","year":"2003","journal-title":"Int J Artif Intell Tools"},{"issue":"4","key":"10.1007\/s13676-017-0115-6_bib12","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1287\/trsc.1030.0040","article-title":"An exact algorithm for the multiple vehicle pickup and delivery problem","volume":"38","author":"Lu","year":"2004","journal-title":"Transp Sci"},{"issue":"3","key":"10.1007\/s13676-017-0115-6_bib13","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/trsc.1120.0432","article-title":"An adaptive large neighborhood search for the pickup and delivery problem with transfers","volume":"47","author":"Masson","year":"2012","journal-title":"Transp Sci"},{"issue":"5","key":"10.1007\/s13676-017-0115-6_bib14","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/j.orl.2009.04.006","article-title":"A powerful route minimization heuristic for the vehicle routing problem with time windows","volume":"37","author":"Nagata","year":"2009","journal-title":"Oper Res Lett"},{"key":"10.1007\/s13676-017-0115-6_bib15","doi-asserted-by":"crossref","unstructured":"Nagata Y, Kobayashi S (2010a) Guided ejection search for the pickup and delivery problem with time windows. In: Cowling P, Merz P (eds) Evolutionary computation in combinatorial optimization: 10th European Conference, EvoCOP 2010, Istanbul, Turkey, April 7\u20139, 2010. Proceedings, Springer: Berlin, Heidelberg. pp 202\u2013213","DOI":"10.1007\/978-3-642-12139-5_18"},{"key":"10.1007\/s13676-017-0115-6_bib16","doi-asserted-by":"crossref","unstructured":"Nagata Y, Kobayashi S (2010b) A memetic algorithm for the pickup and delivery problem with time windows using selective route exchange crossover. In: Schaefer R et al. (ed) Parallel problem solving from nature, PPSN XI: 11th international conference, Krak\u00f3w, Poland, September 11\u201315, 2010, proceedings, Part I, Springer: Berlin, Heidelberg. pp 536\u2013545","DOI":"10.1007\/978-3-642-15844-5_54"},{"issue":"2","key":"10.1007\/s13676-017-0115-6_bib17","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0191-2615(99)00016-8","article-title":"Solving the pickup and delivery problem with time windows using reactive tabu search","volume":"34","author":"Nanry","year":"2000","journal-title":"Transp Res Part B Methodol"},{"issue":"1","key":"10.1007\/s13676-017-0115-6_bib18","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","article-title":"A survey on pickup and delivery problems","volume":"58","author":"Parragh","year":"2008","journal-title":"J f\u00fcr Betriebswirtschaft"},{"issue":"3","key":"10.1007\/s13676-017-0115-6_bib19","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1287\/trsc.1090.0272","article-title":"Branch and cut and price for the pickup and delivery problem with time windows","volume":"43","author":"Ropke","year":"2009","journal-title":"Transp Sci"},{"issue":"4","key":"10.1007\/s13676-017-0115-6_bib20","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","article-title":"An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows","volume":"40","author":"Ropke","year":"2006","journal-title":"Transp Sci"},{"issue":"12","key":"10.1007\/s13676-017-0115-6_bib21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0898-1221(97)00090-4","article-title":"The pickup and delivery problem: faces and branch-and-cut algorithm","volume":"33","author":"Ruland","year":"1997","journal-title":"Comput Math Appl"},{"issue":"1","key":"10.1007\/s13676-017-0115-6_bib22","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1287\/trsc.29.1.17","article-title":"The general pickup and delivery problem","volume":"29","author":"Savelsbergh","year":"1995","journal-title":"Transp Sci"},{"issue":"4","key":"10.1007\/s13676-017-0115-6_bib23","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1287\/opre.46.4.474","article-title":"DRIVE: dynamic routing of independent vehicles","volume":"46","author":"Savelsbergh","year":"1998","journal-title":"Oper Res"},{"key":"10.1007\/s13676-017-0115-6_bib24","doi-asserted-by":"crossref","unstructured":"Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: Maher M, Puget JF (eds) Principles and practice of constraint programming\u2014CP98: 4th international conference, CP98 Pisa, Italy, October 26\u201330, 1998 Proceedings. Springer: Berlin, Heidelberg. pp 417\u2013431","DOI":"10.1007\/3-540-49481-2_30"},{"issue":"12","key":"10.1007\/s13676-017-0115-6_bib25","doi-asserted-by":"crossref","first-page":"1647","DOI":"10.1016\/j.cor.2011.02.009","article-title":"An efficient column-generation-based algorithm for solving a pickup-and-delivery problem","volume":"38","author":"Venkateshan","year":"2011","journal-title":"Comput Oper Res"},{"issue":"3","key":"10.1007\/s13676-017-0115-6_bib26","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/trsc.37.3.347.16044","article-title":"Solving a practical pickup and delivery problem","volume":"37","author":"Xu","year":"2003","journal-title":"Transp Sci"}],"container-title":["EURO Journal on Transportation and Logistics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13676-017-0115-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-017-0115-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300716?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192437620300716?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13676-017-0115-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:43:07Z","timestamp":1761882187000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192437620300716"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["S2192437620300716"],"URL":"https:\/\/doi.org\/10.1007\/s13676-017-0115-6","relation":{},"ISSN":["2192-4376"],"issn-type":[{"value":"2192-4376","type":"print"}],"subject":[],"published":{"date-parts":[[2018,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Transportation and Logistics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13676-017-0115-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2018 THE AUTHORS. Published by Elsevier on behalf of the Association of European Operational Research Societies (EURO). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}