Sciweavers

715 search results - page 6 / 143
» Neighborhood structures for genetic local search algorithms
Sort
View
PVM
2004
Springer
14 years 21 days 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...
FOGA
2007
13 years 8 months ago
Neighborhood Graphs and Symmetric Genetic Operators
In the case where the search space has a group structure, classical genetic operators (mutation and two-parent crossover) which respect the group action are completely characterize...
Jonathan E. Rowe, Michael D. Vose, Alden H. Wright
GECCO
2004
Springer
125views Optimization» more  GECCO 2004»
14 years 22 days ago
Population-Based Iterated Local Search: Restricting Neighborhood Search by Crossover
Abstract. Iterated local search (ILS) is a powerful meta-heuristic algorithm applied to a large variety of combinatorial optimization problems. Contrary to evolutionary algorithms ...
Dirk Thierens
HM
2007
Springer
135views Optimization» more  HM 2007»
14 years 1 months ago
Hybrid Local Search Techniques for the Resource-Constrained Project Scheduling Problem
This paper proposes a local search algorithm that makes use of a complex neighborhood relation based on a hybridization with a constructive heuristics for the classical resource-co...
Igor Pesek, Andrea Schaerf, Janez Zerovnik
LSGRID
2004
Springer
14 years 22 days ago
Mega Process Genetic Algorithm Using Grid MP
In this study, a new Genetic Algorithm (GA) using the Tabu · Local Search mechanism is proposed. The GA described in this paper is considered a Mega Process GA, which has an effe...
Yoshiko Hanada, Tomoyuki Hiroyasu, Mitsunori Miki,...