265 search results - page 1 / 53 » Neighborhood Composition: A Parallelization of Local Search ... |
PVM
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. To practically solve NP-hard combinatorial optimization problems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed....
IPPS
1999
IEEE
13 years 9 months ago
1999
IEEE
In parallel processing systems, a fundamental consideration is the maximization of system performance through task mapping. A good allocation strategy may improve resource utilizat...
IPPS
2010
IEEE
13 years 2 months ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
ICTAI
2006
IEEE
13 years 10 months ago
2006
IEEE
Standard tabu search methods are based on the complete exploration of current solution neighborhood. However, for some problems with very large neighborhood or time-consuming eval...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Iterated local search (ILS) is a powerful meta-heuristic algorithm applied to a large variety of combinatorial optimization problems. Contrary to evolutionary algorithms ...