Sciweavers

84 search results - page 8 / 17
» Solution of a Min-Max Vehicle Routing Problem
Sort
View
CP
1998
Springer
13 years 12 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
HM
2007
Springer
180views Optimization» more  HM 2007»
13 years 11 months ago
Empirical Analysis of Two Different Metaheuristics for Real-World Vehicle Routing Problems
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...
Tonci Caric, Juraj Fosin, Ante Galic, Hrvoje Gold,...
KES
2010
Springer
13 years 6 months ago
Solving real-world vehicle routing problems with time windows using virus evolution strategy
This paper proposes a new solution to the vehicle routing problem with time windows using an evolution strategy adopting viral infection. The problem belongs to the NP-hard class a...
Hitoshi Kanoh, Souichi Tsukahara
WEA
2010
Springer
338views Algorithms» more  WEA 2010»
14 years 2 months ago
New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
Abstract. This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery. We propose undirected and directed two-commodity flow formulations, which are bas...
Anand Subramanian, Eduardo Uchoa, Luiz Satoru Ochi
HEURISTICS
2002
146views more  HEURISTICS 2002»
13 years 7 months ago
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
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...
Louis-Martin Rousseau, Michel Gendreau, Gilles Pes...