We propose a new speed and departure time optimization algorithm for the pollution-routing problem (PRP), which runs in quadratic time and returns an optimal schedule. This algorithm is embedded into an iterated local search-based metaheuristic to achieve a combined speed, scheduling and routing optimization. The start of the working day is set as a decision variable for individual routes, thus enabling a better assignment of human resources to required demands. Some routes that were evaluated as unprofitable can now appear as viable candidates later in the day, leading to a larger search space and further opportunities of distance optimization via better service consolidation. Extensive computational experiments on available PRP benchmark instances demonstrate the good performance of the algorithm. The flexible departure times from the depot contribute to reduce the operational costs by 8.36% on the considered instances.
https://doi.org/10.1016/j.ejor.2015.06.037Cite as:
@article{Kramer_2015,
doi = {10.1016/j.ejor.2015.06.037},
url = {https://doi.org/10.1016%2Fj.ejor.2015.06.037},
year = 2015,
month = {dec},
publisher = {Elsevier {BV}},
volume = {247},
number = {3},
pages = {782--787},
author = {Raphael Kramer and Nelson Maculan and Anand Subramanian and Thibaut Vidal},
title = {A speed and departure time optimization algorithm for the pollution-routing problem},
journal = {European Journal of Operational Research}
}