Sciweavers

263 search results - page 26 / 53
» On a Labeled Vehicle Routing Problem
Sort
View
GECCO
2004
Springer
152views Optimization» more  GECCO 2004»
15 years 5 months ago
A Hybrid Ant Colony Optimisation Technique for Dynamic Vehicle Routing
Abstract. This paper is concerned with a dynamic vehicle routing problem. The problem is dynamic in the sense that the time it will take to traverse each edge is uncertain. The pro...
Darren M. Chitty, Marcel L. Hernandez
MST
2010
106views more  MST 2010»
14 years 10 months ago
Constrained-Path Labellings on Graphs of Bounded Clique-Width
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
Bruno Courcelle, Andrew Twigg
EOR
2011
85views more  EOR 2011»
14 years 6 months ago
Optimizing departure times in vehicle routes
Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporal traffic co...
A. L. Kok, E. W. Hans, J. M. J. Schutten
ORL
2002
92views more  ORL 2002»
14 years 11 months ago
Efficient feasibility testing for dial-a-ride problems
Dial-a-Ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle operating agency requesting that an item be picked up from a specif...
Brady Hunsaker, Martin W. P. Savelsbergh
WADS
2007
Springer
68views Algorithms» more  WADS 2007»
15 years 5 months ago
On Euclidean Vehicle Routing with Allocation
The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean TSP. We do not require that all points lie on the salesman tour. However, points that do ...
Jan Remy, Reto Spöhel, Andreas Weißl