{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:24:36Z","timestamp":1762521876641,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662493809"},{"type":"electronic","value":"9783662493816"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49381-6_37","type":"book-chapter","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T18:24:06Z","timestamp":1457375046000},"page":"388-398","source":"Crossref","is-referenced-by-count":11,"title":["Enhanced Guided Ejection Search for the Pickup and Delivery Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Nalepa","sequence":"first","affiliation":[]},{"given":"Miroslaw","family":"Blocho","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"37_CR1","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1142\/S0218213002000988","volume":"11","author":"HC Lau","year":"2002","unstructured":"Lau, H.C., Liang, Z.: Pickup and delivery with time windows: algorithms and test case generation. Int. J. Artif. Intell. Tools 11(3), 455\u2013472 (2002)","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Kalina, P., Vokrinek, J.: Parallel solver for vehicle routing and pickup and delivery problems with time windows based on agent negotiation. In: Proceeding of the IEEE SMC, pp. 1558\u20131563 (2012)","DOI":"10.1109\/ICSMC.2012.6377958"},{"issue":"1","key":"37_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2011.07.037","volume":"218","author":"R Baldacci","year":"2012","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R.: Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Op. Res. 218(1), 1\u20136 (2012)","journal-title":"Eur. J. Op. Res."},{"issue":"6","key":"37_CR4","doi-asserted-by":"publisher","first-page":"2309","DOI":"10.1007\/s00500-015-1642-4","volume":"20","author":"Jakub Nalepa","year":"2015","unstructured":"Nalepa, J., Blocho, M.: Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Comput., 1\u201319 (2015). doi:10.1007\/s00500-015-1642-4","journal-title":"Soft Computing"},{"issue":"4","key":"37_CR5","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1002\/net.20177","volume":"49","author":"S Ropke","year":"2007","unstructured":"Ropke, S., Cordeau, J.F., Laporte, G.: Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49(4), 258\u2013272 (2007)","journal-title":"Networks"},{"issue":"2","key":"37_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s12532-014-0064-0","volume":"6","author":"A Bettinelli","year":"2014","unstructured":"Bettinelli, A., Ceselli, A., Righini, G.: A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows. Math. Program. Comput. 6(2), 171\u2013197 (2014)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"37_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s11301-008-0033-7","volume":"58","author":"SN Parragh","year":"2008","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems. J. Betriebswirtschaft 58(1), 21\u201351 (2008)","journal-title":"J. Betriebswirtschaft"},{"key":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-45193-8_9","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"R Bent","year":"2003","unstructured":"Bent, R., Van Hentenryck, P.: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 123\u2013137. Springer, Heidelberg (2003)"},{"issue":"4","key":"37_CR9","doi-asserted-by":"publisher","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. Sc. 40(4), 455\u2013472 (2006)","journal-title":"Transp. Sc."},{"issue":"2","key":"37_CR10","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0191-2615(99)00016-8","volume":"34","author":"WP Nanry","year":"2000","unstructured":"Nanry, W.P., Barnes, J.W.: Solving the pickup and delivery problem with time windows using reactive tabu search. Transp. Res. 34(2), 107\u2013121 (2000)","journal-title":"Transp. Res."},{"key":"37_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-12139-5_18","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"Y Nagata","year":"2010","unstructured":"Nagata, Y., Kobayashi, S.: Guided ejection search for the pickup and delivery problem with time windows. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol. 6022, pp. 202\u2013213. Springer, Heidelberg (2010)"},{"key":"37_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.cor.2015.04.002","volume":"62","author":"M Cherkesly","year":"2015","unstructured":"Cherkesly, M., Desaulniers, G., Laporte, G.: A population-based metaheuristic for the pickup and delivery problem with time windows and LIFO loading. Comput. Oper. Res. 62, 23\u201335 (2015)","journal-title":"Comput. Oper. Res."},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-642-01009-5_15","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"Y Nagata","year":"2009","unstructured":"Nagata, Y., Tojo, S.: Guided ejection search for the job shop scheduling problem. In: Cotta, C., Cowling, P. (eds.) EvoCOP 2009. LNCS, vol. 5482, pp. 168\u2013179. Springer, Heidelberg (2009)"},{"issue":"5","key":"37_CR14","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.orl.2009.04.006","volume":"37","author":"Y Nagata","year":"2009","unstructured":"Nagata, Y., Br\u00e4ysy, O.: A powerful route minimization heuristic for the vehicle routing problem with time windows. Op. Res. Lett. 37(5), 333\u2013338 (2009)","journal-title":"Op. Res. Lett."},{"key":"37_CR15","doi-asserted-by":"crossref","unstructured":"Blocho, M., Czech, Z.: A parallel memetic algorithm for the vehicle routing problem with time windows. In: Proceeding of the 3PGCIC, pp. 144\u2013151 (2013)","DOI":"10.1109\/3PGCIC.2013.28"}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49381-6_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T12:46:32Z","timestamp":1720788392000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-49381-6_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662493809","9783662493816"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49381-6_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}