Sciweavers

854 search results - page 10 / 171
» A General Vehicle Routing Problem
Sort
View
DISOPT
2006
118views more  DISOPT 2006»
13 years 7 months ago
Improved bounds for vehicle routing solutions
We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then...
Agustín Bompadre, Moshe Dror, James B. Orli...
SOFSEM
2010
Springer
14 years 2 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
2006
80views more  EOR 2006»
13 years 7 months ago
Vehicle routing and crew scheduling for metropolitan mail distribution at Australia Post
This paper presents a new multi-depot combined vehicle and crew scheduling algorithm, and uses it, in conjunction with a heuristic vehicle routing algorithm, to solve the intra-ci...
B. L. Hollis, M. A. Forbes, B. E. Douglas
CP
1998
Springer
13 years 11 months ago
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Paul Shaw
COR
2010
116views more  COR 2010»
13 years 7 months ago
The multi-shift vehicle routing problem with overtime
: In this paper, we study a new variant of the vehicle routing problem (VRP) with time windows, multi-shift, and overtime. In this problem, a limited fleet of vehicles is used repe...
Yingtao Ren, Maged M. Dessouky, Fernando Ord&oacut...