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. Since a huge number of neighbors may be examined to discover a locally optimal neighbor in each of local search calls, many of parallelization schemes, excluding so-called the multi-start parallel scheme, try to extract parallelism from a local search by distributing the examinations of neighbors to processors. However, in straightforward implementations, when the next local search starts, all the processors will be assigned to the neighbors of the latest solution, and the results of all (but one) examinations in the previous local search are thus discarded in vain, despite that they would contain useful information on further search. This paper explores the possibility of extracting information even from unsuccessful neighbor examinations in a systematic way to boost parallel local search algorithms. Our ke...

• Type: Conference
• Year: 2004
• Where: PVM
• Authors: Yuichi Handa, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita
• Keywords: Local Search, Local Search Algorithms, Parallel Implementations, PVM 2004