{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:20:49Z","timestamp":1752229249531},"reference-count":84,"publisher":"IGI Global","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,10,1]]},"abstract":"<p>The classical Vehicle Routing Problem (VRP) tries to minimise the cost of dispatching goods from depots to customers using vehicles with limited carrying capacity. As a generalisation of the TSP, the problem is known to be NP-hard and several authors have proposed heuristics and meta-heuristics for obtaining good solutions. The authors present genetic algorithm-based approaches for solving the problem and compare the results with available results from other papers, in particular, the hybrid clustering based genetic algorithm. The authors find that the proposed methods give encouraging results on all these instances. The approach can be extended to solve multi depot VRPs with heterogeneous fleet of vehicles.<\/p>","DOI":"10.4018\/ijisscm.2019100101","type":"journal-article","created":{"date-parts":[[2019,7,30]],"date-time":"2019-07-30T14:13:37Z","timestamp":1564496017000},"page":"1-26","source":"Crossref","is-referenced-by-count":7,"title":["An Improved Genetic Algorithm for Solving Multi Depot Vehicle Routing Problems"],"prefix":"10.4018","volume":"12","author":[{"given":"Varimna","family":"Singh","sequence":"first","affiliation":[{"name":"Som Lalit Institute of Management Studies, Ahmedabad, India"}]},{"given":"L.","family":"Ganapathy","sequence":"additional","affiliation":[{"name":"National Institute of Industrial Engineering, Mumbai, India"}]},{"given":"Ashok K.","family":"Pundir","sequence":"additional","affiliation":[{"name":"National Institute of Industrial Engineering, Mumbai, India"}]}],"member":"2432","reference":[{"key":"IJISSCM.2019100101-0","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2014.10.048"},{"key":"IJISSCM.2019100101-1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2007.06.014"},{"key":"IJISSCM.2019100101-2","doi-asserted-by":"publisher","DOI":"10.1007\/s10100-007-0036-9"},{"key":"IJISSCM.2019100101-3","author":"A.Bettinelli","year":"2009","journal-title":"A Branch-and-price Algorithm for the Multi-depot Heterogeneous Fleet Vehicle Routing Problem with Time Windows"},{"key":"IJISSCM.2019100101-4","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2010.07.008"},{"key":"IJISSCM.2019100101-5","doi-asserted-by":"publisher","DOI":"10.2307\/3008264"},{"key":"IJISSCM.2019100101-6","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(00)00009-5"},{"key":"IJISSCM.2019100101-7","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2005.05.004"},{"key":"IJISSCM.2019100101-8","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.4.568"},{"key":"IJISSCM.2019100101-9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2014.03.001"},{"key":"IJISSCM.2019100101-10","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G"},{"key":"IJISSCM.2019100101-11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.02.007"},{"key":"IJISSCM.2019100101-12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.08.015"},{"key":"IJISSCM.2019100101-13","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.6.1.80"},{"key":"IJISSCM.2019100101-14","first-page":"387","article-title":"Time dependent vehicle routing problem with fuzzy traveling times under different traffic conditions.","volume":"14","author":"T.Demirel","year":"2008","journal-title":"Journal of Multiple Valued Logic and Soft Computing"},{"key":"IJISSCM.2019100101-15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2004.07.077"},{"key":"IJISSCM.2019100101-16","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2008.10.003"},{"issue":"2","key":"IJISSCM.2019100101-17","first-page":"129","article-title":"An optimal approach to the multiple-depot heterogeneous vehicle routing problem with time window and capacity constraints.","volume":"33","author":"R.Dondo","year":"2003","journal-title":"Latin American Applied Research"},{"issue":"4","key":"IJISSCM.2019100101-18","doi-asserted-by":"crossref","first-page":"1122","DOI":"10.1016\/j.cor.2007.12.012","article-title":"A hybrid method based on linear programming and tabu search for routing of logging trucks.","volume":"36","author":"P.Flisberg","year":"2009","journal-title":"Computers & Operations Research"},{"key":"IJISSCM.2019100101-19","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0483(76)90097-9"},{"key":"IJISSCM.2019100101-20","doi-asserted-by":"publisher","DOI":"10.1287\/opre.22.2.340"},{"key":"IJISSCM.2019100101-21","doi-asserted-by":"publisher","DOI":"10.4018\/ijisscm.2013070102"},{"key":"IJISSCM.2019100101-22","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-3658-2_57"},{"key":"IJISSCM.2019100101-23","doi-asserted-by":"publisher","DOI":"10.1109\/IMTC.2009.5168448"},{"key":"IJISSCM.2019100101-24","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2007.06.001"},{"key":"IJISSCM.2019100101-25","author":"J.Holland","year":"1975","journal-title":"Adaptation in natural and artificial systems"},{"key":"IJISSCM.2019100101-26","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.07.022"},{"key":"IJISSCM.2019100101-27","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00235-0"},{"key":"IJISSCM.2019100101-28","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2007.06.031"},{"key":"IJISSCM.2019100101-29","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2014.11.005"},{"key":"IJISSCM.2019100101-30","doi-asserted-by":"publisher","DOI":"10.1016\/j.mcm.2007.02.007"},{"key":"IJISSCM.2019100101-31","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2015.01.005"},{"key":"IJISSCM.2019100101-32","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(85)90284-X"},{"key":"IJISSCM.2019100101-33","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2012.01.024"},{"key":"IJISSCM.2019100101-34","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.22.3.161"},{"key":"IJISSCM.2019100101-35","first-page":"283","article-title":"Optimal solution to capacitated multi depot vehicle routing problems.","volume":"44","author":"G.Laporte","year":"1984","journal-title":"Congress"},{"key":"IJISSCM.2019100101-36","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2009.2019265"},{"key":"IJISSCM.2019100101-37","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2014.12.004"},{"key":"IJISSCM.2019100101-38","doi-asserted-by":"publisher","DOI":"10.4304\/jnw.8.5.1035-1042"},{"key":"IJISSCM.2019100101-39","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600763"},{"key":"IJISSCM.2019100101-40","doi-asserted-by":"publisher","DOI":"10.1007\/s00291-012-0289-0"},{"key":"IJISSCM.2019100101-41","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230260104"},{"key":"IJISSCM.2019100101-42","doi-asserted-by":"publisher","DOI":"10.1109\/KES.2000.884102"},{"key":"IJISSCM.2019100101-43","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.11.034"},{"key":"IJISSCM.2019100101-44","doi-asserted-by":"publisher","DOI":"10.4018\/ijisscm.2013100105"},{"key":"IJISSCM.2019100101-45","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2002.11.003"},{"key":"IJISSCM.2019100101-46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85152-3_4"},{"key":"IJISSCM.2019100101-47","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-005-5432-5"},{"key":"IJISSCM.2019100101-48","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.8.2.165"},{"key":"IJISSCM.2019100101-49","doi-asserted-by":"publisher","DOI":"10.1007\/BF00126629"},{"key":"IJISSCM.2019100101-50","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.07.004"},{"issue":"6","key":"IJISSCM.2019100101-51","article-title":"Novel Encoding Scheme in Genetic Algorithms for Better Fitness.","volume":"1","author":"K.Rakesh","year":"2012","journal-title":"International Journal of Engineering and Advanced Technology"},{"issue":"11","key":"IJISSCM.2019100101-52","article-title":"Genetic Algorithm based Solution Model for Multi-Depot Vehicle Routing Problem with Time Windows.","volume":"3","author":"A.Ramalingam","year":"2014","journal-title":"International Journal of Advanced Research in Computer and Communication Engineering"},{"key":"IJISSCM.2019100101-53","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(95)O0026-P"},{"key":"IJISSCM.2019100101-54","doi-asserted-by":"publisher","DOI":"10.1007\/s10852-007-9069-2"},{"key":"IJISSCM.2019100101-55","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.05.011"},{"key":"IJISSCM.2019100101-56","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(96)00253-6"},{"key":"IJISSCM.2019100101-57","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/978-3-7091-6492-1_51","article-title":"A genetic clustering method for the multi-depot vehicle routing problem","author":"S.Salhi","year":"1998","journal-title":"Artificial Neural Nets and Genetic Algorithms"},{"key":"IJISSCM.2019100101-58","doi-asserted-by":"publisher","DOI":"10.4018\/jisscm.2013040102"},{"issue":"2","key":"IJISSCM.2019100101-59","doi-asserted-by":"crossref","first-page":"33","DOI":"10.4018\/jisscm.2013040103","article-title":"Genetic Algorithm for Inventory Levels and Routing Structure Optimization in Two Stage Supply Chain.","volume":"6","author":"P.Sivakumar","year":"2013","journal-title":"International Journal of Information Systems and Supply Chain Management"},{"key":"IJISSCM.2019100101-60","unstructured":"Sivanandam and Deepa. S.N. (2008). Introduction to Genetic Algorithms. Springer-Verlag."},{"key":"IJISSCM.2019100101-61","first-page":"403","article-title":"The non-fixed destination multiple depot capacitated vehicle routing problem and genetic algorithms.","author":"M.Skok","year":"2000","journal-title":"Proceedings of the 22nd International Conference on Information Technology Interfaces ITI 2000"},{"key":"IJISSCM.2019100101-62","doi-asserted-by":"publisher","DOI":"10.1108\/09576069910247609"},{"key":"IJISSCM.2019100101-63","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(94)00083-K"},{"issue":"3","key":"IJISSCM.2019100101-64","first-page":"118","article-title":"Solution to multi-depot vehicle routing problem using genetic algorithms.","volume":"1","author":"P.Surekha","year":"2011","journal-title":"World Applied Programming"},{"key":"IJISSCM.2019100101-65","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601443"},{"key":"IJISSCM.2019100101-66","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00669-0"},{"key":"IJISSCM.2019100101-67","doi-asserted-by":"publisher","DOI":"10.1080\/08839510151087293"},{"key":"IJISSCM.2019100101-68","doi-asserted-by":"publisher","DOI":"10.1201\/9781420050073.ch11"},{"key":"IJISSCM.2019100101-69","doi-asserted-by":"crossref","unstructured":"Thangiah, Sam R. and AnandaGubbi (1993). Effect of Genetic Sectoring on Vehicle Routing Problems with Time Windows. In Proceedings of the IEEE International Conference on Developing and Managing Intelligent System Projects, Washington, D.C. (pp. 146-153).","DOI":"10.1109\/DMISP.1993.248624"},{"key":"IJISSCM.2019100101-70","unstructured":"Thangiah, S. R., & Nygard, K. (1992), \u201cSchool Bus Routing using Genetic Algorithms\u201d, Proceedings of the Applications of Artificial Intelligence X: Knowledge Based Systems, Orlando, Florida, pp. 387-398"},{"key":"IJISSCM.2019100101-71","doi-asserted-by":"publisher","DOI":"10.1109\/CAIA.1991.120888"},{"key":"IJISSCM.2019100101-72","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.3.3.192"},{"key":"IJISSCM.2019100101-73","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1120.1048"},{"key":"IJISSCM.2019100101-74","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2008.01.072"},{"key":"IJISSCM.2019100101-75","doi-asserted-by":"publisher","DOI":"10.2307\/3007888"},{"key":"IJISSCM.2019100101-76","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(01)00038-7"},{"key":"IJISSCM.2019100101-77","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2009.2033578"},{"key":"IJISSCM.2019100101-78","doi-asserted-by":"publisher","DOI":"10.14257\/ijca.2014.7.3.29"},{"key":"IJISSCM.2019100101-79","doi-asserted-by":"publisher","DOI":"10.1016\/j.pnsc.2008.01.030"},{"key":"IJISSCM.2019100101-80","doi-asserted-by":"publisher","DOI":"10.1057\/jors.2009.161"},{"key":"IJISSCM.2019100101-81","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2011.03.077"},{"issue":"1","key":"IJISSCM.2019100101-82","first-page":"53","article-title":"Solving Rich Vehicle Routing Problem Using Three Steps Heuristic.","volume":"3","author":"I.Yusuf","year":"2014","journal-title":"International Journal of Information Science and Intelligent System"},{"issue":"2","key":"IJISSCM.2019100101-83","first-page":"28","article-title":"Solving Multi-depot, Heterogeneous, Site Dependent and Asymmetric VRP Using Three Steps Heuristic.","volume":"2","author":"I.Yusuf","year":"2014","journal-title":"Journal of Algorithms and Optimization"}],"container-title":["International Journal of Information Systems and Supply Chain Management"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=234460","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T16:06:48Z","timestamp":1674835608000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJISSCM.2019100101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2019,10,1]]},"references-count":84,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,10]]}},"URL":"https:\/\/doi.org\/10.4018\/ijisscm.2019100101","relation":{},"ISSN":["1935-5726","1935-5734"],"issn-type":[{"value":"1935-5726","type":"print"},{"value":"1935-5734","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,1]]}}}