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

DOI10.1016/J.EJOR.2015.06.037MaRDI QIDQ320086zbMATH OpenOpenAlexFDO

Authors Raphael Kramer, A. Subramanian, T. Vidal, Nelson Maculan

Publication date 6 October 2016

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

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

zbMATH Keywords

routinggreen logisticsdeparture optimizationspeed optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76) Transportation, logistics and supply chain management (90B06)

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.

Recommendations

• A metaheuristic for the time-dependent pollution-routing problem
• An adaptive large neighborhood search heuristic for the pollution-routing problem
• A matheuristic approach for the pollution-routing problem
• The bi-objective pollution-routing problem
• Using cost change estimates in a local search heuristic for the pollution routing problem

Cites work

• A matheuristic approach for the pollution-routing problem
• An adaptive large neighborhood search heuristic for the pollution-routing problem
• Analysis of an exact algorithm for the vessel speed optimization problem

Cited in

(20)

• The green location-routing problem
• Using cost change estimates in a local search heuristic for the pollution routing problem
• A metaheuristic for the time-dependent pollution-routing problem
• A matheuristic algorithm for the pollution and energy minimization traveling salesman problems
• The role of operational research in green freight transportation
• A feature correlation reinforce clustering and evolutionary algorithm for the green bike-sharing reposition problem
• A Joint Vehicle Routing and Speed Optimization Problem
• An evolutionary algorithm for the multi‐objective pick‐up and delivery pollution‐routing problem
• Reducing pollutant emissions in a waste collection vehicle routing problem using a variable neighborhood tabu search algorithm: a case study
• The green mixed fleet vehicle routing problem with partial battery recharging and time windows
• Carbon pricing initiatives-based bi-level pollution routing problem
• A matheuristic approach for the pollution-routing problem
• Sustainable operations
• Modelling and multi-criteria analysis of the sustainability dimensions for the green vehicle routing problem
• Optimization of vehicle speed for batches to minimize supply chain cost under uncertain demand
• An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
• The continuous pollution routing problem
• An adaptive large neighborhood search heuristic for the pollution-routing problem
• The bi-objective pollution-routing problem
• Fuel-optimal truck path and speed profile in dynamic conditions: an exact algorithm

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)