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

Abstract

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 distance between nodes and return to start point. It was implemented through two instances defined in the TSPLIB. As results, it was observed that in all iterations the value of the initial solution, such as constructive heuristic, minimized over the course of local search optimization process, developed by the assumptions of the 2-Opt heuristics, where the best results found (836909 km) was established for simulation considering a total of 5000 iterations. The traditional TSP solution has a strong implication in determining product delivery routes for customers established in different locations, inspired by the vendors' need to deliver products in different locations (the cities) using a shorter route, reducing the time required for the trip and the possible costs. Furthermore, the use of efficient TSP resolution methods can be adapted to applications found in industrial process practices, such as determining the delivery routes of materials to traverse a range of sectors from a common distribution center.

Additive and subtractive rapid prototyping techniques: a comparative analysis of FDM & CNC processes

“…The alternatives ranking step is concluded with technical reports elaboration to describe the performance of each RP process alternative, concerning the established CSF and sub-criteria. This is accomplished in order of summarizing the main points found during the measurement, recommending possible actions to improve the RP techniques performance [39].…”

Optimización de las rutas para la intervención de pozos de petróleo

“…Durante los últimos cincuenta años, el problema del agente viajero (TSP) se considera uno de los temas más importantes para explorar los problemas de optimización de la investigación operativa, principalmente debido a su naturaleza de formulación más pura, centrada en algunas de las aplicaciones más importantes relacionadas con la práctica, ocupaciones, tales como, por ejemplo, en algunas áreas de planificación industrial, logística de carga, enrutamiento de vehículos y configuración de máquinas conforme lo menciona (Júnior y Guimarães, 2019). Con relación a las variantes del TSP, las variantes de TSP y VRP se implementan utilizando el lenguaje de programación Delphi.…”