Meta-Heuristic Algorithm based on Ant Colony Optimization Algorithm, Tabu Search and Project Scheduling Problem (PSP) for the Traveling Salesman Problem

Authors

  • Alejandro Fuentes-Penna Universidad Autónoma del Estado de Hidalgo
  • Marisa Estrada-Carrillo Universidad Politécnica del Estado de Morelos
  • Ivette Flores-Jiménez Universidad Autónoma del Estado de Hidalgo
  • Ruth Flores-Jiménez Universidad Autónoma del Estado de Hidalgo
  • Silvia S. Moreno-Gutiérrez Universidad Autónoma del Estado de Hidalgo

Keywords:

Tabu Search, Project Scheduling Problem, Traveling Salesman Problem

Abstract

Traveling Salesman Problem (TSP) is focused to construct the path with the lowest distance between different places (nodes), visiting every one once. This paper proposed an algorithm to solve TSP adding three aspects: time, cost and effort, where the effort is calculated multiplying time, distance and cost factors and dividing by the sum of them; the aim of this estimation is optimizing the best way to visit the cities graph.

Downloads

Published

2014-11-19

How to Cite

Fuentes-Penna, A., Estrada-Carrillo, M., Flores-Jiménez, I., Flores-Jiménez, R., & Moreno-Gutiérrez, S. S. (2014). Meta-Heuristic Algorithm based on Ant Colony Optimization Algorithm, Tabu Search and Project Scheduling Problem (PSP) for the Traveling Salesman Problem. International Journal of Combinatorial Optimization Problems and Informatics, 5(3), 2–15. Retrieved from https://ijcopi.org/ojs/article/view/63

Issue

Vol. 5 No. 3 (2014)

Section

Articles