An Analysis of a Reordering Operator with Tournament Selection on a GA-Hard Problem

No abstract is available for this paper.

• Publication year

  2003

• Venue

  Annual Conference on Genetic and Evolutionary Computation

• Publication date

  2003-07-12

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/3-540-45105-6_96
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation

  2004cited by this paper
• Epistasis and Deceptivity

  1999cited by this paper
• The minimal deceptive problem revisited: The role of "genetic waste"

  1998cited by this paper
• Proceedings of the 6th International Conference on Genetic Algorithms

  1995cited by this paper
• Toward a Better Understanding of Mixing in Genetic Algorithms

  1993cited by this paper
• Genetic Algorithms, Noise, and the Sizing of Populations

  1992cited by this paper
• Deception Considered Harmful

  1992cited by this paper
• Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence

  1992cited by this paper
• A Comparison of Genetic Sequencing Operators

  1991cited by this paper
• Proceedings of the fourth international conference on Genetic algorithms

  1991cited by this paper
• A Comparative Analysis of Selection Schemes Used in Genetic Algorithms

  1990cited by this paper
• The “molecular” traveling salesman

  1990cited by this paper
• An analysis of a reordering operator on a GA-hard problem

  1990influential reference
• Scheduling Problems and Traveling Salesmen: The Genetic Edge Recombination Operator

  1989cited by this paper
• A Study of Permutation Crossover Operators on the Traveling Salesman Problem

  1987cited by this paper
• Genetic Algorithms and Simulated Annealing

  1987cited by this paper
• Simple Genetic Algorithms and the Minimal, Deceptive Problem

  1987influential reference
• Alleles, loci and the traveling salesman problem

  1985cited by this paper
• Applying Adaptive Algorithms to Epistatic Domains

  1985cited by this paper
• AllelesLociand the Traveling Salesman Problem

  1985cited by this paper
• A learning system based on genetic adaptive algorithms

  1980cited by this paper
• Nonlinearities In Genetic Adaptive Search

  1972cited by this paper
• Adaptive search using simulated evolution

  1970cited by this paper
• The behavior of adaptive systems which employ genetic and correlation algorithms : technical report

  1967cited by this paper

• Energy efficient resource management for real-time IoT applications

  2025cites this paper
• Use of RBM for Identifying Linkage Structures of Genetic Algorithms

  2016cites this paper
• A Novel Methodology for Genetic Algorithms in Crossover Operation: Segment Replacement Opeartor

  2014cites this paper
• Performance analysis of a novel crossover technique on permutation encoded genetic algorithms

  2014cites this paper
• PERFORMANCE ANALYSIS OF LINKAGE LEARNING TECHNIQUES IN GENETIC ALGORITHMS

  2013cites this paper
• Heuristics based Learning on Human Psychology

  2013cites this paper
• Managing severe airspace flow programs: The Airlines' side of the problem

  2007cites this paper
• A Survey of Linkage Learning Techniques in Genetic and Evolutionary Algorithms

  2007cites this paper
• Extending the Scalability of Linkage Learning Genetic Algorithms: Theory & Practice

  2005cites this paper
• Crossover, Population Dynamics, and Convergence in the GAuGE System

  2004cites this paper
• Efficient Crossover in the GAuGE System

  2004cites this paper
• Extending the Scalability of Linkage Learning Genetic Algorithms: Theory and Practice

  2004cites this paper
• in the GAuGE System

  year unknowncites this paper