{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T13:07:48Z","timestamp":1758892068575},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030349790"},{"type":"electronic","value":"9783030349806"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34980-6_6","type":"book-chapter","created":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T01:03:07Z","timestamp":1573434187000},"page":"63-69","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A RVND+ILS Metaheuristic to Solve the Delivery Man Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Ha-Bang","family":"Ban","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,11]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Ban, H.B., Nguyen, D.N.: Improved genetic algorithm for minimum latency problem. In: Proceedings of SOICT, pp. 9\u201315 (2010)","DOI":"10.1145\/1852611.1852614"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Ban, H.B., Nguyen, K., Ngo, M.C., Nguyen, D.N.: An efficient exact algorithm for minimum latency problem. J. PI 10, 1\u20138 (2013)","DOI":"10.2201\/NiiPi.2013.10.10"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.3233\/FI-2017-1596","volume":"156","author":"HB Ban","year":"2017","unstructured":"Ban, H.B., Nghia, N.D.: A meta-heuristic algorithm combining between tabu and variable neighborhood search for the minimum latency problem. J. FI 156(1), 21\u201344 (2017)","journal-title":"J. FI"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Ban, H.B., Nghia, N.D.: Metaheuristic for the minimum latency problem with time windows. In: Proceedings of RIVF, pp. 1\u20136 (2017)","DOI":"10.1109\/RIVF.2016.7800265"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, W., Raghavan, P., Sudan, M.: The minimum latency problem. In: Proceedings of STOC, pp. 163\u2013171 (1994)","DOI":"10.1145\/195058.195125"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1287\/opre.43.2.367","volume":"43","author":"Y Dumas","year":"1995","unstructured":"Dumas, Y., Desrosiers, J., G\u00e9linas, E.: An optimal algorithm for the traveling salesman problem with time windows. J. Oper. Res. 43, 367\u2013371 (1995)","journal-title":"J. Oper. Res."},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Global Opt. 6(2), 109\u2013133 (1995)","journal-title":"J. Global Opt."},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1287\/opre.46.3.330","volume":"43","author":"M Gendreau","year":"1998","unstructured":"Gendreau, M., Hertz, A., Laporte, G., Stan, M.: A generalized insertion heuristic for the traveling salesman problem with time windows. J. Oper. Res. 43, 330\u2013335 (1998)","journal-title":"J. Oper. Res."},{"issue":"4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.disopt.2010.06.002","volume":"7","author":"G Heilporn","year":"2010","unstructured":"Heilporn, G., Cordeau, J.F., Laporte, G.: The delivery man problem with time windows. Discrete Optim. 7(4), 269\u2013282 (2010)","journal-title":"Discrete Optim."},{"issue":"9","key":"6_CR10","doi-asserted-by":"publisher","first-page":"1570","DOI":"10.1016\/j.cor.2009.11.015","volume":"37","author":"M Lopez-Ibanez","year":"2010","unstructured":"Lopez-Ibanez, M., Blum, C.: Beam-ACO for the traveling salesman problem with time windows. J. Comput. Oper. Res. 37(9), 1570\u20131583 (2010)","journal-title":"J. Comput. Oper. Res."},{"issue":"11","key":"6_CR11","first-page":"1097","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. J. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Oper. Res."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: a case study in local optimization. In: Aarts, E., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 215\u2013310","DOI":"10.2307\/j.ctv346t9c.13"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1002\/net.3230220305","volume":"22","author":"JN Tsitsiklis","year":"1992","unstructured":"Tsitsiklis, J.N.: Special cases of traveling salesman and repairman problems with time windows. J. Netw. 22, 263\u2013283 (1992)","journal-title":"J. Netw."},{"issue":"1","key":"6_CR14","first-page":"80","volume":"19","author":"JW Ohlmann","year":"2007","unstructured":"Ohlmann, J.W., Thomas, B.W.: A compressed-annealing heuristic for the traveling salesman problem with time windows. J. Inform. 19(1), 80\u201390 (2007)","journal-title":"J. Inform."}],"container-title":["Lecture Notes in Computer Science","Computational Data and Social Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34980-6_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T01:08:55Z","timestamp":1573434535000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34980-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030349790","9783030349806"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34980-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 November 2019","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":"Ho Chi Minh City","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csonet2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/optnetsci.cise.ufl.edu\/CSoNet\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"120","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":"22","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":"8","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":"18% - 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":"3","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":"5","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)"}}]}}