{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:54:38Z","timestamp":1757620478724,"version":"3.44.0"},"publisher-location":"Singapore","reference-count":20,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819502141"},{"type":"electronic","value":"9789819502158"}],"license":[{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,1]],"date-time":"2025-08-01T00:00:00Z","timestamp":1754006400000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-0215-8_12","type":"book-chapter","created":{"date-parts":[[2025,7,31]],"date-time":"2025-07-31T16:25:09Z","timestamp":1753979109000},"page":"148-161","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Weighting-Based Local Search for\u00a0Route Number Minimization for\u00a0Vehicle Routing Problem with\u00a0Time Windows"],"prefix":"10.1007","author":[{"given":"Yuxuan","family":"Wang","sequence":"first","affiliation":[]},{"given":"Yunhao","family":"Li","sequence":"additional","affiliation":[]},{"given":"Zhouxing","family":"Su","sequence":"additional","affiliation":[]},{"given":"Junwen","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Qingyun","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zhipeng","family":"L\u00fc","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,8,1]]},"reference":[{"issue":"2","key":"12_CR1","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1287\/trsc.2019.0914","volume":"54","author":"J Christiaens","year":"2020","unstructured":"Christiaens, J., Vanden Berghe, G.: Slack induction by string removals for vehicle routing problems. Transp. Sci. 54(2), 417\u2013433 (2020)","journal-title":"Transp. Sci."},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig, G.B., Ramser, J.H.: The truck dispatching problem. Manage. Sci. 6(1), 80\u201391 (1959)","journal-title":"Manage. Sci."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Dees, W.A., Smith, R.J.: Performance of interconnection rip-up and reroute strategies. In: 18th Design Automation Conference, pp. 382\u2013390. IEEE (1981)","DOI":"10.1109\/DAC.1981.1585385"},{"issue":"2","key":"12_CR4","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers, M., Desrosiers, J., Solomon, M.: A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2), 342\u2013354 (1992)","journal-title":"Oper. Res."},{"issue":"2","key":"12_CR5","first-page":"11","volume":"15","author":"B Dong","year":"2017","unstructured":"Dong, B., Wu, W., Yang, Z., Li, J.: Software defined networking based on-demand routing protocol in vehicle ad-hoc networks. ZTE Commun. 15(2), 11 (2017)","journal-title":"ZTE Commun."},{"issue":"3","key":"12_CR6","first-page":"22","volume":"14","author":"J He","year":"2016","unstructured":"He, J., Cai, L.: Hybrid content distribution framework for large-scale vehicular ad hoc networks. ZTE Commun. 14(3), 22 (2016)","journal-title":"ZTE Commun."},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Homberger, J., Gehring, H.: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. Eur. J. Oper. Res. 162(1), 220\u2013238 (2005). Logistics: From Theory to Application","DOI":"10.1016\/j.ejor.2004.01.027"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Ibaraki, T., Imahori, S., Nonobe, K., Sobue, K., Uno, T., Yagiura, M.: An iterated local search algorithm for the vehicle routing problem with convex time penalty functions. Discrete Appl. Math. 156(11), 2050\u20132069 (2008), in Memory of Leonid Khachiyan (1952 - 2005)","DOI":"10.1016\/j.dam.2007.04.022"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/0-387-25486-2_3","volume-title":"Column Generation","author":"B Kallehauge","year":"2005","unstructured":"Kallehauge, B., Larsen, J., Madsen, O., Solomon, M.M.: Vehicle routing problem with time windows. In: Desaulniers, G., Desrosiers, J., Solomon, M.M. (eds.) Column Generation, pp. 67\u201398. Springer-Verlag, New York (2005). https:\/\/doi.org\/10.1007\/0-387-25486-2_3"},{"key":"12_CR10","unstructured":"Kindervater, G.A.: Vehicle routing: handling edge exchanges. Local Search in Combinatorial Optimization (1997), publisher: Princeton University Press"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Kindervater, G.A., Savelsbergh, M.W.: Vehicle routing: handling edge exchanges. In: Local Search in Combinatorial Optimization, pp. 337\u2013360. Princeton University Press (2018)","DOI":"10.2307\/j.ctv346t9c.15"},{"issue":"3","key":"12_CR12","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/opre.45.3.395","volume":"45","author":"N Kohl","year":"1997","unstructured":"Kohl, N., Madsen, O.B.: An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation. Oper. Res. 45(3), 395\u2013406 (1997)","journal-title":"Oper. Res."},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.02.017","volume":"84","author":"CM Li","year":"2017","unstructured":"Li, C.M., Jiang, H., Many\u00e0, F.: On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem. Comput. Oper. Res. 84, 1\u201315 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1287\/ijoc.1060.0186","volume":"19","author":"A Lim","year":"2007","unstructured":"Lim, A., Zhang, X.: A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows. INFORMS J. Comput. 19(3), 443\u2013457 (2007)","journal-title":"INFORMS J. Comput."},{"issue":"5","key":"12_CR15","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.orl.2009.04.006","volume":"37","author":"Y Nagata","year":"2009","unstructured":"Nagata, Y., Br\u00e4ysy, O.: A powerful route minimization heuristic for the vehicle routing problem with time windows. Oper. Res. Lett. 37(5), 333\u2013338 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"12_CR16","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1016\/j.cor.2009.06.022","volume":"37","author":"Y Nagata","year":"2010","unstructured":"Nagata, Y., Br\u00e4ysy, O., Dullaert, W.: A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput. Oper. Res. 37(4), 724\u2013737 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"12_CR17","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8), 2403\u20132435 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"12_CR18","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"JY Potvin","year":"1995","unstructured":"Potvin, J.Y., Rousseau, J.M.: An exchange heuristic for routeing problems with time windows. J. Oper. Res. Soc. 46(12), 1433\u20131446 (1995)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"12_CR19","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1002\/net.20332","volume":"54","author":"E Prescott-Gagnon","year":"2009","unstructured":"Prescott-Gagnon, E., Desaulniers, G., Rousseau, L.M.: A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Networks 54(4), 190\u2013204 (2009)","journal-title":"Networks"},{"issue":"2","key":"12_CR20","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/jcph.1999.6413","volume":"159","author":"G Schrimpf","year":"2000","unstructured":"Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., Dueck, G.: Record breaking optimization results using the ruin and recreate principle. J. Comput. Phys. 159(2), 139\u2013171 (2000)","journal-title":"J. Comput. Phys."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-0215-8_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T09:36:29Z","timestamp":1757324189000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-0215-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,1]]},"ISBN":["9789819502141","9789819502158"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-0215-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,1]]},"assertion":[{"value":"1 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon0","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcsuestc.com\/cocoon2025\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}