Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching

Authors:
Soumia Ichoua;Michel Gendreau;Jean-Yves Potvin
Affiliations:
Dpartement doprations et systmes de dcision, and Centre de recherche sur les technologies de lorganisation rseau, Universit Laval, Qubec, Qubec, Canada G1K 7P4;Dpartement dinformatique et de recherche oprationnelle, and Centre de recherche sur les transports, Universit de Montral, C.P. 6128, succursale Centre-ville, Montral, Qubec, Canada H3C 3J7;Dpartement dinformatique et de recherche oprationnelle, and Centre de recherche sur les transports, Universit de Montral, C.P. 6128, succursale Centre-ville, Montral, Qubec, Canada H3C 3J7
Venue:
Transportation Science
Year:
2006

Citing 17
Cited 17

A priori solution of a travelling salesman problem in which a random subset of the customers are visited

Operations Research
A priori optimization

Operations Research
A vehicle routing problem with stochastic demand

Operations Research
Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles

Operations Research
The dynamic and stochastic knapsack problem with deadlines

Management Science
Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands

Computers and Operations Research - Neural networks in business
The Dynamic and Stochastic Knapsack Problem

Operations Research
Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching

Transportation Science
Stochastic Vehicle Routing Problem with Restocking

Transportation Science
The Dynamic and Stochastic Knapsack Problem with Random Sized Items

Operations Research
Exact and heuristic dynamic programming algorithms for the vehicle routing problem with stochastic demands

Exact and heuristic dynamic programming algorithms for the vehicle routing problem with stochastic demands
Price-Directed Replenishment of Subsets: Methodology and Its Application to Inventory Routing

Manufacturing & Service Operations Management
Dynamic Programming Approximations for a Stochastic Inventory Routing Problem

Transportation Science
A Price-Directed Approach to Stochastic Inventory/Routing

Operations Research
The Dynamic Assignment Problem

Transportation Science
The A Priori Dynamic Traveling Salesman Problem with Time Windows

Transportation Science
Anticipatory Route Selection

Transportation Science

Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic

Transportation Science
Solving a Dynamic and Stochastic Vehicle Routing Problem with a Sample Scenario Hedging Heuristic

Transportation Science
Dynamic vehicle routing using genetic algorithms

Applied Intelligence
Hybrid adaptive predictive control for the multi-vehicle dynamic pick-up and delivery problem based on genetic algorithms and fuzzy clustering

Computers and Operations Research
Adaptive granular local search heuristic for a dynamic vehicle routing problem

Computers and Operations Research
Hybrid Adaptive Predictive Control for a Dynamic Pickup and Delivery Problem

Transportation Science
An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application

Transportation Science
The degree of dynamism for workforce scheduling problem with stochastic task duration

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Feature Article---Merging AI and OR to Solve High-Dimensional Stochastic Optimization Problems Using Approximate Dynamic Programming

INFORMS Journal on Computing
On the partitioning of dynamic workforce scheduling problems

Journal of Scheduling
ASAP: The After-Salesman Problem

Manufacturing & Service Operations Management
Computationally intelligent online dynamic vehicle routing by explicit load prediction in an evolutionary algorithm

PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
A Comparison of Anticipatory Algorithms for the Dynamic and Stochastic Traveling Salesman Problem

Transportation Science
Heuristics for dynamic and stochastic routing in industrial shipping

Computers and Operations Research
An event-driven optimization framework for dynamic vehicle routing

Decision Support Systems
Impact of different unloading zone locations in transshipment terminals under various forklift dispatching rules

Proceedings of the Winter Simulation Conference
Anticipatory routing of police helicopters

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

An important, but seldom investigated, issue in the field of dynamic vehicle routing and dispatching is how to exploit information about future events to improve decision making. In this paper, we address this issue in a real-time setting with a strategy based on probabilistic knowledge about future request arrivals to better manage the fleet of vehicles. More precisely, the new strategy introduces dummy customers (representing forecasted requests) in vehicle routes to provide a good coverage of the territory. This strategy is assessed through computational experiments performed in a simulated environment.