An Enhanced Ant Colony System for the Sequential Ordering Problem

L. M. Gambardella (), R. Montemanni () and D. Weyland ()
Additional contact information
L. M. Gambardella: Istituto Dalle Molle di Studi sull’Intelligenza Artificiale
R. Montemanni: Istituto Dalle Molle di Studi sull’Intelligenza Artificiale
D. Weyland: Istituto Dalle Molle di Studi sull’Intelligenza Artificiale

A chapter in Operations Research Proceedings 2011, 2012, pp 355-360 from Springer

Abstract: Abstract A well-known Ant Colony System algorithm for the Sequential Ordering Problem is studied to identify its drawbacks. Some criticalities are identified, and an Enhanced Ant Colony System method that tries to overcome them, is proposed. Experimental results show that the enhanced method clearly outperforms the original algorithm and becomes a reference method for the problem under investigation.

Keywords: Local Search; Travelling Salesman Problem; Precedence Constraint; Local Search Procedure; Hybrid Particle Swarm Optimization (search for similar items in EconPapers)
Date: 2012
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-642-29210-1_57

Ordering information: This item can be ordered from
http://www.springer.com/9783642292101

DOI: 10.1007/978-3-642-29210-1_57

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().