Sciweavers

209 search results - page 19 / 42
» The multi-depot vehicle routing problem with inter-depot rou...
Sort
View
SOFSEM
2010
Springer
14 years 3 months ago
On a Labeled Vehicle Routing Problem
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
Hatem Chatti, Laurent Gourvès, Jér&o...
EOR
2010
81views more  EOR 2010»
13 years 8 months ago
Dynamic pickup and delivery problems
In the last decade, there has been an increasing body of research in dynamic vehicle routing problems. This article surveys the subclass of those problems called dynamic pickup an...
Gerardo Berbeglia, Jean-François Cordeau, G...
ATMOS
2010
308views Optimization» more  ATMOS 2010»
13 years 7 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
IJCAI
2007
13 years 10 months ago
Waiting and Relocation Strategies in Online Stochastic Vehicle Routing
This paper considers online stochastic multiple vehicle routing with time windows in which requests arrive dynamically and the goal is to maximize the number of serviced customers...
Russell Bent, Pascal Van Hentenryck
PDP
2002
IEEE
14 years 1 months ago
Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows
A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is presented. The objective is to find the best possible solutions to some wellkno...
Zbigniew J. Czech, Piotr Czarnas