The application of the principles of sustainability to the implementation of urban freight policies requires the estimation of all the costs and externalities involved. We focus here on the case of access time windows, which ban the access of freight vehicles to central urban areas in many European cities. Even though this measure seeks to reduce congestion and emissions in the most crowded periods of the day, it also imposes additional costs for carriers and results in higher emissions and energy consumption. We present here a mathematical model for the Vehicle Routing Problem with Access Time Windows, a variant of the VRP suitable for planning delivery routes in a city subject to this type of accessibility restriction. We use the model to find exact solutions to small problem instances based on a case study and then compare the performance over larger instances of a modified savings algorithm, a genetic algorithm, and a tabu search procedure, with the results showing no clear prevalence of any of them, but confirming the significance of those additional costs and externalities.
In paper REF authors presented a mathematical model for the vehicle routing problem with access time windows, a version of the VRP suitable for planning delivery routes in a city with accessibility restriction, which bans the access of freight vehicles to central urban areas in many European cities.
Mathematical Formulation and Comparison of Solution Approaches for the Vehicle Routing Problem with Access Time Windows
Complexity
Complexity
Mathematics Computer Science