A greedy randomized adaptive search procedure application to solve the travelling salesman problem

The main objective of this article is to show an algorithm capable to find a minimal total length evaluation function roundtrip in symmetric Travelling Salesman Problem (TSP). Application of concepts related to Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristics, with a 2D Euclidean d...

Full description

Bibliographic Details
Main Authors: Alvaro Neuenfeldt Júnior, Lucas Rebouças Guimarães
Format: Article
Language:English
Published: University of Novi Sad, Faculty of Technical Sciences 2019-12-01
Series:International Journal of Industrial Engineering and Management
Subjects:
Online Access:http://ijiemjournal.org/counter/click.php?id=vol10_03_04