Using cost change estimates in a local search heuristic for the pollution routing problem

DOI10.1007/s00291-016-0464-9zbMath1368.90016OpenAlexW2549660683MaRDI QIDQ2362177

Onur Can Saka, Sinan Gürel, Tom Van Woensel

Publication date: 6 July 2017

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-016-0464-9

zbMATH Keywords

optimality propertiesspeed controllocal search heuristicspollution routing problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items (3)

The continuous pollution routing problem ⋮ A matheuristic algorithm for the pollution and energy minimization traveling salesman problems ⋮ Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem

Cites Work

• A review of recent research on green road freight transportation
• A matheuristic approach for the pollution-routing problem
• A speed and departure time optimization algorithm for the pollution-routing problem
• Development of a fuel consumption optimization model for the capacitated vehicle routing problem
• An adaptive large neighborhood search heuristic for the pollution-routing problem
• The bi-objective pollution-routing problem
• Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
• A parallel route building algorithm for the vehicle routing and scheduling problem with time windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Energy Minimizing Vehicle Routing Problem

This page was built for publication: Using cost change estimates in a local search heuristic for the pollution routing problem