{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,16]],"date-time":"2026-06-16T04:28:56Z","timestamp":1781584136590,"version":"3.54.5"},"reference-count":51,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2021,1,19]],"date-time":"2021-01-19T00:00:00Z","timestamp":1611014400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This study aims to compare the results of a memetic algorithm with those of the two-phase decomposition heuristic on the external depot production routing problem in a supply chain. We have modified the classical scheme of a genetic algorithm by replacing the mutation operator by three local search algorithms. The first local search consists in exchanging two customers visited the same day. The second consists in trying an exchange between two customers visited at consecutive periods and the third consists in removing a customer from his current tour for a better insertion in any tour of the same period. The tests that were carried out on 128 instances of the literature have highlighted the effectiveness of the memetic algorithm developed in this work compared to the two-phase decomposition heuristic. This is reflected by the fact that the results obtained by the memetic algorithm lead to a reduction in the overall average cost of production, inventory, and transport, ranging from 3.65% to 16.73% with an overall rate of 11.07% with regard to the results obtained with the two-phase decomposition heuristic. The outcomes will be beneficial to researchers and supply chain managers in the choice and development of heuristics and metaheuristics for the resolution of production routing problem.<\/jats:p>","DOI":"10.3390\/a14010027","type":"journal-article","created":{"date-parts":[[2021,1,19]],"date-time":"2021-01-19T04:55:31Z","timestamp":1611032131000},"page":"27","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Memetic Algorithm for an External Depot Production Routing Problem"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0306-5710","authenticated-orcid":false,"given":"Bi Koua\u00ef Bertin","family":"Kay\u00e9","sequence":"first","affiliation":[{"name":"Laboratoire de Recherche en Informatique et T\u00e9l\u00e9communication, Institut National Polytechnique F\u00e9lix Houphou\u00ebt-Boigny, Yamoussoukro, Cote d\u2019Ivoire"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6457-7584","authenticated-orcid":false,"given":"Moustapha","family":"Diaby","sequence":"additional","affiliation":[{"name":"Laboratoire des Sciences et Technologies de l\u2019Information et de la Communication, \u00c9cole Sup\u00e9rieure Africaine des TIC, Abidjan, Cote d\u2019Ivoire"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moussa","family":"Koivogui","sequence":"additional","affiliation":[{"name":"Laboratoire des Sciences et Technologies de l\u2019Information et de la Communication, \u00c9cole Sup\u00e9rieure Africaine des TIC, Abidjan, Cote d\u2019Ivoire"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Souleymane","family":"Oumtanaga","sequence":"additional","affiliation":[{"name":"Laboratoire de Recherche en Informatique et T\u00e9l\u00e9communication, Institut National Polytechnique F\u00e9lix Houphou\u00ebt-Boigny, Yamoussoukro, Cote d\u2019Ivoire"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2021,1,19]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.cor.2014.01.011","article-title":"The production routing problem: A review of formulations and solution algorithms","volume":"55","author":"Adulyasak","year":"2015","journal-title":"Comput. Oper. Res."},{"key":"ref_2","unstructured":"Pochet, Y., and Wolsey, L.A. (2006). Production Planning by Mixed Integer Programming, Springer."},{"key":"ref_3","unstructured":"Garey, M.R., and Johnson, D.S. (1990). Computers and Intractability; A Guide to the Theory of NP-Completeness, W.H. Freeman & Co."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","article-title":"Complexity of vehicle routing and scheduling problems","volume":"11","author":"Lenstra","year":"1981","journal-title":"Networks"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","article-title":"The vehicle routing problem: State of the art classification and review","volume":"99","author":"Braekers","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1016\/j.cie.2009.05.009","article-title":"The vehicle routing problem: A taxonomic review","volume":"57","author":"Eksioglu","year":"2009","journal-title":"Comput. Ind. Eng."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.cie.2014.10.029","article-title":"A literature review on the vehicle routing problem with multiple depots","volume":"79","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1057\/jors.1993.117","article-title":"A dynamic distribution model with warehouse and customer replenishment requirements","volume":"44","author":"Chandra","year":"1993","journal-title":"J. Oper. Res. Soc."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/0377-2217(94)90419-7","article-title":"Coordination of production and distribution planning","volume":"72","author":"Chandra","year":"1994","journal-title":"Eur. J. Oper. Res."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1287\/ijoc.2016.0737","article-title":"A Matheuristic for the Multivehicle Inventory Routing Problem","volume":"29","author":"Archetti","year":"2017","journal-title":"Inf. J. Comput."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1111\/itor.12226","article-title":"The inventory routing problem: The value of integration: The inventory routing problem: The value of integration","volume":"23","author":"Archetti","year":"2016","journal-title":"Int. Trans. Oper. Res."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s13676-012-0016-7","article-title":"Inventory routing problems: An introduction","volume":"1","author":"Bertazzi","year":"2012","journal-title":"EURO J. Transp. Logist."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.2013.0472","article-title":"Thirty Years of Inventory Routing","volume":"48","author":"Coelho","year":"2014","journal-title":"Transp. Sci."},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/trsc.33.3.330","article-title":"Synchronized Development of Production, Inventory, and Distribution Schedules","volume":"33","author":"Fumero","year":"1999","journal-title":"Transp. Sci."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"2202","DOI":"10.1016\/j.cor.2010.03.010","article-title":"A branch-and-price algorithm for an integrated production and inventory routing problem","volume":"37","author":"Bard","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1731","DOI":"10.1016\/j.cor.2011.03.002","article-title":"Analysis of the maximum level policy in a production-distribution system","volume":"38","author":"Archetti","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/ijoc.2013.0550","article-title":"Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems","volume":"26","author":"Adulyasak","year":"2014","journal-title":"Inf. J. Comput."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1080\/07408170600862688","article-title":"On the integrated production, inventory, and distribution routing problem","volume":"38","author":"Lei","year":"2006","journal-title":"IIE Trans."},{"key":"ref_19","first-page":"321","article-title":"Managing an External Depot in a Production Routing Problem","volume":"11","author":"Diaby","year":"2020","journal-title":"IJACSA"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1016\/j.renene.2018.11.061","article-title":"Research and application based on the swarm intelligence algorithm and artificial intelligence for wind farm decision system","volume":"134","author":"Zhao","year":"2019","journal-title":"Renew. Energy"},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1016\/j.compeleceng.2017.09.016","article-title":"A bio-inspired swarm intelligence technique for social aware cognitive radio handovers","volume":"71","author":"Anandakumar","year":"2018","journal-title":"Comput. Electr. Eng."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Brezo\u010dnik, L., Fister, I., and Podgorelec, V. (2018). Swarm Intelligence Algorithms for Feature Selection: A Review. Appl. Sci., 8.","DOI":"10.3390\/app8091521"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1109\/TII.2017.2786782","article-title":"Nature Inspired Methods and Their Industry Applications\u2014Swarm Intelligence Algorithms","volume":"14","author":"Slowik","year":"2018","journal-title":"IEEE Trans. Ind. Inf."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"5155","DOI":"10.1080\/00207543.2019.1701209","article-title":"Multi-objective particle swarm optimisation based integrated production inventory routing planning for efficient perishable food logistics operations","volume":"58","author":"Chan","year":"2020","journal-title":"Int. J. Prod. Res."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Dulebenets, M.A., Kavoosi, M., Abioye, O., and Pasha, J. (2018). A Self-Adaptive Evolutionary Algorithm for the Berth Scheduling Problem: Towards Efficient Parameter Control. Algorithms, 11.","DOI":"10.3390\/a11070100"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"134743","DOI":"10.1109\/ACCESS.2020.3010176","article-title":"An Optimization Model and Solution Algorithms for the Vehicle Routing Problem With a \u201cFactory-in-a-Box\u201d","volume":"8","author":"Pasha","year":"2020","journal-title":"IEEE Access"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Mak, K.L. (1995, January 12\u201314). Design of integrated production-inventory-distribution systems using genetic algorithm. Proceedings of the 1st International Conference on Genetic Algorithms in Engineering Systems: Innovations and Applications (GALESIA), Sheffield, UK.","DOI":"10.1049\/cp:19951091"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/j.omega.2004.05.004","article-title":"A hybrid genetic algorithm for production and distribution","volume":"33","author":"Chan","year":"2005","journal-title":"Omega"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"3402","DOI":"10.1016\/j.cor.2006.02.005","article-title":"A reactive GRASP and path relinking for a combined production\u2013distribution problem","volume":"34","author":"Boudia","year":"2007","journal-title":"Comput. Oper. Res."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Casas-Ram\u00edrez, M.-S., Camacho-Vallejo, J.-F., Gonz\u00e1lez-Ram\u00edrez, R.G., Marmolejo-Saucedo, J.-A., and Velarde-Cant\u00fa, J.-M. (2021, January 12). Optimizing a Biobjective Production-Distribution Planning Problem Using a GRASP. Available online: https:\/\/www.hindawi.com\/journals\/complexity\/2018\/3418580\/abs\/.","DOI":"10.1155\/2018\/3418580"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10951-008-0081-9","article-title":"The integrated production\u2013inventory\u2013distribution\u2013routing problem","volume":"12","author":"Bard","year":"2009","journal-title":"J Sched."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1199","DOI":"10.1016\/j.cor.2010.10.026","article-title":"Tabu search with path relinking for an integrated production\u2013distribution problem","volume":"38","author":"Armentano","year":"2011","journal-title":"Comput. Oper. Res."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1287\/trsc.1120.0443","article-title":"Optimization-Based Adaptive Large Neighborhood Search for the Production Routing Problem","volume":"48","author":"Adulyasak","year":"2014","journal-title":"Transp. Sci."},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/j.asoc.2018.02.032","article-title":"A variable neighborhood search heuristic algorithm for production routing problems","volume":"66","author":"Qiu","year":"2018","journal-title":"Appl. Soft Comput."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Moscato, P., and Cotta, C. (2003). A gentle introduction to memetic algorithms. Handbook of Metaheuristics, Springer.","DOI":"10.4114\/ia.v7i19.721"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0377-2217(02)00823-8","article-title":"Guidelines for the use of meta-heuristics in combinatorial optimization","volume":"151","author":"Hertz","year":"2003","journal-title":"Eur. J. Oper. Res."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"1598","DOI":"10.1016\/j.engappai.2012.06.012","article-title":"Multi-product sequencing and lot-sizing under uncertainties: A memetic algorithm","volume":"25","author":"Schemeleva","year":"2012","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Toledo, C.F., Arantes, M.S., Fran\u00e7a, P.M., and Morabito, R. (2012). A memetic framework for solving the lot sizing and scheduling problem in soft drink plants. Variants of Evolutionary Algorithms for Real-World Applications, Springer.","DOI":"10.1007\/978-3-642-23424-8_3"},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0925-5273(03)00093-8","article-title":"A memetic algorithm for a multistage capacitated lot-sizing problem","volume":"87","author":"Berretta","year":"2004","journal-title":"Int. J. Prod. Econ."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1051\/ro:2008021","article-title":"A memetic algorithm for the vehicle routing problem with time windows","volume":"42","author":"Labadi","year":"2008","journal-title":"RAIRO-Oper. Res."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1016\/j.cor.2009.06.022","article-title":"A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows","volume":"37","author":"Nagata","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_42","first-page":"205","article-title":"Edge assembly-based memetic algorithm for the capacitated vehicle routing problem","volume":"54","author":"Nagata","year":"2009","journal-title":"Netw. Int. J."},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"1877","DOI":"10.1016\/j.cor.2009.06.014","article-title":"An effective memetic algorithm for the cumulative capacitated vehicle routing problem","volume":"37","author":"Ngueveu","year":"2010","journal-title":"Comput. Oper. Res."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.endm.2004.06.027","article-title":"A memetic algorithm for the heterogeneous fleet vehicle routing problem","volume":"18","author":"Lima","year":"2004","journal-title":"Electron. Notes Discret. Math."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1016\/j.engappai.2008.10.006","article-title":"Two memetic algorithms for heterogeneous fleet vehicle routing problems","volume":"22","author":"Prins","year":"2009","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"703","DOI":"10.1016\/j.ejor.2007.07.034","article-title":"A memetic algorithm with dynamic population management for an integrated production\u2013distribution problem","volume":"195","author":"Boudia","year":"2009","journal-title":"Eur. J. Oper. Res."},{"key":"ref_47","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/j.advengsoft.2008.07.001","article-title":"Determination of number of kanbans in a supply chain system via Memetic algorithm","volume":"40","author":"Rabbani","year":"2009","journal-title":"Adv. Eng. Softw."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"5354","DOI":"10.1080\/00207543.2013.774492","article-title":"Integrated aggregate supply chain planning using memetic algorithm\u2014A performance analysis case study","volume":"51","author":"Fahimnia","year":"2013","journal-title":"Int. J. Prod. Res."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","article-title":"Dynamic Version of the Economic Lot Size Model","volume":"5","author":"Wagner","year":"1958","journal-title":"Manag. Sci."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of Vehicles from a Central Depot to a Number of Delivery Points","volume":"12","author":"Clarke","year":"1964","journal-title":"Oper. Res."},{"key":"ref_51","doi-asserted-by":"crossref","first-page":"784","DOI":"10.1287\/trsc.2014.0523","article-title":"A Two-Phase Iterative Heuristic Approach for the Production Routing Problem","volume":"49","author":"Absi","year":"2015","journal-title":"Transp. Sci."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/1\/27\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:12:45Z","timestamp":1760159565000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/14\/1\/27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,19]]},"references-count":51,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2021,1]]}},"alternative-id":["a14010027"],"URL":"https:\/\/doi.org\/10.3390\/a14010027","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,19]]}}}