Sciweavers

120 search results - page 15 / 24
» A memetic algorithm for a vehicle routing problem with backh...
Sort
View
EOR
2007
90views more  EOR 2007»
13 years 7 months ago
Arc routing problems with time-dependent service costs
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
Mariam Tagmouti, Michel Gendreau, Jean-Yves Potvin
SODA
2010
ACM
172views Algorithms» more  SODA 2010»
14 years 4 months ago
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
Aparna Das, Claire Mathieu
VTC
2008
IEEE
116views Communications» more  VTC 2008»
14 years 1 months ago
An Adaptive Vehicle Route Management Solution Enabled by Wireless Vehicular Networks
— In order to accommodate the constantly growing number of vehicles on the road with which infrastructure provision is failing to cope, new means of optimizing the available road...
Kevin Collins, Gabriel-Miro Muntean
AAAI
2007
13 years 9 months ago
Randomized Adaptive Spatial Decoupling for Large-Scale Vehicle Routing with Time Windows
In recent years, the size of combinatorial applications and the need to produce high-quality solutions quickly have increased steadily, providing significant challenges for optim...
Russell Bent, Pascal Van Hentenryck
IJCAI
2007
13 years 8 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