{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T07:13:18Z","timestamp":1771657998932,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441809","type":"print"},{"value":"9783540457497","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45749-6_56","type":"book-chapter","created":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T15:42:44Z","timestamp":1183563764000},"page":"637-648","source":"Crossref","is-referenced-by-count":18,"title":["Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows"],"prefix":"10.1007","author":[{"given":"Sven O.","family":"Krumke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg","family":"Rambau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis M.","family":"Torres","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,8,29]]},"reference":[{"issue":"2","key":"56_CR1","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1287\/opre.45.2.295","volume":"45","author":"J. Bramel","year":"1997","unstructured":"Julien Bramel and David Simchi-Levi, On the effectiveness of set covering formulations for the vehicle routing problem with time windows, Operations Research 45 (1997), no. 2, 295\u2013301.","journal-title":"Operations Research"},{"key":"56_CR2","volume-title":"Linear programming","author":"V. Chvatal","year":"1983","unstructured":"Vasek Chvatal, Linear programming, Freeman, New York, 1983."},{"key":"56_CR3","first-page":"35","volume-title":"Handbooks in Operations Research and Management Science","author":"J. Desrosiers","year":"1995","unstructured":"Jaques Desrosiers, Yvan Dumas, Marius M. Solomon, and Fran\u00e7ois Soumis, Time constraint routing and scheduling, Network Routing (Michael Ball, Tom Magnanti, Clyde Monma, and George Newhauser, eds.), Handbooks in Operations Research and Management Science, vol. 8, Elsevier, Amsterdam, 1995, pp. 35\u2013140."},{"issue":"4","key":"56_CR4","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1287\/trsc.34.4.426.12325","volume":"34","author":"S. Ichoua","year":"2000","unstructured":"Soumia Ichoua, Michel Gendreau, and Jean-Yves Potvin, Diversion issues in realtime vehicle dispatching, Transportation Science 34 (2000), no. 4, 426\u2013438.","journal-title":"Transportation Science"},{"key":"56_CR5","unstructured":"Jesper Larsen, Vehicle routing with time windows-finding optimal solutions efficiently, DORSnyt (engl.) (1999), no. 116."},{"key":"56_CR6","volume-title":"Optimization theory for large systems","author":"L. S. Lasdon","year":"1970","unstructured":"Leon S. Lasdon, Optimization theory for large systems, Macmillan, New York, 1970."},{"key":"56_CR7","doi-asserted-by":"crossref","unstructured":"Sushil J. Louis, Xiangying Yin, and Zhen Ya Yuan, Multiple vehicle routing with time windows using genetic algorithms, 1999 Congress on Evolutionary Computation (Piscataway, NJ), IEEE Service Center, 1999, pp. 1804\u20131808.","DOI":"10.1109\/CEC.1999.785493"},{"key":"56_CR8","unstructured":"D.G. Luenberger, Linear and nonlinear programming, 2 ed., Addison-Wesley, 1984."},{"key":"56_CR9","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"\u00c9. Taillard","year":"1997","unstructured":"\u00c9ric Taillard, P. Badeau, Michel Gendreau, F. Guertin, and Jean-Yves Potvin, A tabu search heuristic for the vehicle routing problem with soft time windows, Transportation Science 31 (1997), 170\u2013186.","journal-title":"Transportation Science"},{"key":"56_CR10","unstructured":"Kenny Qili Zhu and Kar-Loon Ong, A reactive method for real time dynamic vehicle routing problem, Proceedings of the 12th ICTAI, 2000."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45749-6_56","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T04:47:29Z","timestamp":1737175649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45749-6_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441809","9783540457497"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-45749-6_56","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}