Routing vehicles to minimize fuel consumption
From MaRDI portal
Publication:2450732
DOI10.1016/j.orl.2013.07.007zbMath1287.90010OpenAlexW2090915089MaRDI QIDQ2450732
Apurva Mudgal, Daya Ram Gaur, Rishi Ranjan Singh
Publication date: 15 May 2014
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2013.07.007
Related Items
A review of recent research on green road freight transportation, A service network design model for multimodal municipal solid waste transport, The continuous pollution routing problem, The arc-item-load and related formulations for the cumulative vehicle routing problem, Improved approximation algorithms for cumulative VRP with stochastic demands, A matheuristic algorithm for the pollution and energy minimization traveling salesman problems, Approximation Algorithms for Cumulative VRP with Stochastic Demands, A heuristic for cumulative vehicle routing using column generation
Uses Software
Cites Work
- Unnamed Item
- Heuristics for unequal weight delivery problems with a fixed error guarantee
- Development of a fuel consumption optimization model for the capacitated vehicle routing problem
- An approach for analysing transportation costs and a case study
- The Truck Dispatching Problem
- The minimum latency problem
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
- A Linear-Time Approximation Scheme for TSP in Undirected Planar Graphs with Edge-Weights
- Energy Minimizing Vehicle Routing Problem
- Bounds and Heuristics for Capacitated Routing Problems
- Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
