Open AccessMeta-Heuristic Algorithm based on Ant Colony Optimization Algorithm and Project Scheduling Problem (PSP) for the Traveling Salesman Problem
Author(s) -
Alejandro Fuentes-Penna,
Jorge A. Ruíz-Vanoye,
Marcos S. González-Ramírez
Publication year - 2021
Publication title -
international journal of computers and communications
Language(s) - English
Resource type - Journals
ISSN - 2074-1294
DOI - 10.46300/91013.2021.15.12
Subject(s) - travelling salesman problem , ant colony optimization algorithms , algorithm , scope (computer science) , computer science , mathematical optimization , scheduling (production processes) , christofides algorithm , bottleneck traveling salesman problem , mathematics , programming language
The main target of Traveling Salesman Problem (TSP) is to construct the path with the lowest time between different cities, visiting every one once. The Scheduling Project Ant Colony Optimization (SPANCO) Algorithm proposes a way to solve TSP problems adding three aspects: time, cost effort and scope, where the scope is the number of cities, the effort is calculated multiplying time, distance and delivering weight factors and dividing by the sum of them and optimizing the best way to visit the cities graph.