Approximation schemes for Euclidean vehicle routing problems with time windows

Liang Song (), Hejiao Huang () and Hongwei Du ()
Additional contact information
Liang Song: Harbin Institute of Technology Shenzhen Graduate School
Hejiao Huang: Harbin Institute of Technology Shenzhen Graduate School
Hongwei Du: Harbin Institute of Technology Shenzhen Graduate School

Journal of Combinatorial Optimization, 2016, vol. 32, issue 4, No 15, 1217-1231

Abstract: Abstract The vehicle routing problem with time windows (VRPTW) is a variant of the classical vehicle routing problem. The paper considers two dimensional and one dimensional VRPTW, in which each demand must be serviced within the time window which is designated by its customer. In the two dimensional problem, each customer has the same unit demand. The paper gives a quasi-polynomial time approximation scheme and an asymptotic polynomial time approximation scheme for the two dimensional and one dimensional problems under the Euclidean setting, respectively. With reasonable vehicle speed requirements, our algorithms could generate the solutions whose the total route length is $$(1 + O(\varepsilon ))$$ ( 1 + O ( ε ) ) times of that of the optimum solutions.

Keywords: Modern logistics; VRPTW; Approximation algorithm (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9931-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:32:y:2016:i:4:d:10.1007_s10878-015-9931-5

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

DOI: 10.1007/s10878-015-9931-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 ().