Meta-Heuristic Algorithm based on Ant Colony Optimization Algorithm , Tabu Search and Project Scheduling Problem (PSP) for the Traveling Salesman Problem
Traveling Salesman Problem (TSP) is focused to construct the path with the lowest distance between different places (nodes) , visiting every one once. Th is paper proposed an a lgorithm to solve TSP adding three aspects: time, cos t and effort , where the effort is calculated multiplying time, dista...
| Autores: | , , , , |
|---|---|
| Formato: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2014 |
| País: | México |
| Recursos: | Universidad Autónoma del Estado de Hidalgo |
| Repositorio: | Redalyc-UAEH |
| OAI Identifier: | oai:redalyc.org:265232978002 |
| Acesso em linha: | https://www.redalyc.org/articulo.oa?id=265232978002 |
| Access Level: | acceso abierto |
| Palavra-chave: | Computación Tabu Search Ant Colony Optimization Project Scheduling Problem Travelin g Salesman Problem |
| Resumo: | Traveling Salesman Problem (TSP) is focused to construct the path with the lowest distance between different places (nodes) , visiting every one once. Th is paper proposed an a lgorithm to solve TSP adding three aspects: time, cos t and effort , where the effort is calculated multiplying time, distance and cost facto rs and dividing by the sum of them ; the aim of this estimation is optimizing the best way to visit the cities graph. |
|---|