Modelo heurístico en asignación de flota heterogénea y restricciones de compatibilidad de carga

Wilmer Atoche, Lizeth Medina
2018 Proceedings of the 16th LACCEI International Multi-Conference for Engineering, Education, and Technology: "Innovation in Education and Inclusion"   unpublished
This article aims to perform a comparative analysis between; perform an assignment and routing empirically and perform the same activity using a heuristic method based on VRP. The scenario proposes a central warehouse from where the merchandise is distributed to customers located in different districts of Lima. Merchandise can be classified as dangerous or nondangerous merchandise for transportation. The solution to the problem is made with the use of two-stage heuristics: Assign first and
more » ... r later. The first stage seeks to make a clusterization by merchandise class and the second stage obtains an optimal route for each cluster. The main conclusion of the study is that the use of the model could determine savings of 27% in kilometers traveled. Abstract-This article aims to perform a comparative analysis between; perform an assignment and routing empirically and perform the same activity using a heuristic method based on VRP. The scenario proposes a central warehouse from where the merchandise is distributed to customers located in different districts of Lima. Merchandise can be classified as dangerous or non-dangerous merchandise for transportation. The solution to the problem is made with the use of two-stage heuristics: Assign first and Router later. The first stage seeks to make a clusterization by merchandise class and the second stage obtains an optimal route for each cluster. The main conclusion of the study is that the use of the model could determine savings of 27% in kilometers traveled.
doi:10.18687/laccei2018.1.1.113 fatcat:gv2hue3xvjgtrihihvrdx4j544