Sciweavers

30 search results - page 1 / 6
» A Comparative Study of Five Parallel Genetic Algorithms Usin...
Sort
View
IPPS
1998
IEEE
13 years 8 months ago
A Comparative Study of Five Parallel Genetic Algorithms Using the Traveling Salesman Problem
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
Lee Wang, Anthony A. Maciejewski, Howard Jay Siege...
GECCO
2009
Springer
147views Optimization» more  GECCO 2009»
13 years 11 months ago
Evolutionary algorithms and multi-objectivization for the travelling salesman problem
This paper studies the multi-objectivization of single-objective optimization problems (SOOP) using evolutionary multi-objective algorithms (EMOAs). In contrast to the single-obje...
Martin Jähne, Xiaodong Li, Jürgen Branke
PPSN
2010
Springer
13 years 2 months ago
A Hybrid Genetic Algorithm for the Traveling Salesman Problem Using Generalized Partition Crossover
We present a hybrid Genetic Algorithm that incorporates the Generalized Partition Crossover (GPX) operator to produce an algorithm that is competitive with the state of the art for...
Darrell Whitley, Doug Hains, Adele E. Howe
CEC
2003
IEEE
13 years 9 months ago
Adaptive temperature schedule determined by genetic algorithm for parallel simulated annealing
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
Mitsunori Miki, Tomoyuki Hiroyasu, Jun'ya Wako, Ta...
ANTSW
2006
Springer
13 years 8 months ago
Parallel Ant Colony Optimization for the Traveling Salesman Problem
There are two reasons for parallelizing a metaheuristic if one is interested in performance: (i) given a fixed time to search, the aim is to increase the quality of the solutions f...
Max Manfrin, Mauro Birattari, Thomas Stützle,...