Texto completo
![[thumbnail of LARRANAGA_CAP_LIB_2002_09.pdf]](https://oa.upm.es/style/images/fileicons/application_pdf.png) |
PDF (Portable Document Format)
- Acceso permitido solamente al administrador del Archivo Digital UPM
- Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (577kB) |
Solving the traveling salesman problem with EDAs
Cita
Robles Forcada, Víctor 
ORCID: https://orcid.org/0000-0003-3937-2269, Miguel Anasagasti, Pedro de and Larrañaga Múgica, Pedro María ORCID: https://orcid.org/0000-0003-0652-9872
(2002).
Solving the traveling salesman problem with EDAs.
En:
"Estimation of Distribution Algorithms".
Genetic Algorithms and Evolutionary Computation
(2).
Springer, Boston, Estados Unidos, pp. 211-229.
ISBN 978-1-4613-5604-2.
https://doi.org/10.1007/978-1-4615-1539-5_10.
ORCID: https://orcid.org/0000-0003-3937-2269, Miguel Anasagasti, Pedro de and Larrañaga Múgica, Pedro María ORCID: https://orcid.org/0000-0003-0652-9872
(2002).
Solving the traveling salesman problem with EDAs.
En:
"Estimation of Distribution Algorithms".
Genetic Algorithms and Evolutionary Computation
(2).
Springer, Boston, Estados Unidos, pp. 211-229.
ISBN 978-1-4613-5604-2.
https://doi.org/10.1007/978-1-4615-1539-5_10.
Descripción
| Título: | Solving the traveling salesman problem with EDAs |
|---|---|
| Autor/es: |
|
| Editor/es: |
|
| Tipo de Documento: | Sección de Libro |
| Título del Libro: | Estimation of Distribution Algorithms |
| Fecha: | 2002 |
| ISBN: | 978-1-4613-5604-2 |
| Nombre de la Serie: | Genetic Algorithms and Evolutionary Computation |
| Número: | 2 |
| Materias: | |
| ODS: | |
| Palabras Clave Informales: | Traveling Salesman Problem, Evolutionary Computation, Estimation of Distribution Algorithms, Genetic Algorithms, local search heuristics |
| Escuela: | Facultad de Informática (UPM) [antigua denominación] |
| Departamento: | Inteligencia Artificial |
| Licencias Creative Commons: | Reconocimiento - Sin obra derivada - No comercial |
Resumen
In this chapter we present an approach for solving the Traveling Salesman Problem using Estimation of Distribution Algorithms (EDAs).This approach is based on using discrete and continuous EDAs to find the best possible solution. We also present a method in which domain knowledge (based on local search) is combined with EDAs to find better solutions. We show experimental results obtained on several standard examples for discrete and continuous EDAs both alone and combined with a heuristic local search.
Más información
| ID de Registro: | 81667 |
|---|---|
| Identificador DC: | https://oa.upm.es/81667/ |
| Identificador OAI: | oai:oa.upm.es:81667 |
| Identificador DOI: | 10.1007/978-1-4615-1539-5_10 |
| URL Oficial: | https://link.springer.com/chapter/10.1007/978-1-46... |
| Depositado por: | Biblioteca Facultad de Informatica |
| Depositado el: | 09 May 2024 09:11 |
| Ultima Modificación: | 09 May 2024 09:11 |
Acciones
- Estadísticas
- Exportar cita
- Editar (sólo personal del Archivo)
