64 search results - page 2 / 13 » A Branch-and-Cut Procedure for the Vehicle Routing Problem w... |
HICSS
2005
IEEE
13 years 11 months ago
2005
IEEE
The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem in logistics. The problem is to serve a number of customers at minimum cost without violating the cus...
HM
2007
Springer
13 years 9 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...
EMO
2009
Springer
14 years 10 days ago
2009
Springer
Abstract. The Vehicle Routing Problem with Time Windows is a complex combinatorial optimization problem which can be seen as a fusion of two well known sub-problems: the Travelling...
APIN
2006
13 years 5 months ago
2006
The Vehicle Routing Problem with Time windows (VRPTW) is an extension of the capacity constrained Vehicle Routing Problem (VRP). The VRPTW is NP-Complete and instances with 100 cus...
COR
2007
13 years 5 months ago
2007
This paper presents several Arcs-States models that can be applied to numerous vehicle routing problems, one of which is the well-known vehicle routing problem with capacities and...