MPI-INF D1 Publications: Part of a Book - Neumann,Sudholt,Witt Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search

Part, Chapter of a Book
@InBook, Buchkapitel
Beitrag im Sammelband

Show entries of:

this year (2023) | last year (2022) | two years ago (2021) | Notes URL

Action:

Options:

Library locked

Goto entry point

Author, Editor

Author(s):

Neumann, Frank
Sudholt, Dirk
Witt, Carsten

dblp
dblp
dblp

Not MPG Author(s):

Sudholt, Dirk
Witt, Carsten

Editor(s):

Lim, Chee Peng
Jain, Lakhmi C.
Dehuri, Satchidananda

dblp
dblp
dblp

Not MPII Editor(s):

Lim, Chee Peng
Jain, Lakhmi C.
Dehuri, Satchidananda

BibTeX cite key*:

NSWACOchapter09

Title, Booktitle

Title*:	Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search
Booktitle*:	Innovations in Swarm Intelligence
Chapter:
Series:	Studies in Computational Intelligence
Language:	English

Publisher

Name*:	Springer	URL:
Address*:	Berlin, Germany	Publication Type:

Vol, No, pp., Year

Volume:	248	Number:
Edition:		Pages*:	91-120
Month:		VG Wort Pages:
ISBN:	978-3-642-04224-9	Year*:	2009

Abstract, Links, ©

Note:
LaTeX Abstract:	he computational complexity of ant colony optimization (ACO) is a new and rapidly growing research area. The finite-time dynamics of ACO algorithms is assessed with mathematical rigor using bounds on the (expected) time until an ACO algorithm finds a global optimum. We review previous results in this area and introduce the reader into common analysis methods. These techniques are then applied to obtain bounds for different ACO algorithms on classes of pseudo-Boolean problems. The resulting runtime bounds are further used to clarify important design issues from a theoretical perspective. We deal with the question whether the current best-so-far solution should be replaced by new solutions with the same quality. Afterwards, we discuss the hybridization of ACO with local search and present examples where introducing local search leads to a tremendous speed-up and to a dramatic loss in performance, respectively.
URL Abstract:
Tags, Keywords:
Copyright Message:
HyperLinks / References / URLs:
Personal Comments:
Download Access Level:	Public

Correlation

MPG Unit:	Max-Planck-Institut für Informatik

MPG Subunit:	Algorithms and Complexity Group
Appearance:	MPII WWW Server, MPII FTP Server, MPG publications list, university publications list, working group publication list, Fachbeirat, VG Wort

BibTeX Entry:

@INBOOK{NSWACOchapter09,
AUTHOR = {Neumann, Frank and Sudholt, Dirk and Witt, Carsten},
EDITOR = {Lim, Chee Peng and Jain, Lakhmi C. and Dehuri, Satchidananda},
TITLE = {Computational Complexity of Ant Colony Optimization and Its Hybridization with Local Search},
BOOKTITLE = {Innovations in Swarm Intelligence},
PUBLISHER = {Springer},
YEAR = {2009},
VOLUME = {248},
PAGES = {91--120},
SERIES = {Studies in Computational Intelligence},
ADDRESS = {Berlin, Germany},
ISBN = {978-3-642-04224-9},
DOI = {10.1007/978-3-642-04225-6_6},
}

Entry last modified by Anja Becker, 03/09/2010

Edit History (please click the blue arrow to see the details)

	Editor(s) [Library]	Created 02/12/2010 09:07:36
Revision 1. 0.	Editor Anja Becker Frank Neumann	Edit Date 09.03.2010 13:31:24 02/12/2010 09:07:36 AM

Attachment Section