Title: Meta-Heuristic Algorithm based on Ant Colony Optimization Algorithm, Tabu Search and Project Scheduling Problem (PSP) for the 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.
Publication Year: 2014
Publication Date: 2014-12-25
Language: en
Type: article
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot