A speed and departure time optimization algorithm for the pollution-routing problem

From MaRDI portal
Publication:320086

DOI10.1016/J.EJOR.2015.06.037zbMATH Open1346.90142arXiv1501.05354OpenAlexW1679416201MaRDI QIDQ320086FDOQ320086


Authors: Raphael Kramer, A. Subramanian, T. Vidal, Nelson Maculan Edit this on Wikidata


Publication date: 6 October 2016

Published in: European Journal of Operational Research (Search for Journal in Brave)

Abstract: We propose a new speed and departure time optimization algorithm for the Pollution-Routing Problem (PRP), which runs in quadratic time and returns a certified 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 algorithms. The flexible departure times from the depot contribute to reduce the operational costs by 8.36% on the considered instances.


Full work available at URL: https://arxiv.org/abs/1501.05354




Recommendations




Cites Work


Cited In (20)





This page was built for publication: A speed and departure time optimization algorithm for the pollution-routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q320086)