The GENIE is Out! (Who Needs Fitness to Evolve?)

Stephen Chen, Stephen Smith, and Cesar Guerra-Salcedo
CEC99: Proceedings of the Congress on Evolutionary Computation, 1999.


Download
  • Adobe portable document format (pdf) (27KB)
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract
"Survival of the fittest" is often seen as the driving force behind adaptation and evolution. For sure, all evolutionary algorithms use fitness-based selection. However, it is not necessary to know where you are, to know where you are going. Similarly, it is not necessary to know the fitness of a solution, to find a better solution. The GENIE algorithm uses random parent selection and a non-elitist generational replacement scheme. Experiments on a non-trivial instance of the Traveling Salesman Problem show that heuristic operators in GENIE can converge to the optimal solution without evaluating fitness.

Keywords
genetic algorithms, commonality hypothesis, Traveling Salesman Problem, heuristic amplification

Notes
Associated Center(s) / Consortia: Center for Integrated Manfacturing Decision Systems
Associated Lab(s) / Group(s): Intelligent Coordination and Logistics Laboratory

Text Reference
Stephen Chen, Stephen Smith, and Cesar Guerra-Salcedo, "The GENIE is Out! (Who Needs Fitness to Evolve?)," CEC99: Proceedings of the Congress on Evolutionary Computation, 1999.

BibTeX Reference
@inproceedings{Chen_1999_558,
   author = "Stephen Chen and Stephen Smith and Cesar Guerra-Salcedo",
   title = "The GENIE is Out! (Who Needs Fitness to Evolve?)",
   booktitle = "CEC99: Proceedings of the Congress on Evolutionary Computation",
   year = "1999",
}