51 search results - page 1 / 11 » Solving Vehicle Routing Problems Using Constraint Programmin... |
HEURISTICS
2000
13 years 4 months ago
2000
CP
1998
Springer
13 years 8 months ago
1998
Springer
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...
HEURISTICS
2002
13 years 4 months ago
2002
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint pr...
NETWORKS
2007
13 years 4 months ago
2007
We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is mot...
HM
2007
Springer
13 years 8 months ago
2007
Springer
We present two hybrid Metaheuristics, a hybrid Iterated Local Search and a hybrid Simulated Annealing, for solving real-world extensions of the Vehicle Routing Problem with Time Wi...