Neighborhood composition A -Parallelization of local search algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3241, Issue , 2004, Pages 155-163

  Handa, Yuichi ^a   Ono, Hirotaka ^a   Sadakane, Kunihiko ^a   Yamashita, Masafumi ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; LEARNING ALGORITHMS; MESSAGE PASSING; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; SEARCH ENGINES; TRAVELING SALESMAN PROBLEM;

COMBINATORIAL OPTIMIZATION PROBLEMS; EXTRACTING INFORMATION; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; MULTISTART; PARALLEL IMPLEMENTATIONS; PARALLEL SCHEME; PARALLELIZATIONS;

LOCAL SEARCH (OPTIMIZATION);

EID: 33845575338     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30218-6_26     Document Type: Article

References (11)

1. E. Aarts and J. K. Lenstra, Local Search in Combinatorial Optimization, John Wiley & Son, 1997.
2. Y. Asahiro, M. Ishibashi, and M. Yamashita, Independent and Cooperative Parallel Search Methods for the Generalized Assignment Problem, Optimization Methods and Software, 18 (2), 129-141, 2003.
3. M. R. Garey and D. S. Johnson, Computers and Intractability A Guide to the Theory of NP-Completeness, Freeman, 1979.
4. P.E. Gill, W. Murray and M.H. Wright, Practical Optimization, Academic Press. 1981.
5. K.Helsgaun, An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic, European Journal of Operational Research 126 (1), 106-130, 2000.
6. E. L. Lawler, J. K. Lenstra, A. H. G Rinnooy Kan and D. B. Shmoys, The Traveling Salesman Problem, A Guided Tour of Combinatorial Optimization, John Wiley and Sons 1985.
7. S. Vandewalle, R. V. Driesschie, and R. Piessens, The parallel performance of standard parabolic marching schemes, International Journals of Super Scomputing, 3 (1), 1-29, 1991.
8. V. V. Vazirani, Approximation Algorithms, SpringerVerlag, 200.
9. A. S. Wagner, H. V. Sreekantaswamy, S. T. Chanson, Performance Models for the Processor Farm Paradigm, IEEE Transactions on Parallel and Distributed Systems, 8 (5), 475-489, 1997.
10. M. Yagiura and T. Ibaraki, On Metaheuristic Algorithms for Combinatorial Optimization Problems, Systems and Computers in Japan, 32 (3), 33-55, 2001.
11. M. Yagiura, T. Ibaraki and F. Glover, An Ejection Chain Approach for the Generalized Assignment Problem, INFORMS Journal on Computing, 16, 133-151, 2004.