{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T14:57:02Z","timestamp":1770217022396,"version":"3.49.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,6,1]],"date-time":"2006-06-01T00:00:00Z","timestamp":1149120000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["cent.eur.j.oper.res."],"published-print":{"date-parts":[[2006,6]]},"DOI":"10.1007\/s10100-006-0165-6","type":"journal-article","created":{"date-parts":[[2006,10,26]],"date-time":"2006-10-26T07:06:11Z","timestamp":1161846371000},"page":"141-156","source":"Crossref","is-referenced-by-count":44,"title":["An optimization approach for planning daily drayage operations"],"prefix":"10.1007","volume":"14","author":[{"given":"Yetkin","family":"Ileri","sequence":"first","affiliation":[]},{"given":"Mokhtar","family":"Bazaraa","sequence":"additional","affiliation":[]},{"given":"Ted","family":"Gifford","sequence":"additional","affiliation":[]},{"given":"George","family":"Nemhauser","sequence":"additional","affiliation":[]},{"given":"Joel","family":"Sokol","sequence":"additional","affiliation":[]},{"given":"Erick","family":"Wikum","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"165_CR1","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1002\/1097-0037(200009)36:2<69::AID-NET1>3.0.CO;2-Q","volume":"36","author":"N. Ascheuer","year":"2000","unstructured":"N. Ascheuer, M. Fischetti, and M. Gr\u00f6tschel. A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks, 36(2):69\u201379, 2000.","journal-title":"Networks"},{"issue":"3","key":"165_CR2","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. L. Johnson, G. L. Nemhauser, M. W. P. Savelsbergh, and P. H. Vance. Branch-and-price: column generation for solving huge integer programs. Operations Research, 46(3):316\u2013329, 1998.","journal-title":"Operations Research"},{"issue":"2","key":"165_CR3","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M. Desrochers","year":"1992","unstructured":"M. Desrochers, J. Desrosiers, and M. Solomon. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research, 40(2):342\u2013354, 1992.","journal-title":"Operations Research"},{"key":"165_CR4","volume-title":"Time Constrained Routing and Scheduling","author":"J. Desrosiers","year":"1995","unstructured":"J. Desrosiers, Y. Dumas, M. M. Solomon, and F. Soumis. Time Constrained Routing and Scheduling. In M. O. Ball et al. (ed.) Network Routing, Elsevier Science, 1995."},{"key":"165_CR5","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","volume":"54","author":"Y. Dumas","year":"1991","unstructured":"Y. Dumas, J. Desrosiers, and F. Soumis. The pickup and delivery problem with time windows. European Journal of Operational Research, 54:7\u201322, 1991.","journal-title":"European Journal of Operational Research"},{"key":"165_CR6","unstructured":"ILOG, Inc. ILOG CPLEX 9.0 User's Manual, 2003."},{"issue":"2","key":"165_CR7","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1016\/S0377-2217(03)00161-9","volume":"153","author":"C. Macharis","year":"2004","unstructured":"C. Macharis and Y. M. Bontekoning. Opportunities for OR in intermodal freight transport research: A review. European Journal of Operational Research, 153(2):400\u2013416, 2004.","journal-title":"European Journal of Operational Research"},{"key":"165_CR8","first-page":"16","volume":"34","author":"E. K. Morlok","year":"1994","unstructured":"E. K. Morlok and L. N. Spasovic. Redesigning rail-truck intermodal drayage operations for enhanced service and cost performance. Transportation Research Forum, 34:16\u201331, 1994.","journal-title":"Transportation Research Forum"},{"key":"165_CR9","unstructured":"G. L. Nemhauser and L. A. Wolsey. Integer and Combinatorial Optimization. John Wiley & Sons, Inc., 1999."},{"key":"165_CR10","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1287\/opre.46.4.474","volume":"46","author":"M. Savelsbergh","year":"1998","unstructured":"M. Savelsbergh and M. Sol. Drive: Dynamic routing of independent vehicles. Operations Research, 46:474\u2013490, 1998.","journal-title":"Operations Research"},{"key":"165_CR11","series-title":"Working Paper 03-001","volume-title":"Multi-resource routing with flexible tasks: an application in drayage operations","author":"K. Smilowitz","year":"2003","unstructured":"K. Smilowitz. Multi-resource routing with flexible tasks: an application in drayage operations. Working Paper 03-001, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois, USA, October 2003. Available at http:\/\/www.iems.northwestern.edu\/images\/PDF\/WP_03_001.pdf"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-006-0165-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-006-0165-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-006-0165-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:49:25Z","timestamp":1559108965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-006-0165-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["165"],"URL":"https:\/\/doi.org\/10.1007\/s10100-006-0165-6","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6]]}}}