{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T22:22:33Z","timestamp":1767046953096},"reference-count":49,"publisher":"IGI Global","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,4]]},"abstract":"<jats:p>Genetic algorithms (GAs) are a population-based meta-heuristic global optimization technique for dealing with complex problems with a very large search space. The population initialization is a crucial task in GAs because it plays a vital role in the convergence speed, problem search space exploration, and also the quality of the final optimal solution. Though the importance of deciding problem-specific population initialization in GA is widely recognized, it is hardly addressed in the literature. In this article, different population seeding techniques for permutation-coded genetic algorithms such as random, nearest neighbor (NN), gene bank (GB), sorted population (SP), and selective initialization (SI), along with three newly proposed ordered-distance-vector-based initialization techniques have been extensively studied. The ability of each population seeding technique has been examined in terms of a set of performance criteria, such as computation time, convergence rate, error rate, average convergence, convergence diversity, nearest-neighbor ratio, average distinct solutions and distribution of individuals. One of the famous combinatorial hard problems of the traveling salesman problem (TSP) is being chosen as the testbed and the experiments are performed on large-sized benchmark TSP instances obtained from standard TSPLIB. The scope of the experiments in this article is limited to the initialization phase of the GA and this restricted scope helps to assess the performance of the population seeding techniques in their intended phase alone. The experimentation analyses are carried out using statistical tools to claim the unique performance characteristic of each population seeding techniques and best performing techniques are identified based on the assessment criteria defined and the nature of the application.<\/jats:p>","DOI":"10.4018\/ijamc.2019040103","type":"journal-article","created":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T15:27:48Z","timestamp":1550071668000},"page":"55-92","source":"Crossref","is-referenced-by-count":14,"title":["Performance Evaluation of Population Seeding Techniques of Permutation-Coded GA Traveling Salesman Problems Based Assessment"],"prefix":"10.4018","volume":"10","author":[{"given":"Victer","family":"Paul","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Vignan's Foundation for Science, Technology & Research, Guntur, India"}]},{"family":"Ganeshkumar C","sequence":"additional","affiliation":[{"name":"Indian Institute of Plantation Management (IIPM), Bangalore, India"}]},{"family":"Jayakumar L","sequence":"additional","affiliation":[{"name":"Pondicherry University, Pondicherry, India"}]}],"member":"2432","reference":[{"issue":"6","key":"IJAMC.2019040103-0","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1504\/IJBIC.2011.043622","article-title":"Evolution in ecological agent systems.","volume":"3","author":"M.Lurgi","year":"2011","journal-title":"International Journal of Bio-inspired Computation"},{"issue":"6","key":"IJAMC.2019040103-1","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1504\/IJBIC.2012.051408","article-title":"Genetic algorithm and pure random search for exosensor distribution optimisation.","volume":"4","author":"M. P.Poland","year":"2012","journal-title":"International Journal of Bio-inspired Computation"},{"issue":"3","key":"IJAMC.2019040103-2","doi-asserted-by":"crossref","first-page":"1313","DOI":"10.1016\/j.eswa.2010.07.006","article-title":"Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms.","volume":"38","author":"M.Albayrak","year":"2011","journal-title":"Expert Systems with Applications"},{"key":"IJAMC.2019040103-3","first-page":"l-88","author":"D. E.Goldberg","year":"1989","journal-title":"Genetic algorithm in search, optimization and machine learning. In Machine Learning"},{"key":"IJAMC.2019040103-4","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.06.085"},{"key":"IJAMC.2019040103-5","doi-asserted-by":"crossref","unstructured":"Chen, S. M., & Chien, C. Y. (2010). A new method for solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. In International conference on machine learning and cybernetics, Qingdao, Shandong, China (pp. 2477\u20132482).","DOI":"10.1109\/ICMLC.2010.5580809"},{"issue":"12","key":"IJAMC.2019040103-6","doi-asserted-by":"crossref","first-page":"14439","DOI":"10.1016\/j.eswa.2011.04.163","article-title":"Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques.","volume":"38","author":"S. M.Chen","year":"2011","journal-title":"Expert Systems with Applications"},{"key":"IJAMC.2019040103-7","doi-asserted-by":"publisher","DOI":"10.1142\/S1465876301000350"},{"key":"IJAMC.2019040103-8","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC.2007.537"},{"issue":"10-12","key":"IJAMC.2019040103-9","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0895-7177(00)00088-1","article-title":"The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem.","volume":"31","author":"K.Katayama","year":"2000","journal-title":"Mathematical and Computer Modelling: An International Journal"},{"key":"IJAMC.2019040103-10","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009695129052"},{"issue":"3","key":"IJAMC.2019040103-11","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/s10898-006-9056-6","article-title":"On initial populations of a genetic algorithm for continuous optimization problems.","volume":"37","author":"H.Maaranen","year":"2007","journal-title":"Journal of Global Optimization"},{"key":"IJAMC.2019040103-12","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2003.07.011"},{"key":"IJAMC.2019040103-13","doi-asserted-by":"publisher","DOI":"10.1016\/j.camwa.2006.07.013"},{"key":"IJAMC.2019040103-14","doi-asserted-by":"crossref","unstructured":"Yang, S., Guohui, Z., Liang, G., & Kun, Y. (2009). A novel initialization method for solving Flexible Job-shop Scheduling Problem. In International Conference on Computers & Industrial Engineering (CIE 2009) (pp. 68-73).","DOI":"10.1109\/ICCIE.2009.5223891"},{"key":"IJAMC.2019040103-15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2013.05.009"},{"key":"IJAMC.2019040103-16","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2010.08.029"},{"issue":"3","key":"IJAMC.2019040103-17","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/S0377-2217(97)00206-3","article-title":"Performance characteristics of alternative genetic algorithmic approaches to the traveling salesman problem using path representation: An empirical study.","volume":"108","author":"L. J.Schmitt","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"IJAMC.2019040103-18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-36668-3_157"},{"key":"IJAMC.2019040103-19","doi-asserted-by":"publisher","DOI":"10.1109\/ICCIT.2008.373"},{"issue":"4","key":"IJAMC.2019040103-20","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1007\/s00158-010-0575-x","article-title":"Domain-specific initial population strategy for compliant mechanisms using customized genetic algorithm.","volume":"43","author":"D.Sharma","year":"2011","journal-title":"Structural and Multidisciplinary Optimization"},{"key":"IJAMC.2019040103-21","doi-asserted-by":"publisher","DOI":"10.1049\/cp:19971173"},{"key":"IJAMC.2019040103-22","first-page":"42","article-title":"Incorporating Problem Specific Knowledge in Genetic Algorithms","author":"J.Grefenstette","year":"1987","journal-title":"Genetic Algorithms and Simulated Annealing"},{"issue":"2","key":"IJAMC.2019040103-23","article-title":"Initialization Strategies and Diversity in Evolutionary Timetabling","volume":"6","author":"E.Burke","year":"1998","journal-title":"Evolutionary Computation"},{"key":"IJAMC.2019040103-24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2011.06.015"},{"key":"IJAMC.2019040103-25","doi-asserted-by":"publisher","DOI":"10.1109\/ICCPCT.2013.6528933"},{"key":"IJAMC.2019040103-26","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00284-2"},{"issue":"3","key":"IJAMC.2019040103-27","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s10489-006-0018-y","article-title":"Genetic operators for combinatorial optimization in TSP and microarray gene ordering","volume":"26","author":"S.Shubhra","year":"2007","journal-title":"Journal of Applied Intelligence"},{"issue":"3-4","key":"IJAMC.2019040103-28","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0020-0255(99)00026-2","article-title":"A synergetic approach to genetic algorithms for solving traveling salesman problem.","volume":"117","author":"L.Qu","year":"1999","journal-title":"Information Sciences"},{"issue":"3","key":"IJAMC.2019040103-29","first-page":"2993","article-title":"Performance analyses on population seeding techniques for genetic algorithms.","volume":"5","author":"P.Victer Paul","year":"2013","journal-title":"IACSIT International Journal of Engineering and Technology"},{"key":"IJAMC.2019040103-30","doi-asserted-by":"crossref","unstructured":"Kaur, D., & Murugappan, M. M. (2008). Performance Enhancement in solving Travelling Salesman Problem using Hybrid Genetic Algorithm. In Annual Meeting of the North American Fuzzy Information Processing SocietyNAFIPS 2008 (pp. 1-6).","DOI":"10.1109\/NAFIPS.2008.4531202"},{"key":"IJAMC.2019040103-31","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLC.2009.5212254"},{"key":"IJAMC.2019040103-32","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.10.018"},{"key":"IJAMC.2019040103-33","article-title":"Effective EV population initialization technique for genetic algorithm","author":"P.Victer Paul","year":"2013","journal-title":"IEEE International Conference on Advanced Research in Engineering and Technology (ICARET)"},{"key":"IJAMC.2019040103-34","author":"X.Hue","year":"1997","journal-title":"Genetic algorithms for optimization: Background and applications"},{"key":"IJAMC.2019040103-35","doi-asserted-by":"publisher","DOI":"10.1109\/CISIS.2010.78"},{"key":"IJAMC.2019040103-36","unstructured":"Tsai, C., & Tsai, C. W. (2002). A New Approach for Solving Large Travelling Salesman Problem Using Evolutionary Ant Rules. In International Joint Conference on Neural NetworksIJCNN '02 (Vol. 2, pp. 1540-1545)."},{"issue":"3","key":"IJAMC.2019040103-37","first-page":"362","article-title":"Effective VE Population Initialization Technique for Permutation-Coded Genetic Algorithm.","volume":"1","author":"P. V.Paul","year":"2013","journal-title":"International Journal of Computer Science and Electronics Engineering"},{"key":"IJAMC.2019040103-38","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125403"},{"key":"IJAMC.2019040103-39","doi-asserted-by":"publisher","DOI":"10.1109\/ICNNB.2005.1614714"},{"key":"IJAMC.2019040103-40","author":"S. N.Sivanandam","year":"2008","journal-title":"Introduction to Genetic Algorithms"},{"key":"IJAMC.2019040103-41","author":"J. H.Holland","year":"1975","journal-title":"Adaptation in natural and artificial systems"},{"issue":"5","key":"IJAMC.2019040103-42","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.mechatronics.2003.10.001","article-title":"An effective robot trajectory planning method using a genetic algorithm.","volume":"14","author":"L.Tian","year":"2004","journal-title":"Mechatronics"},{"issue":"1","key":"IJAMC.2019040103-43","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF01198147","article-title":"Computer-aided pipeline operation using genetic algorithms and rule learning. PART I: Genetic algorithms in pipeline optimization.","volume":"3","author":"D.Goldberg","year":"1987","journal-title":"Engineering with Computers"},{"issue":"9","key":"IJAMC.2019040103-44","doi-asserted-by":"crossref","first-page":"3063","DOI":"10.1016\/j.cam.2010.12.027","article-title":"Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times.","volume":"235","author":"J.Majumdar","year":"2011","journal-title":"Journal of Computational and Applied Mathematics"},{"issue":"1","key":"IJAMC.2019040103-45","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/j.cie.2008.05.002","article-title":"Multi-criteria sequence-dependent job shop scheduling using genetic algorithms.","volume":"56","author":"A.Manikas","year":"2009","journal-title":"Computers & Industrial Engineering"},{"issue":"15-16","key":"IJAMC.2019040103-46","doi-asserted-by":"crossref","first-page":"1392","DOI":"10.1016\/S0140-3664(99)00113-9","article-title":"QoS routing based on genetic algorithm.","volume":"22","author":"F.Xiang","year":"1999","journal-title":"Computer Communications"},{"key":"IJAMC.2019040103-47","doi-asserted-by":"publisher","DOI":"10.2307\/3001478"},{"issue":"4","key":"IJAMC.2019040103-48","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1016\/j.csda.2010.06.013","article-title":"Fuzzy data treated as functional data: A one-way ANOVA test approach.","volume":"56","author":"G.Gonz\u00e1lez-Rodr\u00edguez","year":"2012","journal-title":"Computational Statistics & Data Analysis"}],"container-title":["International Journal of Applied Metaheuristic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=223443","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,6]],"date-time":"2022-05-06T14:08:32Z","timestamp":1651846112000},"score":1,"resource":{"primary":{"URL":"http:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/IJAMC.2019040103"}},"subtitle":["Performance Evaluation of Population Seeding Techniques of Permutation-Coded GA"],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":49,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.4018\/ijamc.2019040103","relation":{},"ISSN":["1947-8283","1947-8291"],"issn-type":[{"value":"1947-8283","type":"print"},{"value":"1947-8291","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}