Simulated Evolutionary Optimization and Local Search: Introduction and Application to Tree Search

No abstract is available for this paper.

• Publication year

  2001

• Venue

  Cladistics

• Publication date

  2001-03-01

• Fields of study

  Biology, Computer Science

• Identifiers
  DOI 10.1111/j.1096-0031.2001.tb00101.x
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Simulated annealing and Boltzmann machines

  2003cited by this paper
• Taboo Search: An Approach to the Multiple-Minima Problem for Continuous Functions

  2002cited by this paper
• Proceedings of the Genetic and Evolutionary Computation Conference

  2002cited by this paper
• Error thresholds and optimal mutation rates in genetic algorithms

  2000cited by this paper
• Multiple sequence alignment in phylogenetic analysis.

  2000cited by this paper
• The Parsimony Ratchet, a New Method for Rapid Parsimony Analysis

  1999cited by this paper
• Searching for Most Parsimonious Trees with Simulated Evolutionary Optimization

  1999influential reference
• Analyzing Large Data Sets in Reasonable Times: Solutions for Composite Optima

  1999cited by this paper
• A New Genetic Local Search Algorithm for Graph Coloring

  1998cited by this paper
• Genetic Programming

  1998influential reference
• Parallel Problem Solving from Nature — PPSN V

  1998cited by this paper
• Effectiveness of Genetic Local Search Algorithms

  1997cited by this paper
• Evolutionary computation: comments on the history and current state

  1997cited by this paper
• A Comparison of Global and Local Search Methods in Drug Docking

  1997cited by this paper
• Evolutionary algorithms in theory and practice

  1997cited by this paper
• Handbook of evolutionary computation

  1997cited by this paper
• An Introduction to Genetic Algorithms.

  1997cited by this paper
• No free lunch theorems for optimization

  1997cited by this paper
• Local Search Genetic Algorithm for Optimization of Highly Reliable Communications Networks

  1997cited by this paper
• Handbook of Evolutionary Computation

  1997cited by this paper
• Efficient Incremental Character Optimization

  1997cited by this paper
• A Comparison of Optimization Techniques for Integrated Manufacturing Planning and Scheduling

  1996cited by this paper
• METHODS FOR FASTER PARSIMONY ANALYSIS

  1996cited by this paper
• Scheduling by Genetic Local Search with Multi-Step Crossover

  1996cited by this paper
• Climbing Up NP-Hard Hills

  1996cited by this paper
• Solving Master Mind Using GAs and Simulated Annealing: A Case of Dynamic Constraint Optimization

  1996cited by this paper
• Parallel Problem Solving from Nature — PPSN IV

  1996cited by this paper
• How Learning Can Guide Evolution

  1996cited by this paper
• Genetic Algorithms + Data Structures = Evolution Programs

  1996cited by this paper
• Hybrid methods using genetic algorithms for global optimization

  1996cited by this paper
• Proceedings of the 1st annual conference on genetic programming

  1996cited by this paper
• Evolutionary Algorithms in Theory and Practice

  1996cited by this paper
• Population-Oriented Simulated Annealing: A Genetic/Thermodynamic Hybrid Approach to Optimization

  1995cited by this paper
• An Indexed Bibliography of Genetic Algorithms in Computer Aided Design

  1995cited by this paper
• Contemporary Evolution Strategies

  1995cited by this paper
• On genetic algorithms

  1995cited by this paper
• Crossover , Macromutation , and Population-Based Search

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

  1995cited by this paper
• Convergence analysis of canonical genetic algorithms

  1994cited by this paper
• An introduction to simulated evolutionary optimization

  1994cited by this paper
• Parallel Optimization of Evolutionary Algorithms

  1994cited by this paper
• Parallel Problem Solving from Nature — PPSN III

  1994cited by this paper
• Notes on the simulation of evolution

  1994cited by this paper
• Lamarckian Evolution, The Baldwin Effect and Function Optimization

  1994cited by this paper
• Selection Schemes with Spatial Isolation for Genetic Optimization

  1994cited by this paper
• Foundations of genetic algorithms. 2: L. Darrell Whitley (Ed.), Morgan Kaufmann, San Mateo, CA, 1993, ISBN 1-55860-263-1, 322 pp., US$45.95

  1994cited by this paper
• Genetic Programming with Local Hill-Climbing

  1994cited by this paper
• Long Path Problems

  1994cited by this paper
• Parallel Simulated Annealing and Genetic Algorithms: a Space of Hybrid Methods

  1994cited by this paper
• Problem-Independent Parallel Simulated Annealing using Selection and Migration

  1994cited by this paper
• Program Search with a Hierarchical Variable Lenght Representation: Genetic Programming, Simulated Annealing and Hill Climbing

  1994cited by this paper
• Drosophila Homeobox Genes

  1993cited by this paper
• The Science of Breeding and Its Application to the Breeder Genetic Algorithm (BGA)

  1993cited by this paper
• An evaluation of local improvement operators for genetic algorithms

  1993cited by this paper
• Reverse HillclimbingGenetic Algorithms and the Busy Beaver Problem

  1993cited by this paper
• Adding Learning to the Cellular Development of Neural Networks: Evolution and the Baldwin Effect

  1993cited by this paper
• Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization

  1993cited by this paper
• Crossover's Niche

  1993cited by this paper
• Applying the genetic approach to simulated annealing in solving some NP-hard problems

  1993cited by this paper
• Proceedings of the 5th International Conference on Genetic Algorithms

  1993cited by this paper
• Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence, by John H. Holland MIT Press (Bradford Books), Cambridge, Mass., 1992, xiv+211 pp. (Paperback £13.50, cloth £26.95)

  1993cited by this paper
• Comparison of Local Mating Strategies in Massively Parallel Genetic Algorithms

  1992cited by this paper
• Real-Coded Genetic Algorithms and Interval-Schemata

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

  1991cited by this paper
• Looking Around: Using Clues from the Data Space to Guide Genetic Algorithm Searches

  1991cited by this paper
• An Experimental Comparison of Binary and Floating Point Representations in Genetic Algorithms

  1991cited by this paper
• The discovery and importance of multiple islands of most

  1991cited by this paper
• The parallel genetic algorithm as function optimizer

  1991cited by this paper
• Preventing Premature Convergence in Genetic Algorithms by Preventing Incest

  1991cited by this paper
• Handbook Of Genetic Algorithms

  1990cited by this paper
• When Both Individuals and Populations Search: Adding Simple Learning to the Genetic Algorithm

  1989cited by this paper
• The effects of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem

  1989cited by this paper
• Messy Genetic Algorithms: Motivation, Analysis, and First Results

  1989cited by this paper
• Proceedings of the third international conference on Genetic algorithms

  1989cited by this paper
• Uniform Crossover in Genetic Algorithms

  1989cited by this paper
• Genetic Algorithms in Search Optimization and Machine Learning

  1988cited by this paper
• Genetic Algorithms and Simulated Annealing

  1987cited by this paper
• Optimization of Control Parameters for Genetic Algorithms

  1986cited by this paper
• Future paths for integer programming and links to artificial intelligence

  1986cited by this paper
• Optimization by Simulated Annealing

  1983cited by this paper
• The evolution of programs

  1983cited by this paper
• Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time

  1982cited by this paper
• PHYLOGENETIC ANALYSIS: MODELS AND ESTIMATION PROCEDURES

  1967cited by this paper
• How Genetic Algorithms Really Work I.mutation and Hillclimbing

  year unknowncited by this paper

• Piping Network Optimization for District Heating System using an Enhanced Genetic Algorithm Searching Method

  2024cites this paper
• COMPUTATIONAL ASPECTS OF THE PHYLOGENETIC ANALYSIS OF COMPARATIVE SEQUENCE DATA

  2016cites this paper
• Improving observability using optimal placement of phasor measurement units

  2014cites this paper
• Systematics: A Course of Lectures

  2012cites this paper
• Optimization of Customer Satisfaction Using an Improved Simulation Annealing

  2012cites this paper
• A Multi-Criterion Evolutionary Approach Applied to Phylogenetic Reconstruction

  2010cites this paper
• An Evolutionary Variable Neighborhood Search for Selecting Combinational Gene Signatures in Predicting Chemo-Response of Osteosarcoma

  2010cites this paper
• An open source phylogenetic search and alignment package

  2009cites this paper
• Improved orthogonal array based simulated annealing for design optimization

  2009cites this paper
• A new approach to construct near-optimal binary search trees using genetic algorithm

  2007cites this paper
• A new genetic approach to construct near-optimal binary search trees

  2007cites this paper
• Efficient Tree Searches with Available Algorithms

  2007cites this paper
• PsodaScript: Applying Advanced Language Constructs to Open-source Phylogenetic Search

  2007cites this paper
• Phylogeny of sipunculan worms: A combined analysis of four gene regions and morphology.

  2007cites this paper
• ExactMP: An Efficient Parallel Exact Solver for Phylogenetic Tree Reconstruction Using Maximum Parsimony

  2006influential citation
• A modern approach to rotiferan phylogeny: combining morphological and molecular data.

  2006cites this paper
• Parsimony, phylogeny, and genomics

  2006cites this paper
• Gnathostomulid phylogeny inferred from a combined approach of four molecular loci and morphology

  2006cites this paper
• Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing

  2006cites this paper
• Parsimony and Bayesian phylogenetics

  2006cites this paper
• Dynamic homology and phylogenetic systematics: a unified approach using POY

  2006cites this paper
• TNT: Tree Analysis Using New Technology

  2005cites this paper
• Pseudocode for some tree search algorithms in phylogenetics

  2005cites this paper
• Estudio de proceso de colonización y radiación adaptativa del género "Pholcus" (Araneae, Pholcidae) en el archipiélago Canario

  2005cites this paper
• Profile Parsimony (PP): an analysis under Implied Weights (IW)

  2004cites this paper
• What might Evolutionary Algorithms ( EA ) and Multi-objective Optimisation ( MOO ) Contribute to Phylogenetics and the Total Evidence Debate

  2004cites this paper
• Accelerated likelihood surface exploration: the likelihood ratchet.

  2003cites this paper
• Fast character optimization in parsimony phylogeny reconstruction

  2003cites this paper
• MOLECULAR PHYLOGENETIC ANALYSES

  2002cites this paper
• Single‐species dynamic site selection

  2002cites this paper
• Check for Pre-Processing Errors : Alignment , Orthology / Paralogy

  2002cites this paper
• Troubleshooting Molecular Phylogenetic Analyses

  2002cites this paper