Vehicle Routing with Subtours

01/15/2018
by   Stephan Held, et al.
0

When delivering items to a set of destinations, one can save time and cost by passing a subset to a sub-contractor at any point en route. We consider a model where a set of items are initially loaded in one vehicle and should be distributed before a given deadline Δ. In addition to travel time and time for deliveries, we assume that there is a fixed delay for handing over an item from one vehicle to another. We will show that it is easy to decide whether an instance is feasible, i.e., whether it is possible to deliver all items before the deadline Δ. We then consider computing a feasible tour of minimum cost, where we incur a cost per unit distance traveled by the vehicles, and a setup cost for every used vehicle. Our problem arises in practical applications and generalizes classical problems such as shallow-light trees and the bounded-latency problem. Our main result is a polynomial-time algorithm that, for any given ϵ > 0 and any feasible instance, computes a solution that delivers all items before time (1+ ϵ)Δ and has cost O(1 + 1 / ϵ) OPT, where OPT is the minimum cost of any feasible solution. We show that our result is best possible in the sense that any improvement would lead to progress on 25-year-old questions on shallow-light trees.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/05/2021

A PTAS for Capacitated Vehicle Routing on Trees

We give a polynomial time approximation scheme (PTAS) for the unit deman...
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...
research
12/02/2022

Bin Packing with Partition Matroid can be Approximated within o(OPT) Bins

We consider the Bin Packing problem with a partition matroid constraint....
research
05/31/2017

Obtaining a Proportional Allocation by Deleting Items

We consider the following control problem on fair allocation of indivisi...
research
03/12/2020

Computing a Minimum-Cost k-hop Steiner Tree in Tree-Like Metrics

We consider the problem of computing a Steiner tree of minimum cost unde...
research
02/28/2018

Characterizing Demand Graphs for (Fixed-Parameter) Shallow-Light Steiner Network

We consider the Shallow-Light Steiner Network problem from a fixed-param...
research
05/04/2020

Advice for Online Knapsack With Removable Items

In the proportional knapsack problem, we are given a knapsack of some ca...

Please sign up or login with your details

Forgot password? Click here to reset