A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line

DOI10.1007/S11424-022-0280-ZMaRDI QIDQ2109294zbMATH OpenOpenAlexWikidataFDO

Authors Yuanxiao Wu, Xiwen Lu

Publication date 20 December 2022

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11424-022-0280-z

zbMATH Keywords

networkapproximation algorithmvehicle routingworst-case analysisunsplittable demand

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Approximation algorithms (68W25) Transportation, logistics and supply chain management (90B06)

Recommendations

• Capacitated vehicle routing problem on line with unsplittable demands
• Improved approximations for capacitated vehicle routing with unsplittable client demands
• scientific article; zbMATH DE number 1522939
• A new approximation algorithm for the capacitated vehicle routing problem on a tree
• scientific article; zbMATH DE number 1303035

Cites work

• scientific article; zbMATH DE number 6678949 (Why is no real title available?)
• A new approximation algorithm for the capacitated vehicle routing problem on a tree
• A tight 4/3 approximation for capacitated vehicle routing in trees
• An approximation of the customer waiting time for online restaurants owning delivery system
• Capacitated Vehicle Routing on Trees
• Capacitated vehicle routing problem on line with unsplittable demands
• Heuristics for unequal weight delivery problems with a fixed error guarantee
• Improved bounds for batch scheduling with nonidentical job sizes
• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail
• The truck dispatching problem

Cited in

(2)

• Improved approximations for capacitated vehicle routing with unsplittable client demands
• Capacitated vehicle routing problem on line with unsplittable demands

This page was built for publication: A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line

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