Corpus ID: 18799690

Fundamental Performance Limits for Multi-Stage Vehicle Routing Problems

  title={Fundamental Performance Limits for Multi-Stage Vehicle Routing Problems},
  author={Holly A. Waisanen and Devavrat Shah and Munther A. Dahleh},
In the stochastic and dynamic multi-stage vehicle routing problem, a set of vehicles collectively transports and services demands which require service at multiple spatially separated locations. Arrival times and service locations of individual demands are not known until the demand’s arrival, and vehicles are assumed to have infinite capacity and to travel with bounded velocity. The objective is to define real-time control policies for the vehicles to service the demands such that average… Expand
Lower bounds for multi-stage vehicle routing
Borders on average delay in the context of the dynamic pickup and delivery problem (DPDP), where a collection of vehicles are responsible for picking up and delivering requests that arrive at unknown times and locations in a certain geographic area are developed. Expand
Optimizing for Transfers in a Multi-vehicle Collection and Delivery Problem
This paper investigates this Collection and Delivery Problem with Transfers (CDP-T), discusses its theoretical underpinnings, and introduces a two-approximate polynomial time algorithm to minimize total distance travelled. Expand
A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints
It is proved that the optimal average delay scaling can be reduced when message destination information is available to the centralized controller in addition to the message source information. Expand
Dynamic multi-agent team forming: Asymptotic results on throughput versus delay
This paper develops a general framework in which problems in which tasks arrive in an environment sequentially over time are described, and proposes a set of scaling laws for studying the relationship between the number of robots, the expected task delay, and the task arrival rate. Expand
The pickup and multiple delivery problem
A new variable neighbourhood descent with memory hyper-heuristic is presented and shown to be an effective technique for solving instances of the real-world problem and the value of time and timely information for planning pickup and delivery requests is investigated. Expand
Multi-Agent Pickup And Delivery Planning With Transfers
This thesis introduces a novel approach to plan for multi-agent retrievals and deliveries with transfers, and develops an approximation algorithm, based on the construction of a minimum spanning tree, for retrieving a set of items and delivering them to a central location, with transfers only at pickup and dropoff points. Expand
Dynamic pickup and delivery problems
This article surveys the subclass of problems called dynamic pickup and delivery problems, in which objects or people have to be collected and delivered in real-time, and discusses some general issues as well as solution strategies. Expand
Online pickup and delivery planning with transfers for mobile robots
  • B. Coltin, M. Veloso
  • Computer Science, Engineering
  • 2014 IEEE International Conference on Robotics and Automation (ICRA)
  • 2014
An auction-based scheduling algorithm is introduced which plans to transfer items between robots to make deliveries more efficiently and is demonstrated through execution on robots, and the effect of transfers on large simulated problems is examined. Expand
Algorithmes pour les problèmes de tournées à la demande
Nous resolvons ce probleme grâce a une heuristique d’insertion and une technique de propagation de contraintes, which determine les caracteristiques des tournees. Expand


Stochastic Dynamic Vehicle Routing in the Euclidean Plane: The Multiple-Server, Capacitated Vehicle Case
New bounds and policies for the problem of m identical vehicles with unlimited capacity are proposed and it is shown that in heavy traffic the system time is reduced by a factor of 1/m 2 over the single server case. Expand
A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
The model is motivated by applications in which the objective is to minimize the wait for service in a stochastic and dynamically changing environment, a departure from classical vehicle routing problems where one seeks to minimize total travel time in a static, deterministic environment. Expand
A stochastic and dynamic model for the single-vehicle pick-up and delivery problem
A stochastic and dynamic model for the Pick-up and Delivery Problem is developed and analyzed to minimize the expected time in the system for the demands. Expand
Decentralized algorithms for vehicle routing in a stochastic time-varying environment
  • Emilio Frazzoli, F. Bullo
  • Engineering
  • 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)
  • 2004
In this paper we present decentralized algorithms for motion coordination of a group of autonomous vehicles, aimed at minimizing the expected waiting time to service stochastically-generated targets.Expand
Stochastic and dynamic vehicle routing with general demand and interarrival time distributions
We analyze a class of stochastic and dynamic vehicle routing problems in which demands arrive randomly over time and the objective is minimizing waiting time. In our previous work ([6], [7]), weExpand
A Dynamic Pickup and Delivery Problem in Mobile Networks Under Information Constraints
It is proved that the optimal average delay scaling can be reduced when message destination information is available to the centralized controller in addition to the message source information. Expand
Real-time decision problems are playing an increasingly important role in the economy due to advances in communication and information technologies that now allow realtime information to be quicklyExpand
Fleet management and logistics
A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems G. Desaulniers, et al, and Parallel Metaheuristics T.G. Crainic and F. Laporte. Expand
On-line single-server dial-a-ride problems
A lower bound on the competitive ratio of any algorithm of 1 + \sqrt{2} for a server with any capacity and of 3 for aServer with capacity 1 is proved and the first competitive algorithm is presented for the case the server has infinite capacity and the metric space is the real line. Expand
The vehicle routing problem
The Vehicle Routing Problem covers both exact and heuristic methods developed for the VRP and some of its main variants, emphasizing the practical issues common to VRP. The book is composed of threeExpand