{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T08:48:53Z","timestamp":1742978933415,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031265037"},{"type":"electronic","value":"9783031265044"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-26504-4_4","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"45-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["New Neighborhood Strategies for\u00a0the\u00a0Bi-objective Vehicle Routing Problem with\u00a0Time Windows"],"prefix":"10.1007","author":[{"given":"Cl\u00e9ment","family":"Legrand","sequence":"first","affiliation":[]},{"given":"Diego","family":"Cattaruzza","sequence":"additional","affiliation":[]},{"given":"Laetitia","family":"Jourdan","sequence":"additional","affiliation":[]},{"given":"Marie-El\u00e9onore","family":"Kessaci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"107957","DOI":"10.1016\/j.patcog.2021.107957","volume":"116","author":"F Arnold","year":"2021","unstructured":"Arnold, F., Santana, \u00cd., S\u00f6rensen, K., Vidal, T.: PILS: exploring high-order neighborhoods by pattern mining and injection. Pattern Recognit. 116, 107957 (2021)","journal-title":"Pattern Recognit."},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"100598","DOI":"10.1016\/j.swevo.2019.100598","volume":"51","author":"A Benitez-Hidalgo","year":"2019","unstructured":"Benitez-Hidalgo, A., Nebro, A.J., Garcia-Nieto, J., Oregi, I., Del Ser, J.: jMetalPy: a python framework for multi-objective optimization with metaheuristics. Swarm Evol. Comput. 51, 100598 (2019)","journal-title":"Swarm Evol. Comput."},{"issue":"6","key":"4_CR3","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1007\/s10732-018-9381-1","volume":"24","author":"A Blot","year":"2018","unstructured":"Blot, A., Kessaci, M.\u00c9., Jourdan, L.: Survey and unification of local search techniques in metaheuristics for multi-objective combinatorial optimisation. J. Heurist. 24(6), 853\u2013877 (2018). https:\/\/doi.org\/10.1007\/s10732-018-9381-1","journal-title":"J. Heurist."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Castro-Gutierrez, J., Landa-Silva, D., P\u00e9rez, J.M.: Nature of real-world multi-objective vehicle routing with evolutionary algorithms. In: 2011 IEEE International Conference on Systems, Man, and Cybernetics. IEEE (2011)","DOI":"10.1109\/ICSMC.2011.6083675"},{"key":"4_CR5","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-11218-8_1","volume-title":"Advances in Multi-Objective Nature Inspired Computing","author":"CAC Coello","year":"2010","unstructured":"Coello, C.A.C., Dhaenens, C., Jourdan, L.: Multi-objective combinatorial optimization: problematic and context. In: Coello Coello, C.A., Dhaenens, C., Jourdan, L. (eds.) Advances in Multi-Objective Nature Inspired Computing. Studies in Computational Intelligence, vol. 272, pp. 1\u201321. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11218-8_1"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.asoc.2010.04.001","volume":"10","author":"K Ghoseiri","year":"2010","unstructured":"Ghoseiri, K., Ghannadpour, S.F.: Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Appl. Soft Comput. 10(4), 1096\u20131107 (2010)","journal-title":"Appl. Soft Comput."},{"key":"4_CR7","unstructured":"Knowles, J.D.: Local-search and hybrid evolutionary algorithms for Pareto optimization. Ph.D. thesis, University of Reading Reading (2002)"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Legrand, C., Cattaruzza, D., Jourdan, L., Kessaci, M.-E.: Enhancing MOEA\/D with learning: application to routing problems with time windows. In: Proceedings of the GECCO Companion (2022)","DOI":"10.1145\/3520304.3528909"},{"issue":"9","key":"4_CR9","doi-asserted-by":"publisher","first-page":"6741","DOI":"10.1007\/s00500-019-04312-9","volume":"24","author":"B Moradi","year":"2020","unstructured":"Moradi, B.: The new optimization algorithm for the vehicle routing problem with time windows using multi-objective discrete learnable evolution model. Soft. Comput. 24(9), 6741\u20136769 (2020)","journal-title":"Soft. Comput."},{"issue":"4","key":"4_CR10","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":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1287\/ijoc.2016.0744","volume":"29","author":"D Pecin","year":"2017","unstructured":"Pecin, D., Contardo, C., Desaulniers, G., Uchoa, E.: New enhancements for the exact solution of the vehicle routing problem with time windows. INFORMS J. Comput. 29(3), 489\u2013502 (2017)","journal-title":"INFORMS J. Comput."},{"issue":"12","key":"4_CR12","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12), 1985\u20132002 (2004)","journal-title":"Comput. Oper. Res."},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.cor.2015.04.009","volume":"62","author":"Y Qi","year":"2015","unstructured":"Qi, Y., Hou, Z., Li, H., Huang, J., Li, X.: A decomposition based memetic algorithm for multi-objective vehicle routing problem with time windows. Comput. Oper. Res. 62, 61\u201377 (2015)","journal-title":"Comput. Oper. Res."},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"Riquelme, N., Von L\u00fccken, C., Baran, B.: Performance metrics in multi-objective optimization. In: 2015 Latin American computing conference (CLEI), pp. 1\u201311. IEEE (2015)","DOI":"10.1109\/CLEI.2015.7360024"},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.ejor.2005.12.009","volume":"177","author":"R Ruiz","year":"2007","unstructured":"Ruiz, R., St\u00fctzle, T.: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. Eur. J. Oper. Res. 177(3), 2033\u20132049 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/j.ejor.2017.04.059","volume":"263","author":"M Schneider","year":"2017","unstructured":"Schneider, M., Schwahn, F., Vigo, D.: Designing granular solution methods for routing problems with time windows. Eur. J. Oper. Res. 263(2), 493\u2013509 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"4_CR17","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"issue":"4","key":"4_CR18","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","volume":"15","author":"P Toth","year":"2003","unstructured":"Toth, P., Vigo, D.: The granular tabu search and its application to the vehicle-routing problem. INFORMS J. Comput. 15(4), 333\u2013346 (2003)","journal-title":"INFORMS J. Comput."},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. SIAM (2014)","DOI":"10.1137\/1.9781611973594"},{"issue":"3","key":"4_CR20","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1016\/j.ejor.2016.08.012","volume":"257","author":"E Uchoa","year":"2017","unstructured":"Uchoa, E., Pecin, D., Pessoa, A., Poggi, M., Vidal, T., Subramanian, A.: New benchmark instances for the capacitated vehicle routing problem. Eur. J. Oper. Res. 257(3), 845\u2013858 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"4_CR21","first-page":"1717","volume":"13","author":"S Varun Kumar","year":"2017","unstructured":"Varun Kumar, S., Panneerselvam, R.: A study of crossover operators for genetic algorithms to solve VRP and its variants and new sinusoidal motion crossover operator. Int. J. Comput. Intell. Res. 13(7), 1717\u20131733 (2017)","journal-title":"Int. J. Comput. Intell. Res."},{"key":"4_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2012.07.018","volume":"40","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Comput. Oper. Res. 40, 1 (2013)","journal-title":"Comput. Oper. Res."},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"41588","DOI":"10.1109\/ACCESS.2020.2973670","volume":"8","author":"Q Xu","year":"2020","unstructured":"Xu, Q., Xu, Z., Ma, T.: A survey of multiobjective evolutionary algorithms based on decomposition: variants, challenges and future directions. IEEE Access 8, 41588\u201341614 (2020)","journal-title":"IEEE Access"},{"key":"4_CR24","first-page":"6","volume":"11","author":"Q Zhang","year":"2007","unstructured":"Zhang, Q., Li, H.: MOEA\/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11, 6 (2007)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"4_CR25","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1109\/JSYST.2014.2300201","volume":"9","author":"Y Zhou","year":"2014","unstructured":"Zhou, Y., Wang, J.: A local search-based multiobjective optimization algorithm for multiobjective vehicle routing problem with time windows. IEEE Syst. J. 9(3), 1100\u20131113 (2014)","journal-title":"IEEE Syst. J."},{"issue":"2","key":"4_CR26","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1109\/TEVC.2003.810758","volume":"7","author":"E Zitzler","year":"2003","unstructured":"Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evol. Comput. 7(2), 117\u2013132 (2003)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26504-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:02:55Z","timestamp":1688198575000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MIC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metaheuristics International Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ortigia-Syracuse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 July 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"metic2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ants-lab.it\/mic2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"72","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":"48","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":"17","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":"67% - 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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}