TY  - JOUR
T1  - Algorithms Heuristic for Solving the of Open Vehicle Routing Problem
AU - Campo Zuniga, Byron AU - Mendoza Mendoza, Adel AU - Mendoza Casseres, Daniel 
JO  - Journal of Engineering and Applied Sciences
VL  - 14
IS  - 9
SP  - 2993
EP  - 2998
PY  - 2019
DA  - 2001/08/19
SN  - 1816-949x
DO  - jeasci.2019.2993.2998
UR  - https://makhillpublications.co/view-article.php?doi=jeasci.2019.2993.2998
KW  - PST-Prim algorithm
KW  -performance
KW  -heuristics
KW  -techniques
KW  -trivial solution
KW  -consumed
AB  - 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.
ER  -