Global versus local search: the impact of population sizes on evolutionary algorithm performance

DOI10.1007/s10898-016-0417-5zbMath1356.90113OpenAlexW2281123596MaRDI QIDQ727394

Thomas Weise, Ke Tang, Jörg Lässig, Yuezhong Wu, Raymond Chiong

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

zbMATH Keywords

traveling salesman problemevolutionary computationstatisticsexperimentationpopulation size

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Approximation methods and heuristics in mathematical programming (90C59)

Uses Software

• TSPLIB
• BIANCA
• UBCSAT
• LKH
• Concorde
• SIGOA

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Evolutionary optimization: pitfalls and booby traps
• Crossover can provably be useful in evolutionary computation
• Traveling salesman problem heuristics: leading methods, implementations and latest advances
• A large population size can be unhelpful in evolutionary algorithms
• A \(k\)-level data structure for large-scale traveling salesman problems
• A study of global optimization using particle swarms
• Dynamic analysis for the selection of parameters and initial population, in particle swarm optimization
• BIANCA: a genetic algorithm to solve hard combinatorial optimisation problems in engineering
• Genetic algorithms with shrinking population size
• Seeking global edges for traveling salesman problem in multi-start search
• On initial populations of a genetic algorithm for continuous optimization problems
• General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic
• Evolution strategies. A comprehensive introduction
• The traveling salesman problem and its variations
• On the convergence of a population-based global optimization algorithm
• Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
• The algebra of genetic algorithms
• Tabu search for the BWC problem
• From simulated annealing to stochastic continuation: a new trend in combinatorial optimization
• Parallelizing simulated annealing algorithms based on high-performance computer
• A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
• Population size versus runtime of a simple evolutionary algorithm
• TSPLIB—A Traveling Salesman Problem Library
• Tabu Search—Part I
• Tabu Search—Part II
• Data Structures for Traveling Salesmen
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Theory and Applications of Satisfiability Testing

This page was built for publication: Global versus local search: the impact of population sizes on evolutionary algorithm performance