The pollution-routing problem with speed optimization and uneven topography

Abstract

This paper considers a joint pollution-routing with time windows and speed optimization problem (PRP-SO) where vehicle speed, payload, and road grade influence fuel costs and CO2e emissions. We present two advanced optimization methods (i.e., approximate and exact) for solving the PRP-SO. The approximate strategy solves large-scale instances of the problem with a Tabu search-based metaheuristic coupled with an efficient fixed-sequence speed optimization algorithm. The second strategy consists of a tailored branch-and-price (BP) algorithm to manage speed optimization within the pricing problem. We test both methods on modified Solomon benchmarks and newly constructed real-life instance sets. Our BP algorithm successfully solves the majority of instances involving up to 50 customers and many instances with 75 and 100 customers. The heuristic can find near-optimal solutions to all instances and requires less than one minute of computational time per instance. Results on real-world instances suggest several managerial insights. First, fuel savings of up to 53% can be achieved when explicitly considering arc payloads and road grades. Second, fuel savings and emission reduction can be achieved by scheduling uphill customers later along the routes. Lastly, we show that ignoring elevation information when planning routes leads to highly inaccurate fuel consumption estimates.