Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/66823
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Type: | Conference paper |
Title: | Rigorous analyses for the combination of ant colony optimization and local search |
Author: | Neumann, F. Sudholt, D. Witt, C. |
Citation: | Ant Colony Optimization and Swarm Intelligence: 6th International Conference, ANTS 2008, Brussels, Belgium, September 22-24, 2008: Proceedings / M. Dorigo... et al. (eds.), pp.132-143 |
Publisher: | Springer |
Publisher Place: | Berlin |
Issue Date: | 2008 |
Series/Report no.: | Lecture Notes in Computer Science |
ISBN: | 3540875263 9783540875260 |
ISSN: | 0302-9743 1611-3349 |
Conference Name: | International Conference on Ant Colony Optimization and Swarm Intelligence (6th : 2008 : Brussels, Belgium) |
Editor: | Dorigo, M. Birattari, M. Blum, C. Clerc, M. Stutzle, T. Winfield, A.F.T. |
Statement of Responsibility: | Frank Neumann, Dirk Sudholt, and Carsten Witt |
Abstract: | Ant colony optimization (ACO) is a metaheuristic that produces good results for a wide range of combinatorial optimization problems. Often such successful applications use a combination of ACO and local search procedures that improve the solutions constructed by the ants. In this paper, we study this combination from a theoretical point of view and point out situations where introducing local search into an ACO algorithm enhances the optimization process significantly. On the other hand, we illustrate the drawback that such a combination might have by showing that this may prevent an ACO algorithm from obtaining optimal solutions. |
Description: | Also published as a journal article: Lecture notes in computer science, 2008; 5217:132-143 |
Rights: | © Springer-Verlag Berlin Heidelberg 2008 |
DOI: | 10.1007/978-3-540-87527-7 |
Published version: | https://doi.org/10.1007/978-3-540-87527-7 |
Appears in Collections: | Aurora harvest Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.