{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T18:44:13Z","timestamp":1775328253994,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":11,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819706686","type":"print"},{"value":"9789819706693","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-981-97-0669-3_20","type":"book-chapter","created":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T21:20:16Z","timestamp":1709155216000},"page":"210-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Solving Time-Dependent Traveling Salesman Problem with\u00a0Time Windows Under Generic Time-Dependent Travel Cost"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5882-3868","authenticated-orcid":false,"given":"Duc Minh","family":"Vu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9786-677X","authenticated-orcid":false,"given":"Mike","family":"Hewitt","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2657-0445","authenticated-orcid":false,"given":"Duc Duy","family":"Vu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,29]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.dam.2018.09.017","volume":"261","author":"A Arigliano","year":"2018","unstructured":"Arigliano, A., Ghiani, G., Grieco, A., Guerriero, E., Plana, I.: Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm. Dis. Appl. Math. 261, 28\u201339 (2018)","journal-title":"Dis. Appl. Math."},{"issue":"5","key":"20_CR2","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1287\/opre.2017.1624","volume":"65","author":"N Boland","year":"2017","unstructured":"Boland, N., Hewitt, M., Marshall, L., Savelsbergh, M.: The continuous-time service network design problem. Ope. Res. 65(5), 1303\u20131321 (2017)","journal-title":"Ope. Res."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Boland, N.L., Savelsbergh, M.W.: Perspectives on integer programming for time-dependent models. TOP 27, 147\u2013173 (2019)","DOI":"10.1007\/s11750-019-00514-4"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-319-59776-8_21","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"N Boland","year":"2017","unstructured":"Boland, N., Hewitt, M., Vu, D.M., Savelsbergh, M.: Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 254\u2013262. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59776-8_21"},{"issue":"1","key":"20_CR5","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1287\/trsc.1120.0449","volume":"48","author":"J Cordeau","year":"2014","unstructured":"Cordeau, J., Ghiani, G., Guerriero, E.: Analysis and branch-and-cut algorithm for the time-dependent travelling salesman problem. Tra. Sci. 48(1), 46\u201358 (2014)","journal-title":"Tra. Sci."},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1016\/j.cor.2017.06.026","volume":"88","author":"A Montero","year":"2017","unstructured":"Montero, A., M\u00e9ndez-D\u0131az, I., Miranda-Bront, J.J.: An integer programming approach for the time-dependent traveling salesman problem with time windows. Comput. Oper. Res. 88, 280\u2013289 (2017)","journal-title":"Comput. Oper. Res."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Pop, P.C., Cosma, O., Sabo, C., Sitar, C.P.: A comprehensive survey on the generalized traveling salesman problem. Eur. J. Oper. Res. (2023)","DOI":"10.1016\/j.ejor.2023.07.022"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-030-05983-5_4","volume-title":"Hybrid Metaheuristics","author":"M Riedler","year":"2019","unstructured":"Riedler, M., Ruthmair, M., Raidl, G.R.: Strategies for iteratively refining layered graph models. In: Blesa Aguilera, M.J., Blum, C., Gambini Santos, H., Pinacho-Davidson, P., Godoy del Campo, J. (eds.) HM 2019. LNCS, vol. 11299, pp. 46\u201362. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-05983-5_4"},{"issue":"3","key":"20_CR9","doi-asserted-by":"publisher","first-page":"703","DOI":"10.1287\/trsc.2019.0911","volume":"54","author":"DM Vu","year":"2020","unstructured":"Vu, D.M., Hewitt, M., Boland, N., Savelsbergh, M.: Dynamic discretization discovery for solving the time-dependent traveling salesman problem with time windows. Tran. Sci. 54(3), 703\u2013720 (2020)","journal-title":"Tran. Sci."},{"issue":"3","key":"20_CR10","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1016\/j.ejor.2022.01.029","volume":"302","author":"DM Vu","year":"2022","unstructured":"Vu, D.M., Hewitt, M., Vu, D.D.: Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery. Eur. J. Oper. Res. 302(3), 831\u2013846 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR11","unstructured":"Vu, D.M., Hewitt, M., Vu, D.D.: Solving time-dependent traveling salesman problem with time windows under generic time-dependent travel cost (2023). https:\/\/arxiv.org\/abs\/2311.08111"}],"container-title":["Lecture Notes in Computer Science","Computational Data and Social Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-0669-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,28]],"date-time":"2024-02-28T21:24:57Z","timestamp":1709155497000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-0669-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819706686","9789819706693"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-0669-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"29 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSoNet","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Data and Social Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csonet-conf.github.io\/csonet23\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"64","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"14","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.7","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.0","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The four extended abstracts are also included in this proceedings.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}