{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:01:47Z","timestamp":1761292907035,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642291234"},{"type":"electronic","value":"9783642291241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29124-1_6","type":"book-chapter","created":{"date-parts":[[2012,3,23]],"date-time":"2012-03-23T17:24:42Z","timestamp":1332523482000},"page":"63-74","source":"Crossref","is-referenced-by-count":7,"title":["Combining Heuristic and Exact Methods to Solve the Vehicle Routing Problem with Pickups, Deliveries and Time Windows"],"prefix":"10.1007","author":[{"given":"Penny L.","family":"Holborn","sequence":"first","affiliation":[]},{"given":"Jonathan M.","family":"Thompson","sequence":"additional","affiliation":[]},{"given":"Rhyd","family":"Lewis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/BF02098290","volume":"61","author":"G. Laporte","year":"1995","unstructured":"Laporte, G., Osman, I.: Routing problems: A bibliography. Annals of Operations Research\u00a061, 227\u2013262 (1995)","journal-title":"Annals of Operations Research"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/trsc.29.1.17","volume":"29","author":"M.W.P. Savelsbergh","year":"1995","unstructured":"Savelsbergh, M.W.P., Sol, M.: The general pickup and delivery problem. Transportation Science\u00a029(1), 17\u201329 (1995)","journal-title":"Transportation Science"},{"issue":"3","key":"6_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1287\/trsc.17.3.351","volume":"17","author":"H. Psaraftis","year":"1983","unstructured":"Psaraftis, H.: An exact algorithm for the single vehicle many-to-many dial-a-ride problem with time windows. Transportation Science\u00a017(3), 351\u2013357 (1983)","journal-title":"Transportation Science"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0191-2615(86)90020-2","volume":"20","author":"J. Jaw","year":"1986","unstructured":"Jaw, J., Odoni, A., Psaraftis, H., Wilson, N.: A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Research Part B: Methodological\u00a020, 243\u2013257 (1986)","journal-title":"Transportation Research Part B: Methodological"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"J.F. Cordeau","year":"2007","unstructured":"Cordeau, J.F., Laporte, G.: The dial-a-ride problem: models and algorithms. Annals of Operations Research\u00a0153(1), 29\u201346 (2007)","journal-title":"Annals of Operations Research"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/S0191-2615(99)00016-8","volume":"34","author":"W. Nanry","year":"2000","unstructured":"Nanry, W., Barnes, J.: Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research Part B: Methodological\u00a034(2), 107\u2013121 (2000)","journal-title":"Transportation Research Part B: Methodological"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Lau, H., Liang, Z.: Pickup and delivery with time windows: algorithms and test case generation. In: The 13th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2001, Dallas, USA, pp. 333\u2013340 (2001)","DOI":"10.1109\/ICTAI.2001.974481"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. In: The 13th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2001, Dallas, USA, pp. 160\u2013167 (2001)","DOI":"10.1109\/ICTAI.2001.974461"},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M.M. Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research\u00a035(2), 254\u2013265 (1987)","journal-title":"Operations Research"},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1016\/j.cor.2004.08.001","volume":"33","author":"R. Bent","year":"2006","unstructured":"Bent, R., Van Hentenryck, P.: A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. Computers & Operations Research\u00a033(4), 875\u2013893 (2006)","journal-title":"Computers & Operations Research"},{"issue":"4","key":"6_CR11","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"R. Ropke","year":"2006","unstructured":"Ropke, R., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science\u00a040(4), 455\u2013472 (2006)","journal-title":"Transportation Science"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00291-004-0173-7","volume":"27","author":"G. Pankratz","year":"2005","unstructured":"Pankratz, G.: A grouping genetic algorithm for the pickup and delivery problem with time windows. OR Spectrum\u00a027, 21\u201341 (2005)","journal-title":"OR Spectrum"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/1543834.1543849","volume-title":"GEC 2009: Proceedings of the first ACM\/SIGEVO Summit on Genetic and Evolutionary Computation","author":"G. Ding","year":"2009","unstructured":"Ding, G., Li, L., Ju, Y.: Multi-strategy grouping genetic algorithm for the pickup and delivery problem with time windows. In: GEC 2009: Proceedings of the first ACM\/SIGEVO Summit on Genetic and Evolutionary Computation, pp. 97\u2013104. ACM, New York (2009)"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00291-006-0072-1","volume":"30","author":"U. Dergis","year":"2008","unstructured":"Dergis, U., Dohmer, T.: Indirect search for the vehicle routing problem with pickup and delivery and time windows. OR Spectrum\u00a030, 149\u2013165 (2008)","journal-title":"OR Spectrum"},{"key":"6_CR15","unstructured":"Lim, H., Lim, A., Rodrigues, B.: Solving the pickup and delivery problem with time windows using \u201csqueaky wheel\u201d optimization with local search. In: Proceedings of AMCIS 2002, pp. 2335\u20132344 (2002)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Carabetti, E., de Souza, S., Fraga, M.: An application of the ant colony system metaheuristic to the vehicle routing problem with pickup and delivery and time windows. In: Eleventh Brazilian Symposium on Neural Networks 2010, pp. 176\u2013181 (2010)","DOI":"10.1109\/SBRN.2010.38"},{"key":"6_CR17","unstructured":"Or, I.: Traveling salesman-type combinatorial problems and their relation the logistics of regional blood banking. PhD thesis, Northwestern University, Evanston, IL (1976)"},{"issue":"3","key":"6_CR18","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu search part 1. ORSA Journal on Computing\u00a01(3), 190\u2013206 (1989)","journal-title":"ORSA Journal on Computing"},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.cor.2004.07.009","volume":"33","author":"F.A.T. Montan\u00e9","year":"2006","unstructured":"Montan\u00e9, F.A.T., Galv\u00e3o, R.D.: A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Computers and Operations Research\u00a033(3), 595\u2013619 (2006)","journal-title":"Computers and Operations Research"},{"issue":"1","key":"6_CR20","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.ejor.2009.04.024","volume":"202","author":"G. Berbeglia","year":"2010","unstructured":"Berbeglia, G., Cordeau, J.F., Laporte, G.: Dynamic pickup and delivery problems. European Journal of Operational Research\u00a0202(1), 8\u201315 (2010)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29124-1_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,23]],"date-time":"2025-03-23T21:43:39Z","timestamp":1742766219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29124-1_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642291234","9783642291241"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29124-1_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}