{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,11]],"date-time":"2025-04-11T15:51:13Z","timestamp":1744386673137,"version":"3.40.3"},"publisher-location":"London","reference-count":14,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781447145936"},{"type":"electronic","value":"9781447145943"}],"license":[{"start":{"date-parts":[[2012,10,30]],"date-time":"2012-10-30T00:00:00Z","timestamp":1351555200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,10,30]],"date-time":"2012-10-30T00:00:00Z","timestamp":1351555200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-1-4471-4594-3_49","type":"book-chapter","created":{"date-parts":[[2012,10,29]],"date-time":"2012-10-29T20:28:42Z","timestamp":1351542522000},"page":"477-483","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Comparison of Acceptance Criteria for the Daily Car-Pooling Problem"],"prefix":"10.1007","author":[{"given":"Jerry","family":"Swan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Drake","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Goulding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Woodward","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,30]]},"reference":[{"issue":"3","key":"49_CR1","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1287\/opre.1030.0106","volume":"52","author":"R. Baldacci","year":"2004","unstructured":"Baldacci, R., Maniezzo, V., Mingozzi, A.: An exact method for the car pooling problem based on Lagrangean column generation. Oper. Res. 52(3), 422\u2013439 (2004)","journal-title":"Oper. Res."},{"key":"49_CR2","unstructured":"Burke, E.K., Bykov, Y.: A late acceptance strategy in Hill-Climbing for exam timetabling problems. In: PATAT \u201908 (2008)"},{"issue":"13","key":"49_CR3","doi-asserted-by":"crossref","first-page":"2263","DOI":"10.1016\/S0305-0548(03)00186-2","volume":"31","author":"R.W. Calvo","year":"2004","unstructured":"Calvo, R.W., De Luigi, F., Haastrup, P., Maniezzo, V.: A distributed geographic information system for the daily car pooling problem. Comput. Oper. Res. 31(13), 2263\u20132278 (2004)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"49_CR4","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N. Christofides","year":"1969","unstructured":"Christofides, N., Eilon, S.: An algorithm for the vehicle dispatching problem. Oper. Res. Q. 20(3), 309\u2013318 (1969)","journal-title":"Oper. Res. Q."},{"key":"49_CR5","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial Optimization, pp. 315\u2013338. Wiley, Chichester (1979)"},{"key":"49_CR6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10288-002-0009-8","volume":"1","author":"J.F. Cordeau","year":"2003","unstructured":"Cordeau, J.F., Laporte, G.: The dial-a-ride problem (darp): variants, modeling issues and algorithms. 4OR 1, 89\u2013101 (2003)","journal-title":"4OR"},{"issue":"4","key":"49_CR7","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1287\/opre.42.4.626","volume":"42","author":"ML Fisher","year":"1994","unstructured":"Fisher, M.L.: Optimal solution of vehicle routing problems using minimum K-trees. Oper. Res. 42(4), 626\u2013642 (1994)","journal-title":"Oper. Res."},{"key":"49_CR8","unstructured":"Maniezzo, V., Carbonaro, A., Hildmann, H.: An ANTS heuristic for the Long-Term Car-Pooling Problem. In: Onwuboulu, G., Babu, B. (eds.) New Optimization Techniques in Engineering. Springer, Heidelberg (2002)"},{"issue":"3","key":"49_CR9","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0377-2217(84)90155-3","volume":"18","author":"J.M. Mulvey","year":"1984","unstructured":"Mulvey, J.M., Beck, M.P.: Solving capacitated clustering problems. Eur. J. Oper. Res. 18(3), 339\u2013348 (1984)","journal-title":"Eur. J. Oper. Res."},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"\u00d6zcan, E., Bilgin, B., Korkmaz, E.E.: A comprehensive analysis of hyper-heuristics. Intell. Data Anal. 12(1), 3\u201323 (2008)","DOI":"10.3233\/IDA-2008-12102"},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"\u00d6zcan, E., Bykov, Y., Birben, M., Burke, E.K.: Examination timetabling using late acceptance hyper-heuristics. In: Proceedings of the Eleventh Conference on Congress on Evolutionary Computation (CEC\u201909), pp. 997\u20131004. IEEE Press, Piscataway, NJ, USA (2009)","DOI":"10.1109\/CEC.2009.4983054"},{"key":"49_CR12","doi-asserted-by":"crossref","unstructured":"Swan, J., \u00d6zcan, E., Kendall, G.: Hyperion\u2014a recursive hyper-heuristic framework. In: Coello Coello, C.A. (ed.) 5th International Conference on Learning and Intelligent Optimization (LION 5), LNCS (2011)","DOI":"10.1007\/978-3-642-25566-3_48"},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: An overview of vehicle routing problems. In: The vehicle routing problem, Society for Industrial and Applied Mathematics, pp. 1\u201326. Philadelphia, PA, USA (2001)","DOI":"10.1137\/1.9780898718515.ch1"},{"key":"49_CR14","doi-asserted-by":"crossref","unstructured":"Verstichel, J., Berghe, G.V.: A late acceptance algorithm for the lock scheduling problem. In: Voss, S., Pahl, J., Schwarze, S. (eds.) Logistik Management, pp. 457\u2013478. Physica-Verlag HD, Heidelberg (2009)","DOI":"10.1007\/978-3-7908-2362-2_23"}],"container-title":["Computer and Information Sciences III"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-4594-3_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,12]],"date-time":"2023-02-12T03:08:50Z","timestamp":1676171330000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4471-4594-3_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,30]]},"ISBN":["9781447145936","9781447145943"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-4594-3_49","relation":{},"subject":[],"published":{"date-parts":[[2012,10,30]]},"assertion":[{"value":"30 October 2012","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}