Capacitated vehicle routing problem on line with unsplittable demands

Yuanxiao Wu and Xiwen Lu ()
Additional contact information
Yuanxiao Wu: School of Science, East China University of Science and Technology
Xiwen Lu: School of Science, East China University of Science and Technology

Journal of Combinatorial Optimization, 2022, vol. 44, issue 3, No 30, 1953-1963

Abstract: Abstract In this paper we study the capacitated vehicle routing problem. An instance of capacitated vehicle routing problem consists of a set of vertices with demands in a metric space, a specified depot, and a capacity bound C. The objective is to find a set of tours originating at the depot that cover all the demands, such that the capacity of each tour does not exceed C and the sum of the tour lengths is minimized. For the case that the metric space is a line and the demands are unsplittable, we provide a $$\frac{5}{3}$$ 5 3 -approximation algorithm. An instance is given to show that the bound is tight.

Keywords: Vehicle routing; Worst-case analysis; Network; Approximation algorithm (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00565-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:44:y:2022:i:3:d:10.1007_s10878-020-00565-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00565-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().