A Lamarckian Genetic Algorithm Applied to the Travelling Salesman Problem
Bereket T. Tesfaldet () and
Augusto Y. Hermosilla ()
Additional contact information
Bereket T. Tesfaldet: Department of Mathematics, University of Asmara, Asmara, Eritrea
Augusto Y. Hermosilla: Department of Mathematics, University of the Philippines-Diliman, Quezon City, Philippines
Advances in Complex Systems (ACS), 1999, vol. 02, issue 04, 431-457
Abstract:
Genetic Algorithms(GAs) comprise aclass of adaptive heuristic search methodsanalogous to genetic inheritance and Darwinian strife for survivial of individuals within a population. Today, GAs are widely used to solve complex optimization problems, including ill-conditioned and NP-complete types arising in business, commerce, engineering, large-scale industries, and many other areas. To address these wide areas of applications and to improve upon their drawbacks, many variations and modifications of GAs have been proposed.The GA variation proposed in this paper has four basic operators:reproduction, recombinationand twomutation operators, particularly applied to the famous and extensively studiedTraveling Salesman Problem(TSP) in large-scale combinatorial optimization. Three of the operators use diversity information (standard deviation of costs) from the current population to adjust the diversity of the next population. The fourth one is an introduced new mutation operator calledp-displacementthat simulates theLamarckian evolutionary learning and trainingconcepts of gene improvement to bring chromosomes to their local optimum. We call the proposed GA:Lamarckian Genetic Algorithm-Traveling Salesman Problem(LGA-TSP). Emprical results show performance improvements compared to the classic and other modified GAs, as well as simulated annealing.
Keywords: optimization; genetic algorithms; Lamarckian evolutionary learning; Traveling Salesman Problem (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:
Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0219525999000229
Access to full text is restricted to subscribers
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:wsi:acsxxx:v:02:y:1999:i:04:n:s0219525999000229
Ordering information: This journal article can be ordered from
DOI: 10.1142/S0219525999000229
Access Statistics for this article
Advances in Complex Systems (ACS) is currently edited by Frank Schweitzer
More articles in Advances in Complex Systems (ACS) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().