Set covering in fuel-considered vehicle routing problems

DOI10.1016/j.tcs.2015.06.009zbMath1333.90017OpenAlexW887435697MaRDI QIDQ896127

Hao Gu, Hejiao Huang, Liang Song, Hai-Bin Chen, Hongwei David Du

Publication date: 11 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.06.009

zbMATH Keywords

lower boundset coveringtotal unimodularitybicriteria approximation algorithmsfuel-considered vehicle routing problems

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Uses Software

• VRP

Cites Work

• Unnamed Item
• Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle
• Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
• Development of a fuel consumption optimization model for the capacitated vehicle routing problem
• An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
• Approximating a vehicle scheduling problem with time windows and handling times
• The Truck Dispatching Problem
• Approximation algorithms for distance constrained vehicle routing problems
• An Approximation Algorithm for the Capacitated Arc Routing Problem
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• On the Distance Constrained Vehicle Routing Problem
• Reducibility among Combinatorial Problems
• An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem

This page was built for publication: Set covering in fuel-considered vehicle routing problems