AI Chat AI Image Generator AI Video Text to Speech

A PTAS for Capacitated Vehicle Routing on Trees

11/05/2021

∙

by Claire Mathieu, et al.

∙

∙

We give a polynomial time approximation scheme (PTAS) for the unit demand capacitated vehicle routing problem (CVRP) on trees, for the entire range of the tour capacity. The result extends to the splittable CVRP.

Claire Mathieu
17 publications
Hang Zhou
71 publications

page 1

page 2

page 3

page 4

research

∙ 02/11/2022

A Tight (3/2+ε)-Approximation for Unsplittable Capacitated Vehicle Routing on Trees

We give a polynomial time (3/2+ϵ)-approximation algorithm for the unspli...

0 Claire Mathieu, et al. ∙

research

∙ 01/21/2014

Multi-GPU parallel memetic algorithm for capacitated vehicle routing problem

The goal of this paper is to propose and test a new memetic algorithm fo...

0 Michał Karpiński, et al. ∙

research

∙ 07/11/2018

A PTAS for Minimum Makespan Vehicle Routing in Trees

We consider a variant of the vehicle routing problem on trees in which t...

0 Amariah Becker, et al. ∙

research

∙ 01/23/2020

Arc-routing for winter road maintenance

The arc-routing problems are known to be notoriously hard. We study here...

0 Jiří Fink, et al. ∙

research

∙ 01/15/2018

Vehicle Routing with Subtours

When delivering items to a set of destinations, one can save time and co...

0 Stephan Held, et al. ∙

research

∙ 03/05/2021

Routing algorithms as tools for integrating social distancing with emergency evacuation

We explore the implications of integrating social distancing with emerge...

6 Yi-Lin Tsai, et al. ∙

research

∙ 06/02/2023

Approximation schemes for capacity vehicle routing problems: A survey

Finding the shortest travelling tour of vehicles with capacity k from th...

0 Yongyu Chen, et al. ∙