{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,25]],"date-time":"2025-11-25T06:57:04Z","timestamp":1764053824857,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"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_1","type":"book-chapter","created":{"date-parts":[[2023,2,22]],"date-time":"2023-02-22T08:02:59Z","timestamp":1677052979000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Application of\u00a0CMSA to\u00a0the\u00a0Electric Vehicle Routing Problem with\u00a0Time Windows, Simultaneous Pickup and\u00a0Deliveries, and\u00a0Partial Vehicle Charging"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7376-7008","authenticated-orcid":false,"given":"Mehmet An\u0131l","family":"Akbay","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2355-7015","authenticated-orcid":false,"given":"Can Berk","family":"Kalayci","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1736-3559","authenticated-orcid":false,"given":"Christian","family":"Blum","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,23]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Akbay, M.A., Blum, C.: Application of CMSA to the minimum positive influence dominating set problem. In: Artificial Intelligence Research and Development, pp. 17\u201326. IOS Press (2021)","DOI":"10.3233\/FAIA210112"},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s44196-022-00098-1","volume":"15","author":"MA Akbay","year":"2022","unstructured":"Akbay, M.A., L\u00f3pez Serrano, A., Blum, C.: A self-adaptive variant of CMSA: application to the minimum positive influence dominating set problem. Int. J. Comput. Intell. Syst. 15(1), 1\u201313 (2022). Springer","journal-title":"Int. J. Comput. Intell. Syst."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Arora, D., Maini, P., Pinacho-Davidson, P., Blum, C.: Route planning for cooperative air-ground robots with fuel constraints: an approach based on CMSA. In: Proceedings of GECCO 2019 - Genetic and Evolutionary Computation Conference, pp. 207\u2013214. Association for Computing Machinery, New York (2019)","DOI":"10.1145\/3321707.3321820"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Asghari, M., Al-e Hashem, S.M.J.M.: Green vehicle routing problem: a state-of-the-art review. Int. J. Prod. Econ. 231, 107899 (2021)","DOI":"10.1016\/j.ijpe.2020.107899"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.cor.2015.10.014","volume":"68","author":"C Blum","year":"2016","unstructured":"Blum, C., Pinacho Davidson, P., L\u00f3pez-Ib\u00e1\u00f1ez, M., Lozano, J.A.: Construct, merge, solve & adapt: a new general algorithm for combinatorial optimization. Comput. Oper. Res. 68, 75\u201388 (2016)","journal-title":"Comput. Oper. Res."},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Blum, C., Raidl, G.R.: Hybrid Metaheuristics - Powerful Tools for Optimization. Artificial Intelligence: Foundations, Theory, and Algorithms, Springer, Switzerland (2016). https:\/\/doi.org\/10.1007\/978-3-319-30883-8","DOI":"10.1007\/978-3-319-30883-8"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-642-04918-7_13","volume-title":"Hybrid Metaheuristics","author":"MA Boschetti","year":"2009","unstructured":"Boschetti, M.A., Maniezzo, V., Roffilli, M., Boluf\u00e9 R\u00f6hler, A.: Matheuristics: optimization, simulation and control. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol. 5818, pp. 171\u2013177. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04918-7_13"},{"issue":"4","key":"1_CR8","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568\u2013581 (1964)","journal-title":"Oper. Res."},{"key":"1_CR9","unstructured":"Conrad, R.G., Figliozzi, M.A.: The recharging vehicle routing problem. In: Proceedings of the 2011 Industrial Engineering Research Conference, p. 8. IISE Norcross, GA (2011)"},{"issue":"1","key":"1_CR10","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."},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/PL00013346","volume":"23","author":"J Dethloff","year":"2001","unstructured":"Dethloff, J.: Vehicle routing and reverse logistics: the vehicle routing probleam with simultaneous delivery and pick-up. OR-Spektr. 23(1), 79\u201396 (2001)","journal-title":"OR-Spektr."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Duman, E.N., Ta\u015f, D., \u00c7atay, B.: Branch-and-price-and-cut methods for the electric vehicle routing problem with time windows. Int. J. Prod. Res. 60(17), 5332\u20135353 (2022). Taylor & Francis","DOI":"10.1080\/00207543.2021.1955995"},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s10732-020-09450-0","volume":"27","author":"N Dupin","year":"2021","unstructured":"Dupin, N., Talbi, E.G.: Matheuristics to optimize refueling and maintenance planning of nuclear power plants. J. Heurist. 27(1), 63\u2013105 (2021)","journal-title":"J. Heurist."},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Elshaer, R., Awad, H.: A taxonomic review of metaheuristic algorithms for solving the vehicle routing problem and its variants. Comput. Industr. Eng. 140, 106242 (2020)","DOI":"10.1016\/j.cie.2019.106242"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.tre.2011.08.001","volume":"48","author":"S Erdo\u011fan","year":"2012","unstructured":"Erdo\u011fan, S., Miller-Hooks, E.: A green vehicle routing problem. Transp. Res. Part E: Logist. Transp. Rev. 48(1), 100\u2013114 (2012)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.tre.2014.09.003","volume":"71","author":"\u00c1 Felipe","year":"2014","unstructured":"Felipe, \u00c1., Ortu\u00f1o, M.T., Righini, G., Tirado, G.: A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges. Transp. Res. Part E: Logist. Transp. Rev. 71, 111\u2013128 (2014)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"1","key":"1_CR17","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s10732-020-09462-w","volume":"27","author":"J Ferrer","year":"2021","unstructured":"Ferrer, J., Chicano, F., Ortega-Toro, J.A.: CMSA algorithm for solving the prioritized pairwise test data generation problem in software product lines. J. Heurist. 27(1), 229\u2013249 (2021)","journal-title":"J. Heurist."},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Fischetti, M.: Matheuristics, pp. 121\u2013153. Springer, Heidelberg (2018)","DOI":"10.1007\/978-3-319-07124-4_14"},{"key":"1_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The Vehicle Routing Problem: Latest Advances and New Challenges","author":"BL Golden","year":"2008","unstructured":"Golden, B.L., Raghavan, S., Wasil, E.A.: The Vehicle Routing Problem: Latest Advances and New Challenges, vol. 43. Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-77778-8"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Huerta-Rojo, A., Montero, E., Rojas-Morales, N.: An ant-based approach to solve the electric vehicle routing problem with time windows and partial recharges. In: 2021 40th International Conference of the Chilean Computer Science Society (SCCC), pp. 1\u20138. IEEE (2021)","DOI":"10.1109\/SCCC54552.2021.9650425"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.trc.2016.01.013","volume":"65","author":"M Keskin","year":"2016","unstructured":"Keskin, M., \u00c7atay, B.: Partial recharge strategies for the electric vehicle routing problem with time windows. Transp. Res. Part C: Emerg. Technol. 65, 111\u2013127 (2016)","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.cor.2018.06.019","volume":"100","author":"M Keskin","year":"2018","unstructured":"Keskin, M., \u00c7atay, B.: A matheuristic method for the electric vehicle routing problem with time windows and fast chargers. Comput. Oper. Res. 100, 172\u2013188 (2018)","journal-title":"Comput. Oper. Res."},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Keskin, M., \u00c7atay, B., Laporte, G.: A simulation-based heuristic for the electric vehicle routing problem with time windows and stochastic waiting times at recharging stations. Comput. Oper. Res. 125, 105060 (2021)","DOI":"10.1016\/j.cor.2020.105060"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Ko\u00e7, \u00c7., Laporte, G., T\u00fckenmez, \u0130: A review of vehicle routing with simultaneous pickup and delivery. Comput. Oper. Res. 122, 104987 (2020)","DOI":"10.1016\/j.cor.2020.104987"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/j.cor.2018.11.015","volume":"103","author":"R Lewis","year":"2019","unstructured":"Lewis, R., Thiruvady, D., Morgan, K.: Finding happiness: an analysis of the maximum happy vertices problem. Comput. Oper. Res. 103, 265\u2013276 (2019)","journal-title":"Comput. Oper. Res."},{"key":"1_CR26","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1nez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1nez, M., et al.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"123691","DOI":"10.1016\/j.jclepro.2020.123691","volume":"279","author":"R Moghdani","year":"2021","unstructured":"Moghdani, R., Salimifard, K., Demir, E., Benyettou, A.: The green vehicle routing problem: a systematic literature review. J. Clean. Prod. 279, 123691 (2021)","journal-title":"J. Clean. Prod."},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.trb.2017.02.004","volume":"103","author":"A Montoya","year":"2017","unstructured":"Montoya, A., Gu\u00e9ret, C., Mendoza, J.E., Villegas, J.G.: The electric vehicle routing problem with nonlinear charging function. Transp. Res. Part B: Methodol. 103, 87\u2013110 (2017)","journal-title":"Transp. Res. Part B: Methodol."},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.cie.2014.10.029","volume":"79","author":"JR Montoya-Torres","year":"2015","unstructured":"Montoya-Torres, J.R., Franco, J.L., Isaza, S.N., Jim\u00e9nez, H.F., Herazo-Padilla, N.: A literature review on the vehicle routing problem with multiple depots. Comput. Industr. Eng. 79, 115\u2013129 (2015)","journal-title":"Comput. Industr. Eng."},{"issue":"3","key":"1_CR30","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/0377-2217(88)90154-3","volume":"34","author":"H Paessens","year":"1988","unstructured":"Paessens, H.: The savings algorithm for the vehicle routing problem. Eur. J. Oper. Res. 34(3), 336\u2013344 (1988)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR31","doi-asserted-by":"publisher","first-page":"102293","DOI":"10.1016\/j.tre.2021.102293","volume":"149","author":"MEH Sadati","year":"2021","unstructured":"Sadati, M.E.H., \u00c7atay, B.: A hybrid variable neighborhood search approach for the multi-depot green vehicle routing problem. Transp. Res. Part E: Logist. Transp. Rev. 149, 102293 (2021)","journal-title":"Transp. Res. Part E: Logist. Transp. Rev."},{"issue":"10","key":"1_CR32","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1057\/palgrave.jors.2600808","volume":"50","author":"S Salhi","year":"1999","unstructured":"Salhi, S., Nagy, G.: A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J. Oper. Res. Soc. 50(10), 1034\u20131042 (1999)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"1_CR33","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1287\/trsc.2013.0490","volume":"48","author":"M Schneider","year":"2014","unstructured":"Schneider, M., Stenger, A., Goeke, D.: The electric vehicle-routing problem with time windows and recharging stations. Transp. Sci. 48(4), 500\u2013520 (2014)","journal-title":"Transp. Sci."},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: Vehicle Routing: Problems, Methods, and Applications. SIAM (2014)","DOI":"10.1137\/1.9781611973594"},{"issue":"4","key":"1_CR35","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/s10878-007-9090-4","volume":"15","author":"NA Wassan","year":"2008","unstructured":"Wassan, N.A., Wassan, A.H., Nagy, G.: A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. J. Comb. Optim. 15(4), 368\u2013386 (2008)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"1_CR36","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1057\/jors.1970.52","volume":"21","author":"P Yellow","year":"1970","unstructured":"Yellow, P.: A computational modification to the savings method of vehicle scheduling. J. Oper. Res. Soc. 21(2), 281\u2013283 (1970)","journal-title":"J. Oper. Res. Soc."}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,1]],"date-time":"2023-07-01T08:02:46Z","timestamp":1688198566000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26504-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031265037","9783031265044"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26504-4_1","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)"}}]}}