{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T19:10:19Z","timestamp":1654110619660},"reference-count":22,"publisher":"IGI Global","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7,1]]},"abstract":"<p>This paper addresses the Capacitated Vehicle Routing Problem (CVRP) with a homogenous fleet of vehicles serving a large customer base. The authors propose a multi-phase heuristic that clusters the nodes based on proximity, orients them along a route, and allots vehicles. For the final phase of determining the routes for each vehicle, they have developed a Particle Swarm Optimization (PSO) approach. Benchmark datasets as well as hypothetical datasets have been used for computational trials. The proposed heuristic is found to perform exceedingly well even for large problem instances, both in terms of quality of solutions and in terms of computational effort.<\/p>","DOI":"10.4018\/jgc.2012070103","type":"journal-article","created":{"date-parts":[[2012,12,11]],"date-time":"2012-12-11T16:31:28Z","timestamp":1355243488000},"page":"34-50","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Heuristics for Large-Scale Vehicle Routing Problems Using Particle Swarm Optimization"],"prefix":"10.4018","volume":"3","author":[{"given":"A.","family":"Chandramouli","sequence":"first","affiliation":[{"name":"National Institute of Technology, Tiruchirappalli, India"}]},{"given":"L. Vivek","family":"Srinivasan","sequence":"additional","affiliation":[{"name":"Velammal Engineering College, India"}]},{"given":"T. T.","family":"Narendran","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology, Madras, India"}]}],"member":"2432","reference":[{"key":"jgc.2012070103-0","unstructured":"[INSERT FIGURE 001]"},{"key":"jgc.2012070103-1","author":"M. R.Anderberg","year":"1973","journal-title":"Cluster analysis for applications"},{"key":"jgc.2012070103-2","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00051-5"},{"key":"jgc.2012070103-3","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601635"},{"key":"jgc.2012070103-4","first-page":"69","article-title":"The state of the art in the routing and scheduling of vehicles and crews.","volume":"10","author":"L.Bodin","year":"1983","journal-title":"Computers & Operations Research"},{"key":"jgc.2012070103-5","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018940026670"},{"key":"jgc.2012070103-6","doi-asserted-by":"publisher","DOI":"10.1631\/jzus.2006.A0607"},{"key":"jgc.2012070103-7","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.07.004"},{"key":"jgc.2012070103-8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.08.017"},{"key":"jgc.2012070103-9","doi-asserted-by":"crossref","unstructured":"Eberhart, R., & Kennedy, J. (1995). A new optimizer using particle swarm theory. In Proceedings of the Sixth International Symposium on Micro Machine and Human Science (pp. 39-43).","DOI":"10.1109\/MHS.1995.494215"},{"key":"jgc.2012070103-10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.01.037"},{"key":"jgc.2012070103-11","author":"B. L.Golden","year":"1988","journal-title":"Vehicle routing: Methods and studies"},{"key":"jgc.2012070103-12","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-008-0136-9"},{"key":"jgc.2012070103-13","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.06.085"},{"key":"jgc.2012070103-14","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.06.015"},{"key":"jgc.2012070103-15","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.06.014"},{"key":"jgc.2012070103-16","doi-asserted-by":"crossref","unstructured":"Osman, I. H., Abo-Sinna, M. A., & Mouse, A. A. (2005). An effective genetic algorithm approach to multiobjective routing problems. Applied Mathematics and Computation, [INSERT FIGURE 002]163, 769-781.","DOI":"10.1016\/j.amc.2003.10.058"},{"key":"jgc.2012070103-17","doi-asserted-by":"crossref","unstructured":"Pop, P. C., Matei, O., Pop Sitar, C., & Chira, C. (2010). A genetic algorithm for solving the generalized vehicle routing problem. In Proceedings of the Fifth International Conference on Hybrid Artificial Intelligence Systems, Spain (pp. 119-126).","DOI":"10.1007\/978-3-642-13803-4_15"},{"key":"jgc.2012070103-18","doi-asserted-by":"crossref","unstructured":"Prins, C. (2004). A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research31, 1985-2002.","DOI":"10.1016\/S0305-0548(03)00158-8"},{"key":"jgc.2012070103-19","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2005.09.040"},{"key":"jgc.2012070103-20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2008.02.028"},{"key":"jgc.2012070103-21","unstructured":"Zhu, Q., Qian, L., Li, Y., & Zhu, S. (2006). An improved particle swarm optimization algorithm for vehicle routing problem with time windows. In Proceedings of the IEEE Congress on Evolutionary Computation (pp. 1386-1390)."}],"container-title":["International Journal of Green Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=69997","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T18:55:08Z","timestamp":1654109708000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jgc.2012070103"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2012,7,1]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,7]]}},"URL":"https:\/\/doi.org\/10.4018\/jgc.2012070103","relation":{},"ISSN":["1948-5018","1948-5026"],"issn-type":[{"value":"1948-5018","type":"print"},{"value":"1948-5026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,1]]}}}