{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T16:29:40Z","timestamp":1777393780639,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540221166","type":"print"},{"value":"9783540246886","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24688-6_142","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T22:38:51Z","timestamp":1284158331000},"page":"1102-1108","source":"Crossref","is-referenced-by-count":6,"title":["An Evolutionary Approach to Pickup and Delivery Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Jean-Charles","family":"Cr\u00e9put","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abder","family":"Koukam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jaroslaw","family":"Kozlak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Lukasik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"142_CR1","unstructured":"Benchmarks \u2013 Vehicle Routing and Travelling Salesperson Problems. Updated; April 23 (2003), http:\/\/www.sintef.no\/static\/am\/opti\/projects\/top\/vrp\/benchmarks.html"},{"key":"142_CR2","unstructured":"Braysy, O.: Genetic Algorithms for the Vehicle Routing Problem with Time Windows. Arpakanuus 1, special issue on Bioinformatics and Genetic Algorithms (2001)"},{"key":"142_CR3","doi-asserted-by":"crossref","unstructured":"Cordeau, J.-F., Laporte, G.: The Dial-a-Ride Problem: Variants, Modeling Issues and Algorithms. Les Cahiers du GERAD (2002)","DOI":"10.1007\/s10288-002-0009-8"},{"key":"142_CR4","unstructured":"Desaulniers, G., Desrosiers, J., Erdmann, A., Solomon, M.M., Soumis, F.: The VRP with Pickup and Delivery. Les Cahiers du GERAD (2000)"},{"key":"142_CR5","unstructured":"Gendreau, A., Guertin, F., Potvin, J.Y., S\u00e9guin, R.: Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Rapport technique CRT-98-10, Universit\u00e9 de Montr\u00e9al (1998)"},{"key":"142_CR6","unstructured":"Lau, H.C., Liang, Z.: Pickup and Delivery with Time Windows: Algorithms and Test Case Generation. In: Proceeedings of 13th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2001), Dallas, USA (2001)"},{"key":"142_CR7","doi-asserted-by":"crossref","unstructured":"Li, H., Lim, A.: A Metaheuristic for the Pickup and Delivery Problem with Time Windows. In: Proceedings of 13th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2001), Dallas, USA (2001)","DOI":"10.1109\/ICTAI.2001.974461"},{"key":"142_CR8","unstructured":"Lim, H., Lim, A., Rodrigues, B.: Solving the Pick up and Delivery Problem using \u201dSqueaky Wheel\u201d Optimization with Local Search. In: Proceedings of American Conference on Information Systems, AMCIS 2002, Dallas, USA (2002)"},{"key":"142_CR9","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/BF02031946","volume":"60","author":"O.B.G. Madsen","year":"1995","unstructured":"Madsen, O.B.G., Ravn, H.F., Rygaard, J.M.: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives. Annals of Operations Research\u00a060, 193\u2013208 (1995)","journal-title":"Annals of Operations Research"},{"key":"142_CR10","unstructured":"Mitrowic-Minic, S.: Pickup and Delivery Problem with Time Windows: A Survey. SFU CMPT TR. 1998-12 (1998), ftp:\/\/fas.sfu.ca\/pub\/cs\/techreports\/1998"},{"key":"142_CR11","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0191-2615(99)00016-8","volume":"34","author":"W.P. Nanry","year":"2000","unstructured":"Nanry, W.P., Barnes, J.W.: Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research Part B\u00a034, 107\u2013121 (2000)","journal-title":"Transportation Research Part B"},{"key":"142_CR12","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1287\/ijoc.8.2.165","volume":"8","author":"J.Y. Potvin","year":"1996","unstructured":"Potvin, J.Y., Bengio, S.: The vehicle routing problem with time windows - Part II: Genetic search. INFORMS Journal on Computing\u00a08, 165\u2013172 (1996)","journal-title":"INFORMS Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Computational Science - ICCS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24688-6_142","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T12:13:35Z","timestamp":1559650415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24688-6_142"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221166","9783540246886"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24688-6_142","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}