Proceedings chapter (Author postprint) (313 Kb) - 
Private accessOther version: http://link.springer.com/chapter/10.1007%2F978-3-319-17509-6_1
Highlights
More informations
Chapitre d'actes
unige:73313 
 |
Learning Tabu Search for Combinatorial Optimization |
|
| Authors | ||
| Published in | Pinson, E. & Valente, F. & Vitoriano, B. Proceedings of the third International Conference Operations Research and Enterprise Systems - ICORES 2014. Angers (France) - 6-8 March 2014 - Piscataway: Springer. 2015, p. 3-11 | |
| Collection |
Communications in Computer and Information Science; 509 |
|
| 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 | |
| Identifiers | ISBN: 978-3-319-17508-9 | |
| Full text |
Proceedings chapter (Author postprint) (313 Kb) - Private access Other version: http://link.springer.com/chapter/10.1007%2F978-3-319-17509-6_1 |
|
| Structures | ||
| Citation (ISO format) | ZUFFEREY, Nicolas, SCHINDL, David. Learning Tabu Search for Combinatorial Optimization. In: Pinson, E. & Valente, F. & Vitoriano, B. (Ed.). Proceedings of the third International Conference Operations Research and Enterprise Systems - ICORES 2014. Angers (France). Piscataway : Springer, 2015. p. 3-11. (Communications in Computer and Information Science; 509) https://archive-ouverte.unige.ch/unige:73313 |
170 hits 
0 download 
Contact an author
Update