
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.
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 1 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
