TY - GEN
T1 - Propuesta de valores en rutas desconocidas para el uso del algoritmo de Clarke - Wright y construcción de un algoritmo de ruteo. Caso practico
AU - Rojas Polo, Jonatán Edward
AU - Cáceres Cansaya, Alexia
AU - Stoll Quevedo, Cesar
AU - Alva Zelada, Jackeline
N1 - Publisher Copyright:
© 2017 Latin American and Caribbean Consortium of Engineering Institutions. All rights reserved.
PY - 2017
Y1 - 2017
N2 - This research came about through the search for Improvement in the supply and collection of raw material in an Agrobusiness company. In the course of this central research, we turned our attention to the optimization of vehicle routing using the Clarke and Wright algorithm, specifically in the savings values generated between each pair of points (sites), the problem arises when we do not have the distance Between two sites and assuming as a distance a very large value, M, since it is a problem of minimization of the distance to travel, in the feasibility of the optimal solution will not take that value. The proposal of this research approaches to networks (graphs) that do not present a Hamiltonian cycle, or unknown routes. Two types of artifices were used. The first is an artifice based on the Dijkstra algorithm in unknown paths, which implies that there is a probability of traveling more than once in one place, however this is allowed not to fall into Infractibility when finding the optimal solution. The second artifice focuses on placing a large value, however here if it is discriminated with the proximity between the sites, ie for non existent distances is placed M (n-1), where M is a large value and n the minimum number of Intermediate sites that exist in the two sites of interest. Finally the two types of devices were validated and a more friendly and efficient algorithm was obtained for Routing vehicles.
AB - This research came about through the search for Improvement in the supply and collection of raw material in an Agrobusiness company. In the course of this central research, we turned our attention to the optimization of vehicle routing using the Clarke and Wright algorithm, specifically in the savings values generated between each pair of points (sites), the problem arises when we do not have the distance Between two sites and assuming as a distance a very large value, M, since it is a problem of minimization of the distance to travel, in the feasibility of the optimal solution will not take that value. The proposal of this research approaches to networks (graphs) that do not present a Hamiltonian cycle, or unknown routes. Two types of artifices were used. The first is an artifice based on the Dijkstra algorithm in unknown paths, which implies that there is a probability of traveling more than once in one place, however this is allowed not to fall into Infractibility when finding the optimal solution. The second artifice focuses on placing a large value, however here if it is discriminated with the proximity between the sites, ie for non existent distances is placed M (n-1), where M is a large value and n the minimum number of Intermediate sites that exist in the two sites of interest. Finally the two types of devices were validated and a more friendly and efficient algorithm was obtained for Routing vehicles.
KW - Clark & Wright
KW - Dijkstra
KW - Hamiltonian Cycles
KW - VRP
UR - http://www.scopus.com/inward/record.url?scp=85046274025&partnerID=8YFLogxK
U2 - 10.18687/LACCEI2017.1.1.453
DO - 10.18687/LACCEI2017.1.1.453
M3 - Contribución a la conferencia
AN - SCOPUS:85046274025
T3 - Proceedings of the LACCEI international Multi-conference for Engineering, Education and Technology
BT - 15th LACCEI International Multi-Conference for Engineering, Education Caribbean Conference for Engineering and Technology
A2 - Alvarez, Humberto
A2 - Petrie, Maria M. Larrondo
PB - Latin American and Caribbean Consortium of Engineering Institutions
T2 - 15th LACCEI International Multi-Conference for Engineering, Education Caribbean Conference for Engineering and Technology, LACCEI 2017
Y2 - 19 July 2017 through 21 July 2017
ER -