{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:21:43Z","timestamp":1725794503229},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319074665"},{"type":"electronic","value":"9783319074672"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07467-2_49","type":"book-chapter","created":{"date-parts":[[2014,5,20]],"date-time":"2014-05-20T05:11:19Z","timestamp":1400562679000},"page":"466-475","source":"Crossref","is-referenced-by-count":0,"title":["The Multi-period Profit Collection Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Yubin","family":"Xie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zizhen","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Qin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songshan","family":"Guo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Lim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"49_CR1","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1016\/S0377-2217(02)00363-6","volume":"148","author":"H.C. Lau","year":"2003","unstructured":"Lau, H.C., Sim, M., Teo, K.M.: Vehicle routing problem with time windows and a limited number of vehicles. European Journal of Operational Research\u00a0148(3), 559\u2013569 (2003)","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"49_CR2","doi-asserted-by":"publisher","first-page":"3281","DOI":"10.1016\/j.cor.2009.03.008","volume":"36","author":"P. Vansteenwegen","year":"2009","unstructured":"Vansteenwegen, P., Souffriau, W., Vanden Berghe, G., Van Oudheusden, D.: Iterated local search for the team orienteering problem with time windows. Computers & Operations Research\u00a036(12), 3281\u20133290 (2009)","journal-title":"Computers & Operations Research"},{"issue":"1","key":"49_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2010.03.045","volume":"209","author":"P. Vansteenwegen","year":"2011","unstructured":"Vansteenwegen, P., Souffriau, W., Van Oudheusden, D.: The orienteering problem: A survey. European Journal of Operational Research\u00a0209(1), 1\u201310 (2011)","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"49_CR4","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1287\/opre.46.4.474","volume":"46","author":"M. Savelsbergh","year":"1998","unstructured":"Savelsbergh, M., Sol, M.: Drive: Dynamic routing of independent vehicles. Operations Research\u00a046(4), 474\u2013490 (1998)","journal-title":"Operations Research"},{"issue":"3","key":"49_CR5","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1287\/trsc.37.3.347.16044","volume":"37","author":"H. Xu","year":"2003","unstructured":"Xu, H., Chen, Z.L., Rajagopal, S., Arunapuram, S.: Solving a practical pickup and delivery problem. Transportation Science\u00a037(3), 347\u2013364 (2003)","journal-title":"Transportation Science"},{"issue":"1","key":"49_CR6","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1287\/trsc.1070.0226","volume":"43","author":"A. Goel","year":"2009","unstructured":"Goel, A.: Vehicle scheduling and routing with drivers\u2019 working hours. Transportation Science\u00a043(1), 17\u201326 (2009)","journal-title":"Transportation Science"},{"issue":"4","key":"49_CR7","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1287\/trsc.1100.0330","volume":"44","author":"A. Goel","year":"2010","unstructured":"Goel, A.: Truck driver scheduling in the European union. Transportation Science\u00a044(4), 429\u2013441 (2010)","journal-title":"Transportation Science"},{"issue":"4","key":"49_CR8","doi-asserted-by":"publisher","first-page":"442","DOI":"10.1287\/trsc.1100.0331","volume":"44","author":"A.L. Kok","year":"2010","unstructured":"Kok, A.L., Meyer, C.M., Kopfer, H., Schutten, J.M.J.: A dynamic programming heuristic for the vehicle routing problem with time windows and European community social legislation. Transportation Science\u00a044(4), 442\u2013454 (2010)","journal-title":"Transportation Science"},{"issue":"2","key":"49_CR9","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"J.F. Cordeau","year":"1997","unstructured":"Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks\u00a030(2), 105\u2013119 (1997)","journal-title":"Networks"},{"key":"49_CR10","volume-title":"Network flows : Theory, algorithms, and applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network flows: Theory, algorithms, and applications. Prentice Hall, Englewood Cliffs (1993)"},{"key":"49_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Norwell (1997)"},{"issue":"1","key":"49_CR12","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":"2","key":"49_CR13","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"}],"container-title":["Lecture Notes in Computer Science","Modern Advances in Applied Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07467-2_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T17:34:34Z","timestamp":1558892074000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07467-2_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319074665","9783319074672"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07467-2_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}