{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T03:10:13Z","timestamp":1654139413654},"reference-count":35,"publisher":"IGI Global","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,1,1]]},"abstract":"<p>This paper is a continuation of two previous papers where the authors used Genetic Algorithm with automated problem decomposition strategy for small scale capacitated vehicle routing problems (CVRP) and vehicle routing problem with time windows (VRPTW). In this paper they have extended their scheme to large scale capacitated vehicle routing problems by introducing selective search version of the automated problem decomposition strategy, a faster genotype to phenotype translation scheme, and various search reduction techniques. The authors have shown that genetic algorithm used with automated problem decomposition strategy outperforms the GAs applied on the problem as a whole not only in terms of solution quality but also in terms of computational time on the large scale problems.<\/p>","DOI":"10.4018\/jaec.2013010102","type":"journal-article","created":{"date-parts":[[2013,3,22]],"date-time":"2013-03-22T16:19:09Z","timestamp":1363969149000},"page":"17-38","source":"Crossref","is-referenced-by-count":1,"title":["Enhancements to the Localized Genetic Algorithm for Large Scale Capacitated Vehicle Routing Problems"],"prefix":"10.4018","volume":"4","author":[{"given":"Ziauddin","family":"Ursani","sequence":"first","affiliation":[{"name":"School of Engineering and Information Technology, Australian Defence Force Academy, University of New South Wales, Sydney, NSW, Australia"}]},{"given":"Daryl","family":"Essam","sequence":"additional","affiliation":[{"name":"School of Engineering and Information Technology, Australian Defence Force Academy, University of New South Wales, Sydney, NSW, Australia"}]},{"given":"David","family":"Cornforth","sequence":"additional","affiliation":[{"name":"School of DCIT, University of Newcastle, Callaghan, Newcastle, NSW, Australia"}]},{"given":"Robert","family":"Stocker","sequence":"additional","affiliation":[{"name":"School of Engineering and Information Technology, Australian Defence Force Academy, University of New South Wales, Sydney, NSW, Australia"}]}],"member":"2432","reference":[{"key":"jaec.2013010102-0","doi-asserted-by":"crossref","unstructured":"Alba, E., & Dorronsoro, B. (2004, April 5-7). Solving the vehicle routing problem by using cellular genetic algorithm. In J. Gottlieb & G. R. Raidl (Eds.), Proceedings of the 4th European Conference on Evolutionary Computation for Combinatorial Optimization, Coimbra, Portugal (LNCS 3004, pp. 11-20).","DOI":"10.1007\/978-3-540-24652-7_2"},{"key":"jaec.2013010102-1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.02.006"},{"key":"jaec.2013010102-2","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(02)00051-5"},{"key":"jaec.2013010102-3","doi-asserted-by":"crossref","unstructured":"Berger, J., Barkaoui, M., & Braysy, O. (2003). A route-directed hybrid genetic approach for the vehicle routing problem with time windows. INFOR, 41(2).","DOI":"10.1080\/03155986.2003.11732675"},{"key":"jaec.2013010102-4","first-page":"315","article-title":"The vehicle routing problem","author":"N.Christofides","year":"1979","journal-title":"Combinatorial optimisation"},{"key":"jaec.2013010102-5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.4.568"},{"key":"jaec.2013010102-6","article-title":"A parallel version of the d-ant algorithm for the vehicle routing problem","author":"K. F.Doerner","year":"2005","journal-title":"Optimization and classification parallel numerics"},{"issue":"2","key":"jaec.2013010102-7","doi-asserted-by":"crossref","first-page":"125","DOI":"10.5772\/9698","article-title":"An algorithm for the vehicle problem.","volume":"7","author":"A.Ezzatneshan","year":"2010","journal-title":"International Journal of Advanced Robotic Systems"},{"key":"jaec.2013010102-8","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.40.10.1276"},{"key":"jaec.2013010102-9","doi-asserted-by":"crossref","unstructured":"He, R., Xu, W., Sun, J., & Zu, B. (2009). Balanced k-means algorithm for partitioning areas in large-scale vehicle routing problem. In Proceedings of the Third International Symposium on Intelligent Information Technology Application (pp. 87-90).","DOI":"10.1109\/IITA.2009.307"},{"key":"jaec.2013010102-10","unstructured":"Johnson, D. S. (2001). A theoretician\u2019s guide to the experimental analysis of algorithms (Tech. Rep.). Retrieved from http:\/\/www2.research.att.com\/~dsj\/papers\/experguide.pdf"},{"key":"jaec.2013010102-11","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2003.10.002"},{"key":"jaec.2013010102-12","doi-asserted-by":"crossref","unstructured":"Lian, L., & Castelain, E. (2009, October 20-22). A decomposition-based heuristic approach to solve general delivery problem. In Proceedings of the World Congress on Engineering and Computer Science, San Francisco, CA (Vol. 2).","DOI":"10.1063\/1.3460252"},{"key":"jaec.2013010102-13","doi-asserted-by":"crossref","unstructured":"Lian, L., & Castelain, E. (2010). A decomposition approach to solve a general delivery problem. Engineering Letters, 18(1).","DOI":"10.1063\/1.3460252"},{"key":"jaec.2013010102-14","unstructured":"Machado, P., Traverse, J., Pereira, F. B., & Costa, E. (2002). Vehicle routing problem: Doing it the evolutionary way. In Proceedings of the Genetic and Evolutionary Computation Conference (p. 690)."},{"key":"jaec.2013010102-15","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)90063-9"},{"key":"jaec.2013010102-16","doi-asserted-by":"crossref","unstructured":"Pereira, F. B., Tavares, J., Machado, P., & Costa, E. (2002). GVR: A new genetic representation for the vehicle routing problem. In Proceedings of the 13th Irish Conference on Artificial Intelligence and Cognitive Science, Limerick, Ireland (pp. 95-102).","DOI":"10.1007\/3-540-45750-X_12"},{"key":"jaec.2013010102-17","doi-asserted-by":"publisher","DOI":"10.1007\/BF00126629"},{"key":"jaec.2013010102-18","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","article-title":"Shortest connection networks and some generalizations.","volume":"36","author":"R. C.Prim","year":"1957","journal-title":"The Bell System Technical Journal"},{"key":"jaec.2013010102-19","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(03)00158-8"},{"key":"jaec.2013010102-20","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0323-0"},{"key":"jaec.2013010102-21","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(03)00014-5"},{"key":"jaec.2013010102-22","doi-asserted-by":"publisher","DOI":"10.1007\/BF02430370"},{"issue":"3","key":"jaec.2013010102-23","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":"jaec.2013010102-24","doi-asserted-by":"crossref","unstructured":"Thangiah, S. R. (1995). Vehicle routing with time windows using genetic algorithms. applications In L. Chambers (Ed.), The practical handbook of genetic algorithms: Volume 2: New frontiers (pp. 253-277). Boca Raton, FL: CRC Press.","DOI":"10.1201\/9781420050073.ch11"},{"key":"jaec.2013010102-25","doi-asserted-by":"crossref","unstructured":"Thangiah, S. R. (1999). A hybrid genetic algorithm, simulated annealing and tabu search heuristic for vehicle routing problems with time windows. In L. Chambers (Ed.), Practical handbook of genetic algorithms: Volume 3: Complex structures (pp. 347-381). Boca Raton, FL: CRC Press.","DOI":"10.1201\/9781420050080.ch9"},{"key":"jaec.2013010102-26","unstructured":"Thangiah, S. R., & Nygard, K. E. (1992). School bus routing using genetic algorithms. In Proceedings of the SPIE Conference on the Application of Artificial Intelligence X: Knowledge Bases Systems, Orlando, FL (pp. 387-398)."},{"key":"jaec.2013010102-27","doi-asserted-by":"crossref","unstructured":"Thangiah, S. R., Nygard, K. E., & Paul, L. J. (1991). GIDEON: A genetic algorithm system for vehicle routing with time windows. In Proceedings of the 7th IEEE Conference on Artificial Intelligence Applications (pp. 322-328).","DOI":"10.1109\/CAIA.1991.120888"},{"key":"jaec.2013010102-28","doi-asserted-by":"publisher","DOI":"10.1080\/08839510151087293"},{"key":"jaec.2013010102-29","unstructured":"Ursani, Z. (2009). Localized genetic algorithm for the vehicle routing problem (Unpublished doctoral dissertation). Australian Defence Force Academy, University of New South Wales, Kensington, NSW, Australia."},{"key":"jaec.2013010102-30","doi-asserted-by":"publisher","DOI":"10.3138\/infor.47.2.133"},{"issue":"2","key":"jaec.2013010102-31","first-page":"133","article-title":"Localized genetic algorithm for small scale vehicle routing problems.","volume":"47","author":"Z.Ursani","year":"2009","journal-title":"INFOR"},{"key":"jaec.2013010102-32","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2011.05.021"},{"key":"jaec.2013010102-33","doi-asserted-by":"crossref","unstructured":"Ursani, Z., Sarker, R., & Abbass, I. H. (2007). Improving the performance of genetic algorithm using self imposed constraints in the vehicle routing problem. In Proceedings of the IEEE Symposium on Computational Intelligence, Honolulu, HI.","DOI":"10.1109\/SCIS.2007.367693"},{"key":"jaec.2013010102-34","unstructured":"Wall, M. (1995). GAlib - A C++ Genetic algorithms library, version 2.4. Cambridge, MA: MIT. Retrieved from http:\/\/lancet.mit.edu\/galib-2.4"}],"container-title":["International Journal of Applied Evolutionary Computation"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=75823","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T02:37:54Z","timestamp":1654137474000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jaec.2013010102"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2013,1,1]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,1]]}},"URL":"https:\/\/doi.org\/10.4018\/jaec.2013010102","relation":{},"ISSN":["1942-3594","1942-3608"],"issn-type":[{"value":"1942-3594","type":"print"},{"value":"1942-3608","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,1]]}}}