{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T16:12:39Z","timestamp":1761581559914},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319597751"},{"type":"electronic","value":"9783319597768"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59776-8_21","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T09:26:33Z","timestamp":1496136393000},"page":"254-262","source":"Crossref","is-referenced-by-count":11,"title":["Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks"],"prefix":"10.1007","author":[{"given":"Natashia","family":"Boland","sequence":"first","affiliation":[]},{"given":"Mike","family":"Hewitt","sequence":"additional","affiliation":[]},{"given":"Duc Minh","family":"Vu","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Savelsbergh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"issue":"2","key":"21_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":"Ascheuer, N., Fischetti, M., Gr\u00f6tschel, M.: A polyhedral study of the asymmetric traveling salesman problem with time windows. Networks 36(2), 69\u201379 (2000)","journal-title":"Networks"},{"issue":"3","key":"21_CR2","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1287\/ijoc.1110.0456","volume":"24","author":"R Baldacci","year":"2012","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R.: New state-space relaxations for solving the traveling salesman problem with time windows. INFORMS J. Comput. 24(3), 356\u2013371 (2012)","journal-title":"INFORMS J. Comput."},{"key":"21_CR3","unstructured":"Boland, N., Hewitt, M., Marshall, L., Savelsbergh, M.: The continuous time service network design problem. Optimization Online 2015\u201301-4729 (2015)"},{"issue":"1","key":"21_CR4","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1287\/ijoc.1100.0432","volume":"24","author":"S Dash","year":"2012","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Lodi, A., Tramontani, A.: A time bucket formulation for the traveling salesman problem with time windows. INFORMS J. Comput. 24(1), 132\u2013147 (2012)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"21_CR5","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.43.2.367","volume":"43","author":"Y Dumas","year":"1995","unstructured":"Dumas, Y., Desrosiers, J., G\u00e9linas, \u00c9., Solomon, M.M.: An optimal algorithm for the traveling salesman problem with time windows. Oper. Res. 43(2), 367\u2013371 (1995)","journal-title":"Oper. Res."},{"issue":"4","key":"21_CR6","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1287\/ijoc.14.4.403.2827","volume":"14","author":"F Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., Milano, M.: A hybrid exact algorithm for the TSPTW. INFORMS J. Comput. 14(4), 403\u2013417 (2002)","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"21_CR7","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1287\/trsc.32.1.12","volume":"32","author":"G Pesant","year":"1998","unstructured":"Pesant, G., Gendreau, M., Potvin, J., Rousseau, J.: An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transp. Sci. 32(1), 12\u201329 (1998)","journal-title":"Transp. Sci."},{"issue":"1","key":"21_CR8","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"MWP Savelsbergh","year":"1985","unstructured":"Savelsbergh, M.W.P.: Local search in routing problems with time windows. Ann. Oper. Res. 4(1), 285\u2013305 (1985)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"21_CR9","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","volume":"4","author":"MWP Savelsbergh","year":"1992","unstructured":"Savelsbergh, M.W.P.: The vehicle routing problem with time windows: minimizing route duration. INFORMS J. Comput. 4(2), 146\u2013154 (1992)","journal-title":"INFORMS J. Comput."},{"issue":"4","key":"21_CR10","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/j.disopt.2010.04.002","volume":"7","author":"RF Silva da","year":"2010","unstructured":"da Silva, R.F., Urrutia, S.: A general VNS heuristic for the traveling salesman problem with time windows. Discrete Optim. 7(4), 203\u2013211 (2010)","journal-title":"Discrete Optim."},{"key":"21_CR11","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/S0965-8564(00)00037-9","volume":"36","author":"X Wang","year":"2002","unstructured":"Wang, X., Regan, A.: Local truckload pickup and delivery with hard time window constraints. Transp. Res. Part B 36, 97\u2013112 (2002)","journal-title":"Transp. Res. Part B"},{"key":"21_CR12","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/j.cie.2008.04.011","volume":"56","author":"X Wang","year":"2009","unstructured":"Wang, X., Regan, A.: On the convergence of a new time window discretization method for the traveling salesman problem with time window constraints. Comput. Ind. Eng. 56, 161\u2013164 (2009)","journal-title":"Comput. Ind. Eng."}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59776-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T09:36:11Z","timestamp":1496136971000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59776-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319597751","9783319597768"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59776-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}