| Creator |
|
|
|
|
|
|
|
| Language |
|
| Publisher |
|
| Date |
|
| Source Title |
|
| Vol |
|
| First Page |
|
| Last Page |
|
| Publication Type |
|
| Access Rights |
|
| Related DOI |
|
| Related DOI |
|
|
|
|
|
|
|
| Related URI |
|
|
|
|
|
|
|
| Related URI |
|
| Related HDL |
|
| Relation |
|
|
|
|
|
|
|
| Abstract |
To practically solve NP-hard combinatorial optimizationproblems, local search algorithms and their parallel implementations on PVM or MPI have been frequently discussed. Since a huge number of neighbo...rs 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 key concept is neighborhood composition. We demonstrate how this idea improves parallel implementations on PVM, by taking as examples well-known local search algorithms for the Traveling Salesman Problem.show more
|
Export Mendeley
pvmmpi