{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T22:20:09Z","timestamp":1761949209400,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":49,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540687825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68783-2_12","type":"book-chapter","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T13:14:17Z","timestamp":1181308457000},"page":"397-435","source":"Crossref","is-referenced-by-count":31,"title":["Industrial Vehicle Routing"],"prefix":"10.1007","author":[{"given":"Geir","family":"Hasle","sequence":"first","affiliation":[]},{"given":"Oddvar","family":"Kloster","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"E. H. L. Aarts and J. K. Lenstra (eds). Local Search in Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization, ISBN 0-471-94822-5, 1997."},{"issue":"23","key":"12_CR2","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"1","author":"R. Ahuja","year":"2002","unstructured":"R. Ahuja, O. Ergun, J. Orlin, and A. Punnen. A Survey of very large-scale neighborhood search techniques. Discrete Appl. Math., 1(23):75\u2013102, 2002.","journal-title":"Discrete Appl. Math."},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1016\/S0377-2217(97)00290-7","volume":"106","author":"P. Augerat","year":"1998","unstructured":"P. Augerat, J. M. Belenguer, E. Benavent, A. Corb\u00e9ran, D. Naddef. Separating capacity constraints in the CVRP using tabu search. European J. Oper. Res., 106:546\u2013557, 1998.","journal-title":"European J. Oper. Res."},{"issue":"3","key":"12_CR4","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C. Barnhart","year":"1998","unstructured":"C. Barnhart, E. Johnson, G. Nemhauser, M. Savelsbergh, and P. Vance. Branchand-price: Column generation for solving huge integer programs. Oper. Res., 46(3):316\u2013329, 1998.","journal-title":"Oper. Res."},{"issue":"3","key":"12_CR5","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1145\/321832.321847","volume":"21","author":"M. Bellmore","year":"1974","unstructured":"M. Bellmore and S. Hong. Transformation of the multisalesmen problem to the standard traveling salesman problem. J. ACM, 21(3), 500\u2013504, 1974.","journal-title":"J. ACM"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"R. Bent and P. Van Hentenryck. A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows. In Proceedings of the International Conference on Constraint Programming (CP-2003) Kinsale, Ireland, September 2003. Springer Verlag, 2003.","DOI":"10.1007\/978-3-540-45193-8_9"},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O. Br\u00e4ysy","year":"2005","unstructured":"O. Br\u00e4ysy and M. Gendreau. Vehicle routing problem with time windows, part I: Route construction and local search algorithms. Transport. Sci., 39(1):104\u2013118, 2005.","journal-title":"Transport. Sci."},{"issue":"1","key":"12_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O. Br\u00e4ysy","year":"2005","unstructured":"O. Br\u00e4ysy and M. Gendreau. Vehicle routing problem with time windows, part II: Metaheuristics. Transport. Sci., 39(1):119\u2013139, 2005.","journal-title":"Transport. Sci."},{"key":"12_CR9","unstructured":"O. Br\u00e4ysy, M. Gendreau, G. Hasle, and A. L\u00f8kketangen. A Survey of Heuristics for the Vehicle Routing Problem, Part I: Basic Problems and Supply Side Extensions. SINTEF Report, Oslo, Norway, 2005."},{"key":"12_CR10","unstructured":"O. Br\u00e4ysy, M. Gendreau, G. Hasle, and A. L\u00f8kketangen. A Survey of Heuristics for the Vehicle Routing Problem, Part II: Demand Side Extensions. SINTEF Report, Oslo, Norway, 2005."},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1287\/trsc.1030.0046","volume":"38","author":"A. M. Campbell","year":"2004","unstructured":"A. M. Campbell and M. Savelsbergh. Efficient insertion heuristics for vehicle routing and scheduling problems. Transport. Sci., 38(3):369\u2013378, 2004.","journal-title":"Transport. Sci."},{"issue":"1","key":"12_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/trsc.1030.0036","volume":"38","author":"M. Christiansen","year":"2004","unstructured":"M. Christiansen, K. Fagerholt, and D. Ronen. Ship routing and scheduling: Status and perspectives. Transport. Sci., 38(1):1\u201318, 2004.","journal-title":"Transport. Sci."},{"issue":"3","key":"12_CR13","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N. Christofides","year":"1969","unstructured":"N. Christofides and S. Eilon. An algorithm for the vehicle dispatching problem. Oper. Res. Q., 20(3):309\u2013318, 1969.","journal-title":"Oper. Res. Q."},{"volume-title":"Combinatorial optimization","year":"1979","key":"12_CR14","unstructured":"N. Christofides, A. Mingozzi, P. Toth, and C. Sandi (eds). Chapter 11 in Combinatorial optimization. John Wiley, Chichester, 1979."},{"issue":"4","key":"12_CR15","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"G. Clarke and J. Wright. Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res., 12(4):568\u2013581, 1964.","journal-title":"Oper. Res."},{"key":"12_CR16","unstructured":"J. F. Cordeau, G. Desaulniers, J. Desrosiers, M. M. Solomon, and F. Soumis. VRP with Time Windows. Chapter 7 in [47]."},{"key":"12_CR17","series-title":"Technical Report","volume-title":"New heuristics for the vehicle routing problem","author":"J.-F. Cordeau","year":"2004","unstructured":"J.-F. Cordeau, M. Gendreau, A. Hertz, G. Laporte, and J.-S. Sormany. New heuristics for the vehicle routing problem. Technical Report G-2004-33, GERAD, Montreal, Canada 2004."},{"key":"12_CR18","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G. B. Dantzig","year":"1959","unstructured":"G. B. Dantzig and J. H. Ramser. The truck dispatching problem. Manag. Sci., 6:80, 1959.","journal-title":"Manag. Sci."},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"G. Desaulniers, J. Desrosiers, I. Ioachim, M. Solomon, F. Soumis, and D. Villeneuve. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. In T. Crainic and G. Laporte (editors): Fleet Management and Logistics, Chapter 3, 57\u201393, Kluwer 1998.","DOI":"10.1007\/978-1-4615-5755-5_3"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"G. Desaulniers, J. Desrosiers, and M. Solomon (editors). Column Generation. Number 5 in GERAD 25th Anniversary Series. Springer 2005.","DOI":"10.1007\/b135457"},{"key":"12_CR21","unstructured":"T. Flatberg, G. Hasle, O. Kloster, E. J. Nilssen, and A. Riise. Dynamic and Stochastic Aspects in Vehicle Routing \u2014 A Literature Survey. SINTEF Report STF90A05413, ISBN 82-14-02843-4, Oslo, Norway, 2005."},{"key":"12_CR22","unstructured":"T. Flatberg, G. Hasle, O. Kloster, E. J. Nilssen, and A. Riise. Dynamic and Stochastic Vehicle Routing in Practice. Accepted as Chapter 3 in V. S. Zeimpekis, G. M. Giaglis, and C. D. Tarantillis (editors). Dynamic Fleet Management: Concepts, Systems, Algorithms and Case Studies. To be published by Springer Verlag."},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"M. Dror (editor). Arc Routing: Theory, Solutions and Applications. Kluwer, ISBN-0792378989, 2000.","DOI":"10.1007\/978-1-4615-4495-1"},{"issue":"11","key":"12_CR24","doi-asserted-by":"publisher","first-page":"1232","DOI":"10.1057\/palgrave.jors.2601422","volume":"53","author":"W. Dullaert","year":"2002","unstructured":"W. Dullaert, G. K. Janssens, K. S\u00f6rensen, and B. Vernimmen. New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows. J. Oper. Res. Soc. 1, 53(11):1232\u20131238, 2002.","journal-title":"J. Oper. Res. Soc. 1"},{"issue":"2","key":"12_CR25","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/trsc.24.2.145","volume":"24","author":"Y. Dumas","year":"1990","unstructured":"Y. Dumas, F. Soumis and J. Desrosiers. Optimizing the schedule for a fixed vehicle path with convex inconvenience costs. Transport. Sci. 24(2): 145\u2013152, 1990.","journal-title":"Transport. Sci."},{"key":"12_CR26","isbn-type":"print","volume-title":"European Transport Policy for 2010: time to decide","author":"European Commission.","year":"2001","unstructured":"European Commission. European Transport Policy for 2010: time to decide. White Paper. Office for official publications of the European Communities, Luxemburg, ISBN 92-894-0341-1, 2001.","ISBN":"https:\/\/id.crossref.org\/isbn\/9289403411"},{"key":"12_CR27","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. R. Garey","year":"1979","unstructured":"M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, USA, 1979."},{"issue":"3","key":"12_CR28","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/trsc.1050.0145","volume":"40","author":"M. Gendreau","year":"2006","unstructured":"M. Gendreau, M. Iori, G. Laporte, and S. Martello. A tabu search algorithm for a routing and container loading problem. Transport. Sci., 40(3):342\u2013350, August 2006.","journal-title":"Transport. Sci."},{"key":"12_CR29","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/0305-0483(76)90097-9","volume":"4","author":"B. E. Gillet","year":"1976","unstructured":"B. E. Gillet and J. G. Johnson. Multi-terminal vehicle-dispatch algorithm. Omega 4, 711\u2013718, 1976.","journal-title":"Omega"},{"key":"12_CR30","isbn-type":"print","volume-title":"Handbook of Metaheuristics","year":"2003","unstructured":"F. Glover and G. Kochenberger (eds). Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 57. Kluwer Academic Publishers, Norwell, MA, USA, ISBN 1-4020-7263-5, 2003.","ISBN":"https:\/\/id.crossref.org\/isbn\/1402072635"},{"key":"12_CR31","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/978-1-4615-5775-3_30","volume-title":"Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization","author":"P. Hansen","year":"1999","unstructured":"P. Hansen and N. Mladenovic. An Introduction to Variable Neighborhood Search. In S. Voss et al. (eds): Metaheuristics, Advances and Trends in Local Search Paradigms for Optimization. 433\u2013458, Kluwer, Dordrecht, 1999."},{"key":"12_CR32","first-page":"297","volume":"37","author":"J. Homberger","year":"1999","unstructured":"J. Homberger and H. Gehring. Two evolutionary meta-heuristics for the vehicle routing problem with time windows. INFOR, 37:297\u2013318, 1999.","journal-title":"INFOR"},{"key":"12_CR33","unstructured":"H. H. Hoos and T. St\u00fctzle. Stochastic Local Search \u2014 Foundations and Applications. Elsevier, 2005."},{"issue":"8","key":"12_CR34","doi-asserted-by":"publisher","first-page":"2405","DOI":"10.1016\/j.cor.2005.02.020","volume":"33","author":"S. Irnich","year":"2006","unstructured":"S. Irnich, B. Funke, and T. Gr\u00fcnert. Sequential search and its application to vehicle-routing problems. Comput. Oper. Res., 33(8):2405\u20132429, 2006.","journal-title":"Comput. Oper. Res."},{"key":"12_CR35","unstructured":"H. Li and A. Lim. A Metaheuristic for the Pickup and Delivery Problem with Time Windows. Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (ICTAI\u201901), ISBN 0-7695-1417-0, 2001."},{"key":"12_CR36","unstructured":"H. R. Louren\u00e7o, O. C. Martin, and T. St\u00fctzle. Iterated Local Search. Chapter 11 in [30]."},{"key":"12_CR37","doi-asserted-by":"crossref","unstructured":"G. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. Wiley, 1988.","DOI":"10.1002\/9781118627372"},{"key":"12_CR38","unstructured":"J. Oppen and A. L\u00f8kketangen. The Livestock Collection Problem. Working paper 2006:3. Molde University College."},{"key":"12_CR39","doi-asserted-by":"crossref","unstructured":"D. Pisinger and S. Ropke. A general heuristic for vehicle routing problems. Comput. Oper. Res., 2005. doi:10.1016\/j.cor.2005.09.012.","DOI":"10.1016\/j.cor.2005.09.012"},{"key":"12_CR40","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"J.Y. Potvin","year":"1993","unstructured":"J.Y. Potvin and J. M. Rousseau. A parallel route building algorithm for the vehicle routing and scheduling problem with time windows. European J. Oper. Res., 66, 331\u2013340, 1993.","journal-title":"European J. Oper. Res."},{"key":"12_CR41","doi-asserted-by":"crossref","first-page":"628","DOI":"10.1287\/opre.28.3.628","volume":"28","author":"M. Rao","year":"1980","unstructured":"M. Rao. A note on multiple travelling salesman problem. Oper. Res., 28:628\u2013632, 1980.","journal-title":"Oper. Res."},{"key":"12_CR42","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G. Schrimpf","year":"2000","unstructured":"G. Schrimpf, J. Schneider, H. Stamm-Wilbrandt, and G. Dueck. Record breaking optimization results using the ruin and recreate principle. J. Comput. Phys., 159:254\u2013265, 2000.","journal-title":"J. Comput. Phys."},{"key":"12_CR43","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M. M. Solomon","year":"1987","unstructured":"M. M. Solomon. Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res., 35:254\u2013265, 1987.","journal-title":"Oper. Res."},{"key":"12_CR44","unstructured":"M. St\u00f8levik, G. Hasle, and O. Kloster. Solving the Long-Term Forest Treatment Scheduling Problem. In this book."},{"key":"12_CR45","unstructured":"Statistisk Sentralbyr\u00e5. Lastebilunders\u00f8kelsen 2002 (in Norwegian)."},{"key":"12_CR46","unstructured":"TOP web pages. http:\/\/www.top.sintef.no"},{"volume-title":"The Vehicle Routing Problem","year":"2002","key":"12_CR47","unstructured":"P. Toth and D. Vigo (eds). The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 2002."},{"issue":"4","key":"12_CR48","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","volume":"15","author":"P. Toth","year":"2003","unstructured":"P. Toth and D. Vigo. The granular tabu search and its application to the vehicle-routing problem. INFORMS Journal on Computing, 15(4):333\u2013346, 2003.","journal-title":"INFORMS Journal on Computing"},{"key":"12_CR49","unstructured":"L. A. Wolsey. Integer Programming. Wiley, 1998."}],"container-title":["Geometric Modelling, Numerical Simulation, and Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68783-2_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T04:13:22Z","timestamp":1620015202000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68783-2_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540687825"],"references-count":49,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68783-2_12","relation":{},"subject":[]}}