Ponente
Descripción
This work deals with the so-called time-dependent vehicle routing problem applied to the waste collection problem on a real traffic network while considering one particular type of waste. However, we consider a case where travel time continuously changes according to traffic density. This empirical stochastic property can be discretized into intervals. The objective is to optimize waste collection routes when considering various time delays during various collection times. The developed model is tested on a Zlín (Czech Republic) case study with a real collection network for a selected waste type. The preliminary results for a problem considering traffic flow information by the time of day demonstrate significant savings in the total travel time. When minimizing total spending time by waste collection vehicles, the solution to such a problem also reduces costs, emissions from vehicles, and city center traffic during congested hours. A heuristic algorithm is developed and compared with the results of the CPLEX solver showing the functionality and suitability for solving large-scale problems.
