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

DOI10.1007/S11424-022-0280-ZzbMath1502.90029OpenAlexW4283157753WikidataQ114222437 ScholiaQ114222437MaRDI QIDQ2109294

Yuanxiao Wu, Xi-wen 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

networkvehicle routingapproximation algorithmworst-case analysisunsplittable demand

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Heuristics for unequal weight delivery problems with a fixed error guarantee
• The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail
• Capacitated vehicle routing problem on line with unsplittable demands
• An approximation of the customer waiting time for online restaurants owning delivery system
• Minimizing makespan on a single batch processing machine with nonidentical job sizes
• The Truck Dispatching Problem
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• Capacitated Vehicle Routing on Trees
• Improved bounds for batch scheduling with nonidentical job sizes
• A new approximation algorithm for the capacitated vehicle routing problem on a tree

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