Learning classifier systems for optimisation problems: A case study on fractal travelling salesman problem
This paper presents a set of experiments on the use of Learning Classifier Systems for the purpose of solving combinatorial optimisation problems. We demonstrate our approach with a set of Fractal Travelling Salesman Problem (TSP) instances for which it is possible to know by construction the optima...
Guardado en:
Autores principales: | Tabacman, Maximiliano, Loiseau, Irene |
---|---|
Publicado: |
2008
|
Materias: | |
Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_97816055_v_n_p2039_Tabacman http://hdl.handle.net/20.500.12110/paper_97816055_v_n_p2039_Tabacman |
Aporte de: |
Ejemplares similares
-
Learning classifier systems for optimisation problems: A case study on fractal travelling salesman problem
por: Tabacman, M., et al. -
Facets and valid inequalities for the time-dependent travelling salesman problem
por: Miranda Bront, Juan José, et al.
Publicado: (2014) -
Facets and valid inequalities for the time-dependent travelling salesman problem
por: Miranda-Bront, J.J., et al. -
Solving the Traveling Salesman Problem with release dates via branch and cut
por: Miranda Bront, Juan José, et al.
Publicado: (2023) -
Global convexity in the bi-criteria Traveling Salesman problem
por: Barán, Benjamín, et al.
Publicado: (2006)