Set covering in fuel-considered vehicle routing problems

DOI10.1016/J.TCS.2015.06.009MaRDI QIDQ896127zbMATHOpenAlexFDO

Authors Liang Song, Hao Gu, H.-J. Huang, Haibin Chen, Hongwei 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

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

Recommendations

• On the Effectiveness of Set Covering Formulations for the Vehicle Routing Problem with Time Windows
• Routing vehicles to minimize fuel consumption
• A heuristic for cumulative vehicle routing using column generation
• Cumulative vehicle routing problem: a column generation approach
• Approximations for minimum and min-max vehicle routing problems

Cites work

• scientific article; zbMATH DE number 883040 (Why is no real title available?)
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• An approximability result of the multi-vehicle scheduling problem on a path with release and handling times
• An approximation algorithm for the capacitated arc routing problem
• An exact algorithm for the two-echelon capacitated vehicle routing problem
• Approximating a vehicle scheduling problem with time windows and handling times
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• Approximation algorithms for distance constrained vehicle routing problems
• Approximation algorithms for single vehicle scheduling problems with release and service times on a tree or cycle
• Development of a fuel consumption optimization model for the capacitated vehicle routing problem
• On the Distance Constrained Vehicle Routing Problem
• Reducibility among combinatorial problems
• Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach
• The truck dispatching problem

Cited in

(1)

• Routing vehicles to minimize fuel consumption

Describes a project that uses

Uses Software

• VRP

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896127)