Sciweavers

51 search results - page 4 / 11
» An Improved Greedy Genetic Algorithm for Solving Travelling ...
Sort
View
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
13 years 6 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...
EVOW
2004
Springer
13 years 10 months ago
A Comparison of Adaptive Operator Scheduling Methods on the Traveling Salesman Problem
Abstract. The implementation of an evolutionary algorithm necessarily involves the selection of an appropriate set of genetic operators. For many real-world problem domains, an inc...
Wouter Boomsma
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
13 years 11 months ago
A genetic algorithm for privacy preserving combinatorial optimization
We propose a protocol for a local search and a genetic algorithm for the distributed traveling salesman problem (TSP). In the distributed TSP, information regarding the cost funct...
Jun Sakuma, Shigenobu Kobayashi
GECCO
2005
Springer
182views Optimization» more  GECCO 2005»
13 years 10 months ago
Improving EAX with restricted 2-opt
Edge Assembly Crossover (EAX) is by far the most successful crossover operator in solving the traveling salesman problem (TSP) with Genetic Algorithms (GAs). Various improvements ...
Chen-hsiung Chan, Sheng-An Lee, Cheng-Yan Kao, Hua...
EMO
2003
Springer
137views Optimization» more  EMO 2003»
13 years 10 months ago
A Two-Phase Local Search for the Biobjective Traveling Salesman Problem
This article proposes the Two-Phase Local Search for finding a good approximate set of non-dominated solutions. The two phases of this procedure are to (i) generate an initial sol...
Luis Paquete, Thomas Stützle