{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:27:49Z","timestamp":1772119669496,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T00:00:00Z","timestamp":1650585600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T00:00:00Z","timestamp":1650585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s10732-022-09497-1","type":"journal-article","created":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T05:18:26Z","timestamp":1650604706000},"page":"351-375","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["A memetic algorithm for the inventory routing problem"],"prefix":"10.1007","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7814-6443","authenticated-orcid":false,"given":"Mohamed Salim Amri","family":"Sakhri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mounira","family":"Tlili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ouajdi","family":"Korbaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,22]]},"reference":[{"key":"9497_CR1","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/7430125","author":"H Abid","year":"2017","unstructured":"Abid, H., Yousaf-Shad, M., Nauman, S., Ijaz, H., Alaa, M., Showkat, G.: Genetic algorithm for traveling salesman problem with modified cycle crossover operator. Comput. Intell. Neurosci. (2017). https:\/\/doi.org\/10.1155\/2017\/7430125","journal-title":"Comput. Intell. Neurosci."},{"key":"9497_CR2","doi-asserted-by":"publisher","DOI":"10.1007\/s41060-021-00280-2","author":"MS Amri Sakhri","year":"2021","unstructured":"Amri Sakhri, M.S.: Comparative analysis of different crossover structures for solving a periodic inventory routing problem. Int. J. Data Sci. Anal. (2021). https:\/\/doi.org\/10.1007\/s41060-021-00280-2","journal-title":"Int. J. Data Sci. Anal."},{"key":"9497_CR3","unstructured":"Amri Sakhri, M.S., Tlili, M., Allaoui, H., Korbaa, O.: Order crossover for the inventory routing problem. In: European Symposium on Artificial Neural Networks, pp. 697\u2013702. Bruges, Belgium (2018)"},{"key":"9497_CR4","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1287\/trsc.1060.0188","volume":"41","author":"C Archetti","year":"2007","unstructured":"Archetti, C., Bertazzi, L., Laporte, G., Speranza, M.G.: A branch-and-cut algorithm for a vendor-managed inventory-routing problem. Transp. Sci. 41, 382\u2013391 (2007). https:\/\/doi.org\/10.1287\/trsc.1060.0188","journal-title":"Transp. Sci."},{"key":"9497_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/ijoc.1100.0439","volume":"24","author":"C Archetti","year":"2012","unstructured":"Archetti, C., Bertazzi, L., Hertz, A., Speranza, M.G.: A hybrid heuristic for an inventory routing problem. INFORMS J. Comput. 24, 101\u2013116 (2012). https:\/\/doi.org\/10.1287\/ijoc.1100.0439","journal-title":"INFORMS J. Comput."},{"key":"9497_CR6","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.cie.2016.12.019","volume":"104","author":"A Azadeh","year":"2017","unstructured":"Azadeh, A., Elahi, S., Farahani, M.H., Nasirian, B.: A genetic algorithm-Taguchi based approach to inventory routing problem of a single perishable product with transshipment. Comput. Ind. Eng. 104, 124\u2013133 (2017). https:\/\/doi.org\/10.1016\/j.cie.2016.12.019","journal-title":"Comput. Ind. Eng."},{"key":"9497_CR7","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.asoc.2018.11.029","volume":"75","author":"A Baniamerian","year":"2019","unstructured":"Baniamerian, A., Bashiri, M., Tavakkoli-Moghaddam, R.: Modified variable neighborhood search and genetic algorithm for profitable heterogeneous vehicle routing problem with cross-docking. Appl. Soft Comput. 75, 441\u2013460 (2019). https:\/\/doi.org\/10.1016\/j.asoc.2018.11.029","journal-title":"Appl. Soft Comput."},{"issue":"6","key":"9497_CR8","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/inte.13.6.4","volume":"13","author":"WJ Bell","year":"1983","unstructured":"Bell, W.J., Dalberto, L.M., Fisher, M.L., Greeneld, A.J., Jaikumar, R., Kedia, P., Mack, R.G., Prutzman, P.J.: Improving the distribution of industrial gases with an on-line computerized routing and scheduling optimizer. Interfaces 13(6), 4\u201323 (1983). https:\/\/doi.org\/10.1287\/inte.13.6.4","journal-title":"Interfaces"},{"key":"9497_CR9","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1287\/trsc.36.3.314.7828","volume":"36","author":"L Bertazzi","year":"2002","unstructured":"Bertazzi, L., Speranza, M.G.: Continuous and discrete shipping strategies for the single link problem. Transp. Sci. 36, 314\u2013325 (2002). https:\/\/doi.org\/10.1287\/trsc.36.3.314.7828","journal-title":"Transp. Sci."},{"key":"9497_CR10","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/trsc.36.1.119.573","volume":"36","author":"L Bertazzi","year":"2002","unstructured":"Bertazzi, L., Paletta, G., Speranza, M.G.: Deterministic order-up-to level policies in an inventory routing problem. Transp. Sci. 36, 119\u2013132 (2002). https:\/\/doi.org\/10.1287\/trsc.36.1.119.573","journal-title":"Transp. Sci."},{"key":"9497_CR11","doi-asserted-by":"publisher","first-page":"112833","DOI":"10.1016\/j.eswa.2019.112833","volume":"138","author":"RM Chen","year":"2019","unstructured":"Chen, R.M., Shen, Y.M., Hong, W.Z.: Neural-like encoding particle swarm optimization for periodic vehicle routing problems. Expert Syst. Appl. 138, 112833 (2019). https:\/\/doi.org\/10.1016\/j.eswa.2019.112833","journal-title":"Expert Syst. Appl."},{"key":"9497_CR12","doi-asserted-by":"publisher","first-page":"3651","DOI":"10.1080\/00207543.2014.986299","volume":"53","author":"LC Coelho","year":"2015","unstructured":"Coelho, L.C., Laporte, G.: An optimized target level inventory replenishment policy for vendor managed inventory systems. Int. J. Prod. Res. 53, 3651\u20133660 (2015). https:\/\/doi.org\/10.1080\/00207543.2014.986299","journal-title":"Int. J. Prod. Res."},{"key":"9497_CR13","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/3019523","author":"PLNU Cooray","year":"2017","unstructured":"Cooray, P.L.N.U., Thashika, D.R.: Machine learning-based parameter tuned genetic algorithm for energy minimizing vehicle routing problem. J. Ind. Eng. (2017). https:\/\/doi.org\/10.1155\/2017\/3019523","journal-title":"J. Ind. Eng."},{"key":"9497_CR14","doi-asserted-by":"publisher","first-page":"107649","DOI":"10.1016\/j.cie.2021.107649","volume":"161","author":"Y Ece","year":"2021","unstructured":"Ece, Y., Saadettin, E.K.: Multi-trip heterogeneous vehicle routing problem coordinated with production scheduling: memetic algorithm and simulated annealing approaches. Comput. Ind. Eng. 161, 107649 (2021). https:\/\/doi.org\/10.1016\/j.cie.2021.107649","journal-title":"Comput. Ind. Eng."},{"issue":"3","key":"9497_CR15","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1016\/j.ejor.2020.08.047","volume":"290","author":"M Eleftherios","year":"2021","unstructured":"Eleftherios, M., Panagiotis, R., Emmanouil, Z., Christos, T.: Improved branch-and-cut for the Inventory Routing Problem based on a two-commodity flow formulation. Eur. J. Oper. Res. 290(3), 870\u2013885 (2021). https:\/\/doi.org\/10.1016\/j.ejor.2020.08.047","journal-title":"Eur. J. Oper. Res."},{"key":"9497_CR16","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/j.eswa.2018.09.002","volume":"116","author":"K Fardi","year":"2019","unstructured":"Fardi, K., Ghoushchi, S.J., Hafezalkotob, A.: An extended robust approach for a cooperative inventory routing problem. Expert Syst. Appl. 116, 310\u2013327 (2019). https:\/\/doi.org\/10.1016\/j.eswa.2018.09.002","journal-title":"Expert Syst. Appl."},{"key":"9497_CR17","doi-asserted-by":"publisher","first-page":"105371","DOI":"10.1016\/j.cor.2021.105371","volume":"134","author":"\u00d6T Gizem","year":"2021","unstructured":"Gizem, \u00d6.T., Esra, K., Hande, Y.: An exact solution approach for the inventory routing problem with time windows. Comput. Oper. Res. 134, 105371 (2021). https:\/\/doi.org\/10.1016\/j.cor.2021.105371","journal-title":"Comput. Oper. Res."},{"key":"9497_CR18","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.cie.2018.06.036","volume":"123","author":"A Gruler","year":"2018","unstructured":"Gruler, A., Panadero, J., Armas, J., Moreno-P\u00e9rez, J.A., Juan, A.A.: Combining variable neighborhood search with simulation for the inventory routing problem with stochastic demands and stock-outs. Comput. Ind. Eng. 123, 278\u2013288 (2018). https:\/\/doi.org\/10.1016\/j.cie.2018.06.036","journal-title":"Comput. Ind. Eng."},{"key":"9497_CR19","doi-asserted-by":"publisher","first-page":"1410","DOI":"10.1016\/j.cor.2012.09.010","volume":"40","author":"M Hewitt","year":"2013","unstructured":"Hewitt, M., Nemhauser, G., Savelsbergh, M., Song, J.H.: A branch-and-price guided search approach to maritime inventory routing. Comput. Oper. Res. 40, 1410\u20131419 (2013). https:\/\/doi.org\/10.1016\/j.cor.2012.09.010","journal-title":"Comput. Oper. Res."},{"key":"9497_CR20","doi-asserted-by":"publisher","first-page":"2327","DOI":"10.1007\/s10845-018-1393-z","volume":"30","author":"H Jahangir","year":"2019","unstructured":"Jahangir, H., Mohammadi, M., Pasandideh Reza, S.H., Neda, Z.N.: Comparing performance of genetic and discrete invasive weed optimization algorithms for solving the inventory routing problem with an incremental delivery. J. Intell. Manuf. 30, 2327\u20132353 (2019). https:\/\/doi.org\/10.1007\/s10845-018-1393-z","journal-title":"J. Intell. Manuf."},{"issue":"3","key":"9497_CR21","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1051\/ro:2008021","volume":"42","author":"N Labadi","year":"2008","unstructured":"Labadi, N., Prins, C., Reghioui, M.: A memetic algorithm for the vehicle routing problem with time windows. RAIRO Oper. Res. 42(3), 415\u2013431 (2008). https:\/\/doi.org\/10.1051\/ro:2008021","journal-title":"RAIRO Oper. Res."},{"key":"9497_CR22","doi-asserted-by":"publisher","first-page":"100802","DOI":"10.1016\/j.swevo.2020.100802","volume":"60","author":"A Mahdi","year":"2021","unstructured":"Mahdi, A., Erfan, B.T., Zahra, K.D., Seyed, R.H., Weiping, D.: An augmented Tabu search algorithm for the green inventory-routing problem with time windows. Swarm Evolut. Comput. 60, 100802 (2021). https:\/\/doi.org\/10.1016\/j.swevo.2020.100802","journal-title":"Swarm Evolut. Comput."},{"key":"9497_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.susoc.2021.08.002","volume":"3","author":"M Meysam","year":"2021","unstructured":"Meysam, M., Seyed, S.F., Soodabeh, M., Leyla, S.T., Mirpouya, M.: A modified adaptive genetic algorithm for multi-product multi-period inventory routing problem. Sustain. Oper. Comput. 3, 1\u20139 (2021). https:\/\/doi.org\/10.1016\/j.susoc.2021.08.002","journal-title":"Sustain. Oper. Comput."},{"key":"9497_CR24","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.cie.2015.05.010","volume":"87","author":"S Mirzaei","year":"2015","unstructured":"Mirzaei, S., Seifi, A.: Genetic algorithm for traveling salesman problem with modified cycle crossover operator. Comput. Ind. Eng. 87, 213\u2013227 (2015). https:\/\/doi.org\/10.1016\/j.cie.2015.05.010","journal-title":"Comput. Ind. Eng."},{"key":"9497_CR25","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.cor.2013.06.006","volume":"52","author":"A Mjirda","year":"2014","unstructured":"Mjirda, A., Jarboui, B., Macedo, R., Hanafi, S., Mladenovic, N.: A two phase variable neighborhood search for the multi-product inventory routing problem. Comput. Oper. Res. 52, 291\u2013299 (2014). https:\/\/doi.org\/10.1016\/j.cor.2013.06.006","journal-title":"Comput. Oper. Res."},{"issue":"11","key":"9497_CR26","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997). https:\/\/doi.org\/10.1016\/S0305-0548(97)00031-2","journal-title":"Comput. Oper. Res."},{"key":"9497_CR27","doi-asserted-by":"publisher","first-page":"113379","DOI":"10.1016\/j.eswa.2020.113379","volume":"157","author":"JC Molina","year":"2020","unstructured":"Molina, J.C., Salmeron, J.L., Eguia, I.: An ACS-based memetic algorithm for the heterogeneous vehicle routing problem with time windows. Expert Syst. Appl. 157, 113379 (2020). https:\/\/doi.org\/10.1016\/j.eswa.2020.113379","journal-title":"Expert Syst. Appl."},{"key":"9497_CR28","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/s10479-021-04122-z","volume":"307","author":"MO Olgun","year":"2021","unstructured":"Olgun, M.O., Aydemir, E.: A new cooperative depot sharing approach for inventory routing problem. Ann. Oper. Res. 307, 417\u2013441 (2021). https:\/\/doi.org\/10.1007\/s10479-021-04122-z","journal-title":"Ann. Oper. Res."},{"key":"9497_CR29","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.eswa.2016.01.041","volume":"53","author":"Y Park","year":"2016","unstructured":"Park, Y., Yoo, J., Park, H.: A genetic algorithm for the vendor-managed in ventory routing problem with lost sales. Expert Syst. Appl. 53, 149\u2013159 (2016). https:\/\/doi.org\/10.1016\/j.eswa.2016.01.041","journal-title":"Expert Syst. Appl."},{"key":"9497_CR30","doi-asserted-by":"publisher","unstructured":"Prasetyo, H., Putri, A.L., Fauza, G.: Biased random key genetic algorithm design with multiple populations to solve capacitated vehicle routing problem with time windows. In: Proceedings AIP Conference (2018). https:\/\/doi.org\/10.1063\/1.5042908","DOI":"10.1063\/1.5042908"},{"issue":"12","key":"9497_CR31","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). https:\/\/doi.org\/10.1016\/S0305-0548(03)00158-8","journal-title":"Comput. Oper. Res."},{"key":"9497_CR32","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1016\/j.eswa.2013.07.100","volume":"41","author":"L Qin","year":"2014","unstructured":"Qin, L., Miao, L., Ruan, Q., Zhang, Y.: A local search method for periodic inventory routing problem. Expert Syst. Appl. 41, 765\u2013778 (2014). https:\/\/doi.org\/10.1016\/j.eswa.2013.07.100","journal-title":"Expert Syst. Appl."},{"key":"9497_CR33","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/j.tre.2018.10.006","volume":"120","author":"H Rau","year":"2018","unstructured":"Rau, H., Budiman, S.D., Widyadana, G.A.: Optimization of the multi-objective green cyclical inventory routing problem using discrete multi-swarm PSO method. Transp. Res. Part E Logist. Transp. Rev. 120, 51\u201375 (2018). https:\/\/doi.org\/10.1016\/j.tre.2018.10.006","journal-title":"Transp. Res. Part E Logist. Transp. Rev."},{"key":"9497_CR34","doi-asserted-by":"publisher","first-page":"100730","DOI":"10.1016\/j.swevo.2020.100730","volume":"58","author":"NR Sabar","year":"2020","unstructured":"Sabar, N.R., Bhaskar, A., Chung, E., Turky, A., Song, A.: An adaptive memetic approach for heterogeneous vehicle routing problems with two-dimensional loading constraints. Swarm Evolut Comput 58, 100730 (2020). https:\/\/doi.org\/10.1016\/j.swevo.2020.100730","journal-title":"Swarm Evolut Comput"},{"key":"9497_CR35","doi-asserted-by":"publisher","DOI":"10.1007\/s12351-019-00543-8","author":"I Sbai","year":"2020","unstructured":"Sbai, I., Krichen, S., Limam, O.: Two meta-heuristics for solving the capacitated vehicle routing problem: the case of the Tunisian Post Office. Oper. Res. (2020). https:\/\/doi.org\/10.1007\/s12351-019-00543-8","journal-title":"Oper. Res."},{"key":"9497_CR36","doi-asserted-by":"publisher","unstructured":"Tin\u00f3s R, Helsgaun K, Whitley D (2018) Efficient recombination in the Lin\u2013Kernighan\u2013Helsgaun traveling salesman heuristic. In: International Conference on Parallel Problem Solving from Nature, pp. 95\u2013107. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-99253-2_8","DOI":"10.1007\/978-3-319-99253-2_8"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-022-09497-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10732-022-09497-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-022-09497-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,30]],"date-time":"2022-04-30T04:06:21Z","timestamp":1651291581000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10732-022-09497-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,22]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["9497"],"URL":"https:\/\/doi.org\/10.1007\/s10732-022-09497-1","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-848529\/v1","asserted-by":"object"}]},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,22]]},"assertion":[{"value":"25 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 December 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}