CVRPTW Model for Cargo Collection with Heterogeneous Capacity-Fleet

Autor:	Jorge Ivan Romero-Gelvez, William Camilo Gonzales-Cogua, Jorge A. Herrera-Cuartas
Rok vydání:	2019
Předmět:	Mathematical optimization Demand point Distance matrix Computer science Time windows business.industry Vehicle routing problem Local search (optimization) Routing (electronic design automation) business Metaheuristic
Zdroj:	Communications in Computer and Information Science ISBN: 9783030324742 ICAI
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::d9b4e5c60d3c5030364f3c42c7bb3636 https://doi.org/10.1007/978-3-030-32475-9_13 Zobrazit plný text záznamu