THE PATH RELINKING METHOD IN THE SHORTEST PATH SEARCH.

Abstract

In this paper the method of Path relinking or relinking paths, which is used to calculate the shortest route using an algorithm that generates iterations at high speed and very effectively finding it increasingly appears trails. It is used in order to optimize costs through the search for new paths. This algorithm is very efficient in its search to improve and you can manually calculate routes that are almost impossible to resolve and that it can be achieved. This method is used in areas such as operations research, engineering and computer science. It is more efficiently used to calculate feasible routes and transport schedules telephone operators, plan routes in the city, power grids, design routes for vehicles, production plans, among others.