Journal of Engineering and Applied Sciences
ISSN: Online 1818-7803ISSN: Print 1816-949x
Abstract
This study describes and compares the performance of two heuristics (PST-Prim and modified nearest neighbor algorithm) with three extended use heuristic algorithms (nearest neighbor, random solution and trivial solution). The five techniques are used to solve the problem of open routing of OVRP vehicles. Seventeen comparative problems of extended use were used. The technique that obtained the best performance in terms of objective function (in 82% of the solutions) and route with the least travel (in 71% of the solutions) was the PST-Prim algorithm. The trivial solution algorithm was the one that consumed the least execution time.
How to cite this article:
Byron Campo Zuniga, Adel Mendoza Mendoza and Daniel Mendoza Casseres. Algorithms Heuristic for Solving the of Open Vehicle Routing Problem.
DOI: https://doi.org/10.36478/jeasci.2019.2993.2998
URL: https://www.makhillpublications.co/view-article/1816-949x/jeasci.2019.2993.2998