Byron  Campo Zuniga, Adel  Mendoza Mendoza, Daniel  Mendoza Casseres, 
    Algorithms Heuristic for Solving the of Open Vehicle Routing Problem,
    Journal of Engineering and Applied Sciences,
    Volume 14,Issue 9,
    2019,
    Pages 2993-2998,
    ISSN 1816-949x,
    jeasci.2019.2993.2998,
    (https://makhillpublications.co/view-article.php?doi=jeasci.2019.2993.2998)
    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.
    Keywords: PST-Prim algorithm;performance;heuristics;techniques;trivial solution;consumed