Genetic Algorithms Dynamic Population Size with Cloning in Solving Traveling Salesman Problem
DOI:
https://doi.org/10.32734/jocai.v2.i2-326Keywords:
population size, local optimum, early convergence, salem, travelling salesman problemAbstract
Population size of classical genetic algorithm is determined constantly. Its size remains constant over the run. For more complex problems, larger population sizes need to be avoided from early convergence to produce local optimum. Objective of this research is to evaluate population resizing i.e. dynamic population sizing for Genetic Algorithm (GA) using cloning strategy. We compare performance of proposed method and traditional GA employed to Travelling Salesman Problem (TSP) of A280.tsp taken from TSPLIB. Result shown that GA with dynamic population size exceed computational time of traditional GA.
Downloads
Published
How to Cite
Issue
Section
The Authors submitting a manuscript do so on the understanding that if accepted for publication, copyright of the article shall be assigned to Data Science: Journal of Informatics Technology and Computer Science (JoCAI) and Faculty of Computer Science and Information Technology as well as TALENTA Publisher Universitas Sumatera Utara as publisher of the journal.
Copyright encompasses exclusive rights to reproduce and deliver the article in all form and media. The reproduction of any part of this journal, its storage in databases and its transmission by any form or media, will be allowed only with a written permission fromData Science: Journal of Informatics Technology and Computer Science (JoCAI).
The Copyright Transfer Form can be downloaded here.
The copyright form should be signed originally and sent to the Editorial Office in the form of original mail or scanned document.