Sciweavers

1310 search results - page 109 / 262
» A parallel genetic algorithm to solve the set-covering probl...
Sort
View
PVM
2004
Springer
15 years 3 months ago
Neighborhood Composition: A Parallelization of Local Search Algorithms
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Mas...
TEC
2002
88views more  TEC 2002»
14 years 9 months ago
Parallelism and evolutionary algorithms
Abstract--This paper contains a modern vision of the parallelization techniques used for evolutionary algorithms (EAs). The work is motivated by two fundamental facts: first, the d...
Enrique Alba, Marco Tomassini
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
15 years 1 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
ICCS
2009
Springer
15 years 4 months ago
Experience with Approximations in the Trust-Region Parallel Direct Search Algorithm
Recent years have seen growth in the number of algorithms designed to solve challenging simulation-based nonlinear optimization problems. One such algorithm is the Trust-Region Par...
S. M. Shontz, V. E. Howle, P. D. Hough
PPSN
2004
Springer
15 years 3 months ago
SPEA2+: Improving the Performance of the Strength Pareto Evolutionary Algorithm 2
Multi-objective optimization methods are essential to resolve real-world problems as most involve several types of objects. Several multi-objective genetic algorithms have been pro...
Mifa Kim, Tomoyuki Hiroyasu, Mitsunori Miki, Shiny...