{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:09:33Z","timestamp":1765357773989,"version":"3.38.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T00:00:00Z","timestamp":1737158400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T00:00:00Z","timestamp":1737158400000},"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":["J Heuristics"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1007\/s10732-024-09536-z","type":"journal-article","created":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T14:30:26Z","timestamp":1737210626000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A memetic algorithm for the flexible periodic vehicle routing problem"],"prefix":"10.1007","volume":"31","author":[{"given":"Banafsheh","family":"Amiri","sequence":"first","affiliation":[]},{"given":"Koorush","family":"Ziarati","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0002-3993-3521","authenticated-orcid":false,"given":"Somayeh","family":"Sohrabi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,18]]},"reference":[{"issue":"85","key":"9536_CR1","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.cor.2017.03.008","volume":"9","author":"C Archetti","year":"2017","unstructured":"Archetti, C., Fern\u00e1ndez, E., Huerta-Mu\u00f1oz, D.L.: The flexible periodic vehicle routing problem. Comput. Oper. Res. 9(85), 58\u201370 (2017). https:\/\/doi.org\/10.1016\/j.cor.2017.03.008","journal-title":"Comput. Oper. Res."},{"key":"9536_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.cor.2018.05.021","volume":"99","author":"C Archetti","year":"2018","unstructured":"Archetti, C., Fern\u00e1ndez, E., Huerta-Mu\u00f1oz, D.L.: A two-phase solution algorithm for the flexible periodic vehicle routing problem. Comput. Oper. Res. 99, 27\u201337 (2018). https:\/\/doi.org\/10.1016\/j.cor.2018.05.021","journal-title":"Comput. Oper. Res."},{"key":"9536_CR3","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.cor.2015.03.014","volume":"61","author":"C Archetti","year":"2015","unstructured":"Archetti, C., Jabali, O., Speranza, M.G.: Multi-period vehicle routing problem with due dates. Comput. Oper. Res. 61, 122\u2013134 (2015). https:\/\/doi.org\/10.1016\/j.cor.2015.03.014","journal-title":"Comput. Oper. Res."},{"key":"9536_CR4","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s13676-012-0016-7","volume":"1","author":"L Bertazzi","year":"2012","unstructured":"Bertazzi, L., Speranza, M.G.: Inventory routing problems: an introduction. EURO J Transp Logist 1, 307\u2013326 (2012). https:\/\/doi.org\/10.1007\/s13676-012-0016-7","journal-title":"EURO J Transp Logist"},{"issue":"163","key":"9536_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.dam.2012.08.032","volume":"1","author":"V Cacchiani","year":"2014","unstructured":"Cacchiani, V., Hemmelmayr, V.C., Tricoire, F.: A set-covering based heuristic algorithm for the periodic vehicle routing problem. Discret. Appl. Math. 1(163), 53\u201364 (2014). https:\/\/doi.org\/10.1016\/j.dam.2012.08.032","journal-title":"Discret. Appl. Math."},{"issue":"63","key":"9536_CR6","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1002\/net.21527","volume":"1","author":"AM Campbell","year":"2014","unstructured":"Campbell, A.M., Wilson, J.H.: Forty years of periodic vehicle routing. Networks 1(63), 2\u201315 (2014). https:\/\/doi.org\/10.1002\/net.21527","journal-title":"Networks"},{"issue":"69","key":"9536_CR7","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1057\/s41274-017-0206-7","volume":"2","author":"R Cantu-Funes","year":"2018","unstructured":"Cantu-Funes, R., Salazar-Aguilar, M.A., Boyer, V.: Multi-depot periodic vehicle routing problem with due dates and time windows. J Oper Res Soc 2(69), 296\u2013306 (2018). https:\/\/doi.org\/10.1057\/s41274-017-0206-7","journal-title":"J Oper Res Soc"},{"key":"9536_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8_4","volume-title":"The Period Vehicle Routing Problem and its Extensions","author":"PM Francis","year":"2008","unstructured":"Francis, P.M., Smilowitz, K.R., Tzur, M.: The Period Vehicle Routing Problem and its Extensions. Springer, US (2008)"},{"issue":"2","key":"9536_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s12532-010-0013-5","volume":"6","author":"C Gro\u00ebr","year":"2010","unstructured":"Gro\u00ebr, C., Golden, B., Wasil, E.: A library of local search heuristics for the vehicle routing problem. Math. Program. Comput. 6(2), 79\u2013101 (2010). https:\/\/doi.org\/10.1007\/s12532-010-0013-5","journal-title":"Math. Program. Comput."},{"issue":"126","key":"9536_CR10","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"10","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 10(126), 106\u2013130 (2000). https:\/\/doi.org\/10.1016\/S0377-2217(99)00284-2","journal-title":"Eur. J. Oper. Res."},{"key":"9536_CR11","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.cor.2021.105662","volume":"141","author":"DL Huerta-Mu\u00f1oz","year":"2022","unstructured":"Huerta-Mu\u00f1oz, D.L., Archetti, C., Fern\u00e1ndez, E., Perea, F.: The heterogeneous flexible periodic vehicle routing problem: mathematical formulations and solution algorithms. Comput. Oper. Res. 141, 52\u201360 (2022). https:\/\/doi.org\/10.1016\/j.cor.2021.105662","journal-title":"Comput. Oper. Res."},{"issue":"21","key":"9536_CR12","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"4","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 4(21), 498\u2013516 (1973). https:\/\/doi.org\/10.1287\/opre.21.2.498","journal-title":"Oper. Res."},{"issue":"70","key":"9536_CR13","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.trc.2015.06.016","volume":"9","author":"S Mancini","year":"2016","unstructured":"Mancini, S.: A real-life multi depot multi period vehicle routing problem with a heterogeneous fleet: formulation and adaptive large neighborhood search based matheuristic. Transp Res Part C Emerg Technol 9(70), 100\u2013112 (2016). https:\/\/doi.org\/10.1016\/j.trc.2015.06.016","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"41","key":"9536_CR14","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.cor.2013.07.025","volume":"1","author":"J Michallet","year":"2014","unstructured":"Michallet, J., Prins, C., Amodeo, L., Yalaoui, F., Vitry, G.: Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services. Comput. Oper. Res. 1(41), 196\u2013207 (2014). https:\/\/doi.org\/10.1016\/j.cor.2013.07.025","journal-title":"Comput. Oper. Res."},{"issue":"71","key":"9536_CR15","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s00170-013-5501-0","volume":"3","author":"M Mirabi","year":"2014","unstructured":"Mirabi, M.: A hybrid electromagnetism algorithm for multi-depot periodic vehicle routing problem. Int J Adv Manuf Technol 3(71), 509\u2013518 (2014). https:\/\/doi.org\/10.1007\/s00170-013-5501-0","journal-title":"Int J Adv Manuf Technol"},{"issue":"29","key":"9536_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1017\/S0890060414000328","volume":"2","author":"M Mirabi","year":"2015","unstructured":"Mirabi, M.: A novel hybrid genetic algorithm for the multidepot periodic vehicle routing problem. Artif. Intell. Eng. Des. Anal. Manuf. 2(29), 45\u201354 (2015). https:\/\/doi.org\/10.1017\/S0890060414000328","journal-title":"Artif. Intell. Eng. Des. Anal. Manuf."},{"key":"9536_CR17","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1051\/ro:2006015","volume":"40","author":"M Mourgaya","year":"2006","unstructured":"Mourgaya, M., Vanderbeck, F.: The periodic vehicle routing problem: classification and heuristic. RAIRO Oper Res 40, 169\u2013194 (2006). https:\/\/doi.org\/10.1051\/ro:2006015","journal-title":"RAIRO Oper Res"},{"key":"9536_CR18","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10732-014-9244-3","volume":"20","author":"PK Nguyen","year":"2014","unstructured":"Nguyen, P.K., Crainic, T.G., Toulouse, M.: A hybrid generational genetic algorithm for the periodic vehicle routing problem with time windows. J Heurist 20, 383\u2013416 (2014). https:\/\/doi.org\/10.1007\/s10732-014-9244-3","journal-title":"J Heurist"},{"issue":"62","key":"9536_CR19","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.measurement.2014.10.024","volume":"2","author":"N Norouzi","year":"2015","unstructured":"Norouzi, N., Sadegh-Amalnick, M., Alinaghiyan, M.: Evaluating of the particle swarm optimization in a periodic vehicle routing problem. Measurement 2(62), 162\u2013169 (2015). https:\/\/doi.org\/10.1016\/j.measurement.2014.10.024","journal-title":"Measurement"},{"key":"9536_CR20","doi-asserted-by":"publisher","first-page":"155","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, 155\u2013162 (2004). https:\/\/doi.org\/10.1016\/S0305-0548(03)00158-8","journal-title":"Comput. Oper. Res."},{"key":"9536_CR21","first-page":"359","volume":"18","author":"K Pulji\u0107","year":"2013","unstructured":"Pulji\u0107, K., Manger, R.: Comparison of eight evolutionary crossover operators for the vehicle routing problem. Math Commun 18, 359\u2013375 (2013)","journal-title":"Math Commun"},{"issue":"53","key":"9536_CR22","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.cor.2014.07.004","volume":"1","author":"A Rahimi-Vahed","year":"2015","unstructured":"Rahimi-Vahed, A., Crainic, T.G., Gendreau, M., Rei, W.: Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm. Comput. Oper. Res. 1(53), 9\u201323 (2015). https:\/\/doi.org\/10.1016\/j.cor.2014.07.004","journal-title":"Comput. Oper. Res."},{"key":"9536_CR23","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1016\/j.ejor.2018.08.032","volume":"273","author":"I Rodr\u00edguez-Mart\u00edn","year":"2019","unstructured":"Rodr\u00edguez-Mart\u00edn, I., Salazar-Gonz\u00e1lez, J.J., Yaman, H.: The periodic vehicle routing problem with driver consistency. Eur. J. Oper. Res. 273, 575\u2013584 (2019). https:\/\/doi.org\/10.1016\/j.ejor.2018.08.032","journal-title":"Eur. J. Oper. Res."},{"issue":"53","key":"9536_CR24","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1287\/trsc.2018.0855","volume":"5","author":"AK Rothenb\u00e4cher","year":"2019","unstructured":"Rothenb\u00e4cher, A.K.: Branch-and-price-and-cut for the periodic vehicle routing problem with flexible schedule structures. Transp. Sci. 5(53), 850\u2013866 (2019). https:\/\/doi.org\/10.1287\/trsc.2018.0855","journal-title":"Transp. Sci."},{"key":"9536_CR25","unstructured":"Syswerda, G.: Uniform crossover in genetic algorithms. Third Int Conf on Genetic Algorithms (1989);3"},{"key":"9536_CR26","doi-asserted-by":"publisher","first-page":"277","DOI":"10.5267\/j.ijiec.2021.10.001","volume":"13","author":"SE Vega-Figueroa","year":"2022","unstructured":"Vega-Figueroa, S.E., L\u00f3pez-Becerra, P.A., L\u00f3pez-Santana, E.R.: Hybrid algorithm for the solution of the periodic vehicle routing problem with variable service frequency. Int. J. Ind. Eng. Comput. 13, 277\u2013292 (2022). https:\/\/doi.org\/10.5267\/j.ijiec.2021.10.001","journal-title":"Int. J. Ind. Eng. Comput."},{"issue":"286","key":"9536_CR27","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/j.ejor.2019.10.010","volume":"10","author":"T Vidal","year":"2020","unstructured":"Vidal, T., Laporte, G., Matl, P.: A concise guide to existing and emerging vehicle routing problem variants. Eur. J. Oper. Res. 10(286), 401\u2013416 (2020). https:\/\/doi.org\/10.1016\/j.ejor.2019.10.010","journal-title":"Eur. J. Oper. Res."},{"issue":"153","key":"9536_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2023.106189","volume":"5","author":"BS Vieira","year":"2023","unstructured":"Vieira, B.S., Ribeiro, G.M., Bahiense, L.: Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem. Comput. Oper. Res. 5(153), 106189 (2023). https:\/\/doi.org\/10.1016\/j.cor.2023.106189","journal-title":"Comput. Oper. Res."},{"issue":"50","key":"9536_CR29","doi-asserted-by":"publisher","first-page":"4732","DOI":"10.1109\/TSMC.2018.2861879","volume":"11","author":"J Wang","year":"2018","unstructured":"Wang, J., Ren, W., Zhang, Z., Huang, H., Zhou, Y.: A hybrid multiobjective memetic algorithm for multiobjective periodic vehicle routing problem with time windows. IEEE Trans Syst Man Cybernet Syst 11(50), 4732\u20134745 (2018). https:\/\/doi.org\/10.1109\/TSMC.2018.2861879","journal-title":"IEEE Trans Syst Man Cybernet Syst"},{"issue":"55","key":"9536_CR30","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100675","volume":"6","author":"Y Wang","year":"2020","unstructured":"Wang, Y., Wang, L., Chen, G., Cai, Z., Zhou, Y., Xing, L.: An improved ant colony optimization algorithm to the periodic vehicle routing problem with time window and service choice. Swarm Evol Comput 6(55), 100675 (2020). https:\/\/doi.org\/10.1016\/j.swevo.2020.100675","journal-title":"Swarm Evol Comput"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-024-09536-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-024-09536-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-024-09536-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,8]],"date-time":"2025-03-08T13:17:29Z","timestamp":1741439849000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-024-09536-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,18]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,3]]}},"alternative-id":["9536"],"URL":"https:\/\/doi.org\/10.1007\/s10732-024-09536-z","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2025,1,18]]},"assertion":[{"value":"29 January 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 October 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"7"}}