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...

Descrición completa

Gardado en:
Detalles Bibliográficos
Publicado en:International Journal of Combinatorial Optimization Problems and Informatics
Main Authors: Alejandro Fuentes-Penna, Marisa Estrada-Carrillo, Ivette Flores-Jiménez, Ruth Flores-Jiménez, Silvia S. Moreno-Gutiérrez
Formato: Artigo
Idioma:Inglês
Publicado: International Journal of Combinatorial Optimization Problems and Informatics 2014
Assuntos:
Computación
Tabu Search
Ant Colony Optimization
Project Scheduling Problem
Travelin g Salesman Problem
Acceso en liña:https://www.redalyc.org/articulo.oa?id=265232978002
Tags: Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!

Títulos similares