Hybrid evolutionary algorithms for the TSP
Even if simply stated the travelling salesman problem (TSP) is one of the most studied NP-hard problems. Many algorithms have been proposed to solve TSP. Dynamic programming and branch and bound techniques provided the global optimum solution for the largest nontrivial instance of TSP with 7397 citi...
Guardado en:
| Autores principales: | Minetti, Gabriela F., Hugo, Alfonso, Gallard, Raúl Hector |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Español |
| Publicado: |
2001
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/21662 |
| Aporte de: |
Ejemplares similares
-
Hybridizing multi-inver-over evolutionary algorithms with tabu search for the symmetric TSP
por: Bermúdez, Carlos, et al.
Publicado: (2001) -
Hybrid evolutionary algorithms to solve scheduling problems
por: Minetti, Gabriela F., et al.
Publicado: (2002) -
Facing the job shop scheduling problem wih hybrid evolutionary algorithms
por: Salto, Carolina, et al.
Publicado: (2001) -
Incorporating tabu search for local search into evolutionary algorithms to solve the job shop scheduling problem
por: Fernandez, Natalia, et al.
Publicado: (2001) -
A comparison of fitness scallng methods in evolutionary algorithms
por: Bertone, E., et al.
Publicado: (1999)