{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:43:43Z","timestamp":1725799423360},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662443194"},{"type":"electronic","value":"9783662443200"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44320-0_15","type":"book-chapter","created":{"date-parts":[[2014,8,20]],"date-time":"2014-08-20T21:06:01Z","timestamp":1408568761000},"page":"170-181","source":"Crossref","is-referenced-by-count":0,"title":["Metaheuristics for the Pick-Up and Delivery Problem with Contracted Orders"],"prefix":"10.1007","author":[{"given":"Philip","family":"Mourdjis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Cowling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Robinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/S0927-0507(05)80106-9","volume":"8","author":"J. Desrosiers","year":"1995","unstructured":"Desrosiers, J., Dumas, Y., Solomon, M.M., Soumis, F.: Time Constrained Routing and Scheduling. Handbooks in Operations Research and Management Science\u00a08, 35\u2013139 (1995)","journal-title":"Handbooks in Operations Research and Management Science"},{"issue":"1","key":"15_CR2","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O. Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms. Transportation Science\u00a039(1), 104\u2013118 (2005)","journal-title":"Transportation Science"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O. Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Vehicle Routing Problem with Time Windows, Part II: Metaheuristics. Transportation Science\u00a039(1), 119\u2013139 (2005)","journal-title":"Transportation Science"},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","volume":"15","author":"G. Berbeglia","year":"2007","unstructured":"Berbeglia, G., Cordeau, J.F., Gribkovskaia, I., Laporte, G.: Static pickup and delivery problems: a classification scheme and survey. TOP\u00a015(1), 1\u201331 (2007)","journal-title":"TOP"},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"58","author":"S.N. Parragh","year":"2008","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: A survey on pickup and delivery problems. Journal f\u00fcr Betriebswirtschaft\u00a058(2), 81\u2013117 (2008)","journal-title":"Journal f\u00fcr Betriebswirtschaft"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","volume":"54","author":"Y. Dumas","year":"1991","unstructured":"Dumas, Y., Desrosiers, J., Soumis, F.: The pickup and delivery problem with time windows. European Journal of Operational Research\u00a054, 7\u201322 (1991)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S. Ropke","year":"2005","unstructured":"Ropke, S., Pisinger, D.: An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows. Transportation Science\u00a040(4), 455\u2013472 (2005)","journal-title":"Transportation Science"},{"key":"15_CR8","unstructured":"Malca, F., Semet, F.: A tabu search heuristic for the pickup and delivery problem with time windows and a fixed size fleet, 1\u20135 (2003) (unpublished manuscript)"},{"issue":"3","key":"15_CR9","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.trc.2006.03.002","volume":"14","author":"M. Gendreau","year":"2006","unstructured":"Gendreau, M., Guertin, F., Potvin, J.Y., S\u00e9guin, R.: Neighborhood Search Heuristics for a Dynamic Vehicle Dispatching Problem with Pick-ups and Deliveries. Transportation Research Part C: Emerging Technologies\u00a014(3), 157\u2013174 (2006)","journal-title":"Transportation Research Part C: Emerging Technologies"},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E.D. Taillard","year":"1997","unstructured":"Taillard, E.D., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows. Transportation Science\u00a031(2), 170\u2013186 (1997)","journal-title":"Transportation Science"},{"issue":"8","key":"15_CR11","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"J.F. Cordeau","year":"2001","unstructured":"Cordeau, J.F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society\u00a052(8), 928\u2013936 (2001)","journal-title":"Journal of the Operational Research Society"},{"issue":"5","key":"15_CR12","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1057\/palgrave.jors.2601707","volume":"55","author":"J.F. Cordeau","year":"2004","unstructured":"Cordeau, J.F., Laporte, G., Mercier, A.: Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. Journal of the Operational Research Society\u00a055(5), 542\u2013546 (2004)","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable Neighbourhood Search. Computers & Operations Research\u00a024(1), 1097\u20131100 (1997)","journal-title":"Computers & Operations Research"},{"issue":"1","key":"15_CR14","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P. Hansen","year":"2009","unstructured":"Hansen, P., Mladenovi\u0107, N., Moreno P\u00e9rez, J.A.: Variable Neighbourhood Search: Methods and Applications. Annals of Operations Research\u00a0175(1), 367\u2013407 (2009)","journal-title":"Annals of Operations Research"},{"issue":"4","key":"15_CR15","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1287\/ijoc.15.4.347.24896","volume":"15","author":"O. Br\u00e4ysy","year":"2003","unstructured":"Br\u00e4ysy, O.: A Reactive Variable Neighborhood Search for the Vehicle-Routing Problem with Time Windows. INFORMS Journal On Computing\u00a015(4), 347\u2013368 (2003)","journal-title":"INFORMS Journal On Computing"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/s10732-005-5432-5","volume":"10","author":"M. Polacek","year":"2004","unstructured":"Polacek, M., Hartl, R.F., Doerner, K.F.: A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows. Journal of Heuristics\u00a010, 613\u2013627 (2004)","journal-title":"Journal of Heuristics"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Belhaiza, S., Hansen, P., Laporte, G.: A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. Computers & Operations Research (August 2013)","DOI":"10.1016\/j.cor.2013.08.010"},{"issue":"6","key":"15_CR18","doi-asserted-by":"publisher","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M. Gendreau","year":"1992","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: New Insertion and Post Optimization Procedures for the Traveling Salesman Problem. Operations Research\u00a040(6), 1086\u20131095 (1992)","journal-title":"Operations Research"},{"issue":"5","key":"15_CR19","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1002\/mde.4090110512","volume":"11","author":"F. Glover","year":"1990","unstructured":"Glover, F.: Artificial Intelligence, Heuristic Frameworks and Tabu Search. Managerial and Decision Economics\u00a011(5), 365\u2013375 (1990)","journal-title":"Managerial and Decision Economics"},{"issue":"1","key":"15_CR20","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02430363","volume":"1","author":"R.S. Barr","year":"1995","unstructured":"Barr, R.S., Golden, B.L., Kelly, J.P., Resende, M.G.C., Stewart, W.R.: Designing and Reporting on Computational Experiments with Heuristic Methods. Journal of Heuristics\u00a01(1), 9\u201332 (1995)","journal-title":"Journal of Heuristics"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimisation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44320-0_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T12:49:56Z","timestamp":1558961396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44320-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662443194","9783662443200"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44320-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}