Global versus local search: the impact of population sizes on evolutionary algorithm performance
DOI10.1007/S10898-016-0417-5zbMATH Open1356.90113OpenAlexW2281123596MaRDI QIDQ727394FDOQ727394
Authors: Thomas Weise, Yuezhong Wu, Raymond Chiong, Ke Tang, Jörg Lässig 
Publication date: 6 December 2016
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0417-5
Recommendations
- Local Search in Evolutionary Algorithms: The Impact of the Local Search Frequency
- Population size versus runtime of a simple evolutionary algorithm
- Optimizing epochal evolutionary search: Population-size dependent theory
- Evolutionary Algorithms for Global Optimization
- scientific article; zbMATH DE number 1822278
- Local and global evaluation functions for computational evolution
- Evaluating the effects of local search in genetic programming
Approximation methods and heuristics in mathematical programming (90C59) Nonconvex programming, global optimization (90C26)
Cites Work
- The traveling salesman problem. A computational study.
- TSPLIB—A Traveling Salesman Problem Library
- Theory and Applications of Satisfiability Testing
- BIANCA: a genetic algorithm to solve hard combinatorial optimisation problems in engineering
- Title not available (Why is that?)
- Optimization by simulated annealing
- Title not available (Why is that?)
- Tabu Search—Part I
- Evolution strategies. A comprehensive introduction
- The traveling salesman problem and its variations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
- Tabu Search—Part II
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Evolutionary computation: a unified approach.
- A study of global optimization using particle swarms
- On the convergence of a population-based global optimization algorithm
- Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
- Traveling salesman problem heuristics: leading methods, implementations and latest advances
- The algebra of genetic algorithms
- Evolutionary optimization: pitfalls and booby traps
- A large population size can be unhelpful in evolutionary algorithms
- Crossover can provably be useful in evolutionary computation
- Data Structures for Traveling Salesmen
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
- Population size versus runtime of a simple evolutionary algorithm
- A \(k\)-level data structure for large-scale traveling salesman problems
- Dynamic analysis for the selection of parameters and initial population, in particle swarm optimization
- On initial populations of a genetic algorithm for continuous optimization problems
- Genetic algorithms with shrinking population size
- Seeking global edges for traveling salesman problem in multi-start search
- A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
- Tabu search for the BWC problem
- Parallelizing simulated annealing algorithms based on high-performance computer
Cited In (3)
Uses Software
This page was built for publication: Global versus local search: the impact of population sizes on evolutionary algorithm performance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727394)
