{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T16:15:18Z","timestamp":1770740118463,"version":"3.49.0"},"reference-count":76,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T00:00:00Z","timestamp":1653868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T00:00:00Z","timestamp":1653868800000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s10479-022-04747-8","type":"journal-article","created":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T10:02:43Z","timestamp":1653904963000},"page":"757-788","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Hybrid partheno-genetic algorithm for multi-depot perishable food delivery problem with mixed time windows"],"prefix":"10.1007","volume":"354","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3768-500X","authenticated-orcid":false,"given":"Na","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7127-1102","authenticated-orcid":false,"given":"Guo","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,30]]},"reference":[{"issue":"1","key":"4747_CR1","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.cie.2013.11.006","volume":"67","author":"P Amorim","year":"2014","unstructured":"Amorim, P., & Almada-Lobo, B. (2014). The impact of food perishability issues in the vehicle routing problem. Computers and Industrial Engineering, 67(1), 223\u2013233.","journal-title":"Computers and Industrial Engineering"},{"issue":"13\u201314","key":"4747_CR2","doi-asserted-by":"crossref","first-page":"6536","DOI":"10.1016\/j.apm.2016.01.059","volume":"40","author":"H Bae","year":"2016","unstructured":"Bae, H., & Moon, I. (2016). Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles. Applied Mathematical Modelling, 40(13\u201314), 6536\u20136549.","journal-title":"Applied Mathematical Modelling"},{"key":"4747_CR3","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.asoc.2015.06.035","volume":"35","author":"M Barkaoui","year":"2015","unstructured":"Barkaoui, M., Berger, J., & Boukhtouta, A. (2015). Customer satisfaction in dynamic vehicle routing problem with time windows. Applied Soft Computing Journal, 35, 423\u2013432.","journal-title":"Applied Soft Computing Journal"},{"issue":"3","key":"4747_CR4","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1016\/j.jfoodeng.2004.02.045","volume":"70","author":"JM Belenguer","year":"2005","unstructured":"Belenguer, J. M., Benavent, E., & Mart\u00ednez, M. C. (2005). RutaRep: A computer package to design dispatching routes in the meat industry. Journal of Food Engineering, 70(3), 435\u2013445.","journal-title":"Journal of Food Engineering"},{"issue":"5","key":"4747_CR5","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/j.trc.2010.07.008","volume":"19","author":"A Bettinelli","year":"2011","unstructured":"Bettinelli, A., Ceselli, A., & Righini, G. (2011). A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transportation Research Part c: Emerging Technologies, 19(5), 723\u2013740.","journal-title":"Transportation Research Part c: Emerging Technologies"},{"issue":"4","key":"4747_CR6","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1287\/trsc.2018.0862","volume":"53","author":"N Bianchessi","year":"2019","unstructured":"Bianchessi, N., Drexl, M., & Irnich, S. (2019). The split delivery vehicle routing problem with time windows and customer inconvenience constraints. Transportation Science, 53(4), 1067\u20131084.","journal-title":"Transportation Science"},{"issue":"3","key":"4747_CR7","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1287\/trsc.2017.0778","volume":"52","author":"B Biesinger","year":"2018","unstructured":"Biesinger, B., Hu, B., & Raidl, G. R. (2018). A genetic algorithm in combination with a solution archive for solving the generalized vehicle routing problem with stochastic demands. Transportation Science, 52(3), 673\u2013690.","journal-title":"Transportation Science"},{"issue":"1","key":"4747_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10479-008-0487-y","volume":"180","author":"HC Brand\u00e3o de Oliveira","year":"2010","unstructured":"Brand\u00e3o de Oliveira, H. C., & Vasconcelos, G. C. (2010). A hybrid search method for the vehicle routing problem with time windows. Annals of Operations Research, 180(1), 125\u2013144.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"4747_CR9","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/s10700-012-9131-z","volume":"11","author":"J Brito","year":"2012","unstructured":"Brito, J., Martinez, F. J., Moreno, J. A., & Verdegay, J. L. (2012). Fuzzy optimization for distribution of frozen food with imprecise times. Fuzzy Optimization and Decision Making, 11(3), 337\u2013349.","journal-title":"Fuzzy Optimization and Decision Making"},{"issue":"1","key":"4747_CR10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10479-018-2988-7","volume":"271","author":"D Cattaruzza","year":"2018","unstructured":"Cattaruzza, D., Absi, N., & Feillet, D. (2018). Vehicle routing problems with multiple trips. Annals of Operations Research, 271(1), 127\u2013159.","journal-title":"Annals of Operations Research"},{"issue":"1\u20132","key":"4747_CR11","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s10479-017-2514-3","volume":"273","author":"C Chao","year":"2019","unstructured":"Chao, C., Zhihui, T., & Baozhen, Y. (2019). Optimization of two-stage location\u2013routing\u2013inventory problem with time-windows in food distribution network. Annals of Operations Research, 273(1\u20132), 111\u2013134.","journal-title":"Annals of Operations Research"},{"issue":"7","key":"4747_CR12","doi-asserted-by":"crossref","first-page":"2311","DOI":"10.1016\/j.cor.2008.09.010","volume":"36","author":"HK Chen","year":"2009","unstructured":"Chen, H. K., Hsueh, C. F., & Chang, M. S. (2009). Production scheduling and vehicle routing with time windows for perishable food products. Computers and Operations Research, 36(7), 2311\u20132319.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"4747_CR13","doi-asserted-by":"crossref","first-page":"7758","DOI":"10.1016\/j.eswa.2008.09.001","volume":"36","author":"CB Cheng","year":"2009","unstructured":"Cheng, C. B., & Wang, K. P. (2009). Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm. Expert Systems with Applications, 36(4), 7758\u20137763.","journal-title":"Expert Systems with Applications"},{"key":"4747_CR14","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02601637","volume":"63","author":"WC Chiang","year":"1996","unstructured":"Chiang, W. C., & Russell, R. A. (1996). Simulated annealing metaheuristics for the vehicle routing problem with time windows. Annals of Operations Research, 63, 3\u201327.","journal-title":"Annals of Operations Research"},{"issue":"12","key":"4747_CR15","doi-asserted-by":"crossref","first-page":"1298","DOI":"10.1057\/palgrave.jors.2601791","volume":"55","author":"WC Chiang","year":"2004","unstructured":"Chiang, W. C., & Russell, R. A. (2004). A metaheuristic for the vehicle routing problem with soft time windows. Journal of Operational Research Society., 55(12), 1298\u20131310.","journal-title":"Journal of Operational Research Society."},{"issue":"1","key":"4747_CR16","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1109\/TSMCB.2011.2164245","volume":"42","author":"I Ciornei","year":"2011","unstructured":"Ciornei, I., & Kyriakides, E. (2011). Hybrid ant colony-genetic algorithm (GAAPI) for global continuous optimization. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 42(1), 234\u2013245.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)"},{"issue":"8","key":"4747_CR17","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"JF Cordeau","year":"2001","unstructured":"Cordeau, J. F., Laporte, G., & Mercier, A. (2001). A unified tabu search heuristic for vehicle routing problems with time windows. Journal of the Operational Research Society, 52(8), 928\u2013936.","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"4747_CR18","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1287\/trsc.1120.0445","volume":"47","author":"S Dabia","year":"2012","unstructured":"Dabia, S., Ropke, S., van Woensel, T., & De Kok, T. (2012). Branch and price for the time-dependent vehicle routing problem with time windows. Transportation Science, 47(3), 380\u2013396.","journal-title":"Transportation Science"},{"issue":"3","key":"4747_CR19","doi-asserted-by":"crossref","first-page":"1478","DOI":"10.1016\/j.ejor.2004.07.077","volume":"176","author":"R Dondo","year":"2007","unstructured":"Dondo, R., & Cerd\u00e1, J. (2007). A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows. European Journal of Operational Research, 176(3), 1478\u20131507.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"4747_CR20","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., & Colorni, A. (1996). Ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 26(1), 29\u201341.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics)"},{"key":"4747_CR21","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/j.ijpe.2017.12.003","volume":"196","author":"Y Feng","year":"2018","unstructured":"Feng, Y., Li, G., & Sethi, S. P. (2018). A three-layer chromosome genetic algorithm for multi-cell scheduling with flexible routes and machine sharing. International Journal of Production Economics, 196, 269\u2013283.","journal-title":"International Journal of Production Economics"},{"issue":"5","key":"4747_CR22","doi-asserted-by":"crossref","first-page":"668","DOI":"10.1016\/j.trc.2009.08.005","volume":"18","author":"MA Figliozzi","year":"2010","unstructured":"Figliozzi, M. A. (2010). An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows. Transportation Research Part c: Emerging Technologies, 18(5), 668\u2013679.","journal-title":"Transportation Research Part c: Emerging Technologies"},{"issue":"5","key":"4747_CR23","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1057\/palgrave.jors.2602371","volume":"59","author":"Z Fu","year":"2007","unstructured":"Fu, Z., Eglese, R., & Li, L. Y. (2007). A unified tabu search algorithm for vehicle routing problems with soft time windows. Journal of the Operational Research Society, 59(5), 663\u2013673.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"4747_CR24","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1287\/trsc.2015.0593","volume":"50","author":"R Fukasawa","year":"2015","unstructured":"Fukasawa, R., He, Q., & Song, Y. (2015). A branch-cut-and-price algorithm for the energy minimization vehicle routing problem. Transportation Science, 50(1), 23\u201334.","journal-title":"Transportation Science"},{"key":"4747_CR25","volume-title":"Vehicle routing: Methods and studies","author":"BL Golden","year":"1988","unstructured":"Golden, B. L., & Assad, A. A. (1988). Vehicle routing: Methods and studies. North-Holland."},{"key":"4747_CR26","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.ijpe.2013.12.028","volume":"152","author":"K Govindan","year":"2014","unstructured":"Govindan, K., Jafarian, A., Khodaverdi, R., & Devika, K. (2014). Two-echelon multiple-vehicle location-routing problem with time windows for optimization of sustainable supply chain network of perishable food. International Journal of Production Economics, 152, 9\u201328.","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"4747_CR27","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10479-018-2938-4","volume":"275","author":"T Henke","year":"2019","unstructured":"Henke, T., Speranza, M. G., & W\u00e4scher, G. (2019). A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes. Annals of Operations Research, 275(2), 321\u2013338.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"4747_CR28","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/j.jfoodeng.2006.05.029","volume":"80","author":"CI Hsu","year":"2007","unstructured":"Hsu, C. I., Hung, S. F., & Li, H. C. (2007). Vehicle routing problem with time-windows for perishable food delivery. Journal of Food Engineering, 80(2), 465\u2013475.","journal-title":"Journal of Food Engineering"},{"issue":"1","key":"4747_CR29","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/s10479-018-3042-5","volume":"294","author":"YC Hsu","year":"2020","unstructured":"Hsu, Y. C., Walteros, J. L., & Batta, R. (2020). Solving the petroleum replenishment and routing problem with variable demands and time windows. Annals of Operations Research, 294(1), 9\u201346.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"4747_CR30","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1287\/trsc.2017.0775","volume":"53","author":"A H\u00fcbner","year":"2019","unstructured":"H\u00fcbner, A., & Ostermeier, M. (2019). A multi-compartment vehicle routing problem with loading and unloading costs. Transportation Science, 53(1), 282\u2013300.","journal-title":"Transportation Science"},{"issue":"3","key":"4747_CR31","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/j.aei.2008.02.001","volume":"22","author":"F Kang","year":"2008","unstructured":"Kang, F., Li jie, J., & Xu, Q. (2008). Virus coevolution partheno-genetic algorithms for optimal sensor placement. Advanced Engineering Informatics, 22(3), 362\u2013370.","journal-title":"Advanced Engineering Informatics"},{"issue":"1","key":"4747_CR33","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/s10479-021-04137-6","volume":"307","author":"F Kocat\u00fcrk","year":"2021","unstructured":"Kocat\u00fcrk, F., T\u00fct\u00fcnc\u00fc, G. Y., & Salhi, S. (2021). The multi-depot heterogeneous VRP with backhauls: Formulation and a hybrid VNS with GRAMPS meta-heuristic approach. Annals of Operations Research, 307(1), 277\u2013302.","journal-title":"Annals of Operations Research"},{"key":"4747_CR34","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-021-04145-6","author":"A Kohar","year":"2021","unstructured":"Kohar, A., & Jakhar, S. K. (2021). A capacitated multi pickup online food delivery problem with time windows: A branch-and-cut algorithm. Annals of Operations Research. https:\/\/doi.org\/10.1007\/s10479-021-04145-6","journal-title":"Annals of Operations Research"},{"issue":"4","key":"4747_CR35","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1002\/nav.21901","volume":"67","author":"W Kubiak","year":"2020","unstructured":"Kubiak, W., Feng, Y., Li, G., Sethi, S. P., & Sriskandarajah, C. (2020). Efficient algorithms for flexible job shop scheduling with parallel machines. Naval Research Logistics (NRL), 67(4), 272\u2013288.","journal-title":"Naval Research Logistics (NRL)"},{"issue":"3","key":"4747_CR36","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/s42524-020-0100-x","volume":"7","author":"F Kucuksayacigil","year":"2020","unstructured":"Kucuksayacigil, F., & Ulusoy, G. (2020). Hybrid genetic algorithm for bi-objective resource-constrained project scheduling. Frontiers of Engineering Management, 7(3), 426\u2013446.","journal-title":"Frontiers of Engineering Management"},{"issue":"8","key":"4747_CR37","doi-asserted-by":"crossref","first-page":"6949","DOI":"10.1016\/j.eswa.2012.01.024","volume":"39","author":"Y Kuo","year":"2012","unstructured":"Kuo, Y., & Wang, C. C. (2012). A variable neighborhood search for the multi-depot vehicle routing problem with loading cost. Expert Systems with Applications, 39(8), 6949\u20136954.","journal-title":"Expert Systems with Applications"},{"key":"4747_CR38","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1016\/j.ijpe.2018.10.010","volume":"206","author":"G Li","year":"2018","unstructured":"Li, G., Li, N., Sambandam, N., Sethi, S. P., & Zhang, F. (2018). Flow shop scheduling with jobs arriving at different times. International Journal of Production Economics, 206, 250\u2013260.","journal-title":"International Journal of Production Economics"},{"key":"4747_CR39","volume":"234","author":"G Li","year":"2021","unstructured":"Li, G., Wu, H., Sethi, S. P., & Zhang, X. (2021). Contracting green product supply chains considering marketing efforts in the circular economy era. International Journal of Production Economics, 234, 108041.","journal-title":"International Journal of Production Economics"},{"issue":"1","key":"4747_CR40","first-page":"61","volume":"19","author":"MJ Li","year":"2001","unstructured":"Li, M. J., Zhu, T. Y., & Tong, T. S. (2001). Comparison between partheno-genetic algorithm and traditional genetic algorithm. Systems Engineering, 19(1), 61\u201365.","journal-title":"Systems Engineering"},{"key":"4747_CR41","volume":"113","author":"L Liu","year":"2021","unstructured":"Liu, L., & Wang, T. (2021). An evolvable hardware method based on elite Partheno-Genetic Algorithm. Applied Soft Computing, 113, 107904.","journal-title":"Applied Soft Computing"},{"issue":"2","key":"4747_CR42","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s00291-012-0289-0","volume":"36","author":"R Liu","year":"2014","unstructured":"Liu, R., Jiang, Z., & Geng, N. (2014). A hybrid genetic algorithm for the multi-depot open vehicle routing problem. Or Spectrum, 36(2), 401\u2013421.","journal-title":"Or Spectrum"},{"issue":"3","key":"4747_CR43","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/j.tre.2008.10.003","volume":"45","author":"S Liu","year":"2009","unstructured":"Liu, S., Huang, W., & Ma, H. (2009). An effective genetic algorithm for the fleet size and mix vehicle routing problems. Transportation Research Part e: Logistics and Transportation Review, 45(3), 434\u2013445.","journal-title":"Transportation Research Part e: Logistics and Transportation Review"},{"issue":"6","key":"4747_CR44","doi-asserted-by":"crossref","first-page":"1463","DOI":"10.1287\/trsc.2017.0780","volume":"52","author":"FV Louveaux","year":"2018","unstructured":"Louveaux, F. V., & Salazar-Gonz\u00e1lez, J.-J. (2018). Exact approach for the vehicle routing problem with stochastic demands and preventive returns. Transportation Science, 52(6), 1463\u20131478.","journal-title":"Transportation Science"},{"key":"4747_CR45","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.cie.2014.03.004","volume":"72","author":"J Luo","year":"2014","unstructured":"Luo, J., & Chen, M. R. (2014). Multi-phase modified shuffled frog leaping algorithm with extremal optimization for the MDVRP and the MDVRPTW. Computers & Industrial Engineering, 72, 84\u201397.","journal-title":"Computers & Industrial Engineering"},{"issue":"1","key":"4747_CR46","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1007\/s10479-019-03218-x","volume":"291","author":"Z Mao","year":"2020","unstructured":"Mao, Z., Huang, D., Fang, K., Wang, C., & Lu, D. (2020). Milk-run routing problem with progress-lane in the collection of automobile parts. Annals of Operations Research, 291(1), 657\u2013684.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"4747_CR47","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1287\/trsc.2014.0558","volume":"49","author":"S Mouthuy","year":"2015","unstructured":"Mouthuy, S., Massen, F., Deville, Y., & Van Hentenryck, P. (2015). A multistage very large-scale neighborhood search for the vehicle routing problem with soft time windows. Transportation Science, 49(2), 223\u2013238.","journal-title":"Transportation Science"},{"issue":"10","key":"4747_CR48","doi-asserted-by":"crossref","first-page":"12086","DOI":"10.1016\/j.eswa.2009.04.023","volume":"36","author":"S Nemati","year":"2009","unstructured":"Nemati, S., Basiri, M. E., Ghasem-Aghaee, N., & Aghdam, M. H. (2009). A novel ACO\u2013GA hybrid algorithm for feature selection in protein function prediction. Expert Systems with Applications, 36(10), 12086\u201312094.","journal-title":"Expert Systems with Applications"},{"issue":"6","key":"4747_CR49","doi-asserted-by":"crossref","DOI":"10.1111\/exsy.12528","volume":"37","author":"AM Nogareda","year":"2020","unstructured":"Nogareda, A. M., Del Ser, J., Osaba, E., & Camacho, D. (2020). On the design of hybrid bio-inspired meta-heuristics for complex multiattribute vehicle routing problems. Expert Systems, 37(6), e12528.","journal-title":"Expert Systems"},{"key":"4747_CR50","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"IH Osman","year":"1993","unstructured":"Osman, I. H. (1993). Metastrategy simulated annealing and tabu search for combinatorial optimization problems. Annals of Operations Research, 41, 421\u2013451.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"4747_CR51","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.jfoodeng.2007.07.008","volume":"85","author":"A Osvald","year":"2008","unstructured":"Osvald, A., & Stirn, L. Z. (2008). A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food. Journal of Food Engineering, 85(2), 285\u2013295.","journal-title":"Journal of Food Engineering"},{"issue":"6","key":"4747_CR52","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/s10732-005-5432-5","volume":"10","author":"M Polacek","year":"2004","unstructured":"Polacek, M., Hartl, R. F., Doerner, K., & Reimann, M. (2004). A variable neighborhood search for the multi depot vehicle routing problem with time windows. Journal of Heuristics, 10(6), 613\u2013627.","journal-title":"Journal of Heuristics"},{"key":"4747_CR53","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/j.asoc.2013.10.017","volume":"15","author":"M Reed","year":"2014","unstructured":"Reed, M., Yiannakou, A., & Evering, R. (2014). An ant colony algorithm for the multi-compartment vehicle routing problem. Applied Soft Computing, 15, 169\u2013176.","journal-title":"Applied Soft Computing"},{"issue":"1","key":"4747_CR54","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1007\/s10479-018-2807-1","volume":"283","author":"F Sabouhi","year":"2019","unstructured":"Sabouhi, F., Bozorgi-Amiri, A., Moshref-Javadi, M., & Heydari, M. (2019). An integrated routing and scheduling model for evacuation and commodity distribution in large-scale disaster relief operations: A case study. Annals of Operations Research, 283(1), 643\u2013677.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"4747_CR55","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10479-017-2591-3","volume":"267","author":"RK Singh","year":"2018","unstructured":"Singh, R. K., Gunasekaran, A., & Kumar, P. (2018). Third party logistics (3PL) selection for cold chain management: A fuzzy AHP and fuzzy TOPSIS approach. Annals of Operations Research, 267(1), 531\u2013553.","journal-title":"Annals of Operations Research"},{"key":"4747_CR56","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/j.jfoodeng.2015.08.027","volume":"169","author":"BD Song","year":"2016","unstructured":"Song, B. D., & Ko, Y. D. (2016). A vehicle routing problem of both refrigerated- and general-type vehicles for perishable food products delivery. Journal of Food Engineering, 169, 61\u201371.","journal-title":"Journal of Food Engineering"},{"issue":"1","key":"4747_CR57","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1007\/s10479-019-03205-2","volume":"291","author":"X Song","year":"2020","unstructured":"Song, X., Jones, D., Asgari, N., & Pigden, T. (2020). Multi-objective vehicle routing and loading with time window constraints: A real-life application. Annals of Operations Research, 291(1), 799\u2013825.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"4747_CR58","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1109\/21.286385","volume":"24","author":"M Srinivas","year":"1994","unstructured":"Srinivas, M., & Patnaik, L. M. (1994). Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics, 24(4), 656\u2013667.","journal-title":"IEEE Transactions on Systems, Man, and Cybernetics"},{"key":"4747_CR59","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/s10479-021-04061-9","volume":"304","author":"N Tanoumand","year":"2021","unstructured":"Tanoumand, N., & \u00dcnl\u00fcyurt, T. (2021). An exact algorithm for the resource constrained home health care vehicle routing problem. Annals of Operations Research, 304, 397\u2013425.","journal-title":"Annals of Operations Research"},{"key":"4747_CR60","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s10479-020-03625-5","volume":"308","author":"A Tarhini","year":"2022","unstructured":"Tarhini, A., Danach, K., & Harfouche, A. (2022). Swarm intelligence-based hyper-heuristic for the vehicle routing problem with prioritized customers. Annals of Operations Research, 308, 549\u2013570.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"4747_CR61","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal, T., Crainic, T. G., Gendreau, M., Lahrichi, N., & Rei, W. (2012). A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Operations Research, 60(3), 611\u2013624.","journal-title":"Operations Research"},{"key":"4747_CR62","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1016\/j.ijepes.2014.12.037","volume":"67","author":"J Wang","year":"2015","unstructured":"Wang, J., Huang, W., Ma, G., & Chen, S. (2015). An improved partheno genetic algorithm for multi-objective economic dispatch in cascaded hydropower systems. International Journal of Electrical Power and Energy Systems, 67, 591\u2013597.","journal-title":"International Journal of Electrical Power and Energy Systems"},{"issue":"6","key":"4747_CR63","doi-asserted-by":"crossref","first-page":"7243","DOI":"10.1016\/j.eswa.2010.12.027","volume":"38","author":"L Wang","year":"2011","unstructured":"Wang, L., & Tang, D. B. (2011). An improved adaptive genetic algorithm based on hormone modulation mechanism for job-shop scheduling problem. Expert Systems with Applications, 38(6), 7243\u20137250.","journal-title":"Expert Systems with Applications"},{"issue":"7","key":"4747_CR64","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1177\/0037549715603481","volume":"92","author":"S Wang","year":"2016","unstructured":"Wang, S., Lu, Z., Wei, L., Ji, G., & Yang, J. (2016). Fitness-scaling adaptive genetic algorithm with local search for solving the Multiple Depot Vehicle Routing Problem. Simulation, 92(7), 601\u2013616.","journal-title":"Simulation"},{"key":"4747_CR65","doi-asserted-by":"crossref","first-page":"102607","DOI":"10.1109\/ACCESS.2020.2998539","volume":"8","author":"Z Wang","year":"2020","unstructured":"Wang, Z., Fang, X., Li, H., & Jin, H. (2020). An improved partheno-genetic algorithm with reproduction mechanism for the multiple traveling salesperson problem. IEEE Access, 8, 102607\u2013102615.","journal-title":"IEEE Access"},{"key":"4747_CR66","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1007\/s10479-021-04012-4","volume":"308","author":"X Wu","year":"2022","unstructured":"Wu, X., Li, R., Chu, C. H., Amoasi, R., & Liu, S. (2022). Managing pharmaceuticals delivery service using a hybrid particle swarm intelligence approach. Annals of Operations Research, 308, 653\u2013684.","journal-title":"Annals of Operations Research"},{"key":"4747_CR67","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-020-03599-4","author":"XH Xing","year":"2020","unstructured":"Xing, X. H., Hu, Z. H., & Luo, W. P. (2020). Using evolutionary game theory to study governments and logistics companies\u2019 strategies for avoiding broken cold chains. Annals of Operations Research. https:\/\/doi.org\/10.1007\/s10479-020-03599-4","journal-title":"Annals of Operations Research"},{"issue":"2","key":"4747_CR68","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1109\/TSG.2014.2382684","volume":"6","author":"H Yang","year":"2015","unstructured":"Yang, H., Yang, S., Xu, Y., Cao, E., Lai, M., & Dong, Z. (2015). Electric vehicle route optimization considering time-of-use electricity price by learnable partheno-genetic algorithm. IEEE Transactions on Smart Grid, 6(2), 657\u2013666.","journal-title":"IEEE Transactions on Smart Grid"},{"issue":"1\u20132","key":"4747_CR69","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/s10479-017-2531-2","volume":"273","author":"B Yao","year":"2019","unstructured":"Yao, B., Chen, C., Song, X., & Yang, X. (2019). Fresh seafood delivery routing problem using an improved ant colony optimization. Annals of Operations Research, 273(1\u20132), 163\u2013186.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"4747_CR70","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10479-015-1792-x","volume":"242","author":"B Yao","year":"2016","unstructured":"Yao, B., Yu, B., Hu, P., Gao, J., & Zhang, M. (2016). An improved particle swarm optimization for carton heterogeneous vehicle routing problem with a collection depot. Annals of Operations Research, 242(2), 303\u2013320.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"4747_CR71","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1057\/jors.2009.161","volume":"62","author":"B Yu","year":"2011","unstructured":"Yu, B., Yang, Z. Z., & Xie, J. X. (2011). A parallel improved ant colony optimization for multi-depot vehicle routing problem. Journal of the Operational Research Society, 62(1), 183\u2013188.","journal-title":"Journal of the Operational Research Society"},{"issue":"1","key":"4747_CR72","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.ejor.2008.02.028","volume":"196","author":"B Yu","year":"2009","unstructured":"Yu, B., Yang, Z. Z., & Yao, B. (2009). An improved ant colony optimization for vehicle routing problem. European Journal of Operational Research, 196(1), 171\u2013176.","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"4747_CR73","doi-asserted-by":"crossref","first-page":"11859","DOI":"10.1016\/j.eswa.2011.03.077","volume":"38","author":"GN Y\u00fccenur","year":"2011","unstructured":"Y\u00fccenur, G. N., & Demirel, N. \u00c7. (2011). A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem. Expert Systems with Applications, 38(9), 11859\u201311865.","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"4747_CR74","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s11831-021-09574-x","volume":"29","author":"H Zhang","year":"2022","unstructured":"Zhang, H., Ge, H., Yang, J., & Tong, Y. (2022). Review of vehicle routing problems: Models, classification and solving algorithms. Archives of Computational Methods in Engineering, 29(1), 195\u2013221.","journal-title":"Archives of Computational Methods in Engineering"},{"issue":"1\u20132","key":"4747_CR75","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1007\/s10479-017-2567-3","volume":"269","author":"S Zhang","year":"2018","unstructured":"Zhang, S., Gajpal, Y., & Appadoo, S. S. (2018). A meta-heuristic for capacitated green vehicle routing problem. Annals of Operations Research, 269(1\u20132), 753\u2013771.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"4747_CR76","doi-asserted-by":"crossref","first-page":"1127","DOI":"10.1007\/s10479-018-3071-0","volume":"291","author":"Y Zhang","year":"2020","unstructured":"Zhang, Y., Hua, G., Cheng, T. C. E., & Zhang, J. (2020). Cold chain distribution: How to deal with node and arc time windows? Annals of Operations Research, 291(1), 1127\u20131151.","journal-title":"Annals of Operations Research"},{"key":"4747_CR77","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/j.asoc.2017.12.031","volume":"64","author":"H Zhou","year":"2018","unstructured":"Zhou, H., Song, M., & Pedrycz, W. (2018). A comparative study of improved GA and PSO in solving multiple traveling salesmen problem. Applied Soft Computing, 64, 564\u2013580.","journal-title":"Applied Soft Computing"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04747-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-022-04747-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-022-04747-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T17:18:21Z","timestamp":1762276701000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-022-04747-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,30]]},"references-count":76,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["4747"],"URL":"https:\/\/doi.org\/10.1007\/s10479-022-04747-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,30]]},"assertion":[{"value":"28 March 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 May 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}