Proceedings chapter
English

Learning Tabu Search for Combinatorial Optimization

Presented atAngers (France), 6-8 March 2014
PublisherPiscataway : Springer
Collection
  • Communications in Computer and Information Science; 509
Publication date2015
Abstract

In this paper, a new type of local search algorithm is proposed, called Learning Tabu Search and denoted LTS. It is assumed that any solution of the considered problem can be represented with a list of characteristics. LTS involves a learning process relying on a trail system. The trail system is based on the idea that if some combinations of characteristics often belong to good solutions during the search process, such combinations of characteristics should be favored when generating new solutions. It will be showed that LTS obtained promising results on a refueling problem in a railway network.

Keywords
  • Tabu search
  • Combinatorial optimization
  • Learning process
Citation (ISO format)
ZUFFEREY, Nicolas, SCHINDL, David. Learning Tabu Search for Combinatorial Optimization. In: Proceedings of the third International Conference Operations Research and Enterprise Systems - ICORES 2014. Pinson, E. & Valente, F. & Vitoriano, B. (Ed.). Angers (France). Piscataway : Springer, 2015. p. 3–11. (Communications in Computer and Information Science) doi: 10.1007/978-3-319-17509-6_1
Main files (1)
Proceedings chapter (Accepted version)
accessLevelPrivate
Identifiers
ISBN978-3-319-17508-9
650views
0downloads

Technical informations

Creation08/06/2015 20:35:00
First validation08/06/2015 20:35:00
Update time14/03/2023 23:23:15
Status update14/03/2023 23:23:15
Last indexation31/10/2024 00:30:53
All rights reserved by Archive ouverte UNIGE and the University of GenevaunigeBlack