Abstract
This work shows the application of the Capacitated Vehicle Routing Problem with Time Windows (CVRPTW) to collect different cargo-demand in several locations with low time disponibility to attend any vehicle. The objective of the model is to reduce the routing time in a problem with mixed vehicle-fleet. The initial step is the creation of a distance matrix by using the Google Maps API, then cargo capacities for every vehicle and time-windows for every demand point are included in the model. The problem is solved with Google-OR tools using as firt solution aproximated algoritm and as second solution one metaheuristic algorithm for local search.
Author supplied keywords
Cite
CITATION STYLE
Romero-Gelvez, J. I., Gonzales-Cogua, W. C., & Herrera-Cuartas, J. A. (2019). CVRPTW model for cargo collection with heterogeneous capacity-fleet. In Communications in Computer and Information Science (Vol. 1051 CCIS, pp. 173–184). Springer. https://doi.org/10.1007/978-3-030-32475-9_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
