Proceedings chapter
Open access

Ant Local Search for Combinatorial Optimization

ContributorsZufferey, Nicolasorcid
PublisherBerlin : Springer
  • Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering; 134
Publication date2014

In ant algorithms, each individual ant makes decisions according to the greedy force (short term profit) and the trail system based on the history of the search (information provided by other ants). Usually, each ant is a constructive process, which starts from scratch and builds step by step a complete solution of the considered problem. In contrast, in Ant Local Search (ALS), each ant is a local search, which starts from an initial solution and tries to improve it iteratively. In this paper are presented and discussed successful adaptations of ALS to different combinatorial optimization problems: graph coloring, a refueling problem in a railway network, and a job scheduling problem.

  • Ant algorithms
  • Local search
  • Combinatorial optimization
Citation (ISO format)
ZUFFEREY, Nicolas. Ant Local Search for Combinatorial Optimization. In: Bio-Inspired Models of Network, Information, and Computing Systems: 7th International ICST Conference, BIONETICS 2012 (Lugano, Switzerland, Dec. 2012). Berlin : Springer, 2014. p. 233–236. (Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering) doi: 10.1007/978-3-319-06944-9_16
Main files (1)
Proceedings chapter (Accepted version)

Technical informations

Creation03/03/2015 4:01:00 PM
First validation03/03/2015 4:01:00 PM
Update time03/14/2023 10:56:32 PM
Status update03/14/2023 10:56:32 PM
Last indexation10/18/2023 10:12:53 PM
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack