scispace - formally typeset
Journal ArticleDOI

A note on determining operating strategies for probabilistic vehicle routing

Reads0
Chats0
TLDR
A dynamic programming recursion is presented which addresses the question under what conditions should a driver return to the central depot in order to replenish his supply and it is shown that the optimal policy is of a rather simple form.
Abstract
The stochastic vehicle routing problem is a problem of current importance and research interest. Applications include schoolbus routing, municipal waste collection, subscription bus scheduling, daily delivery of dairy goods, and a host of related transportation and distribution activities. In this paper, we assume that routes for vehicles have already been generated and we focus on determining operating strategies. That is, under what conditions should a driver return to the central depot in order to replenish his supply? We present a dynamic programming recursion which addresses this question and we show that the optimal policy is of a rather simple form. Finally, an algorithm and example illustrate the policy.

read more

Citations
More filters
Journal ArticleDOI

Stochastic vehicle routing.

TL;DR: The main problems of stochastic vehicle routing are described within a broad classification scheme and the most important contributions are summarized in table form.
Journal ArticleDOI

Real-Time Multivehicle Truckload Pickup and Delivery Problems

TL;DR: A generic real-time multivehicle truckload pickup and delivery problem that captures most features of the operational problem of a real-world trucking fleet that dynamically moves truckloads between different sites according to customer requests that arrive continuously is introduced.
Journal ArticleDOI

50th Anniversary Invited Article—Future Research Directions in Stochastic Vehicle Routing

TL;DR: The state-of-the-art in stochastic vehicle routing is examined by examining the main classes of stoChastic VRPs, the modeling paradigms used to formulate them, and existing exact and approximate solution methods that have been proposed to tackle them.
Journal ArticleDOI

The stochastic vehicle routing problem revisited

TL;DR: Modifications of existing models and introduce more realistic ones that turn out to exhibit the structure of the time-dependent traveling salesman problem under certain assumptions.
References
More filters
Journal ArticleDOI

Implementing vehicle routing algorithms

TL;DR: This work considers heuristic algorithms for vehicle routing, comparing techniques of Clarke and Wright, Gillett and Miller, and Tyagi, and presenting modifications and extensions which permit problems involving hundreds of demand points to be solved in a matter of seconds.
Journal ArticleDOI

The Multiple Terminal Delivery Problem with Probabilistic Demands

TL;DR: A heuristic approach is presented for solving the multiterminal delivery problem with constraints on the system and probabilistic demands and results in “near optimal” solutions to a difficult problem.
Related Papers (5)