20 search results - page 1 / 4 » Vehicle Routing Problem with Time Windows: A Hybrid Particle... |
189
Voted
ICNC
2009
Springer
15 years 10 months ago
2009
Springer
Vehicle routing problem (VRP) is a well-known combinatorial optimization and nonlinear programming problem seeking to service a number of customers with a fleet of vehicles. This ...
160
click to vote
HM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this work we extend a VNS for the periodic vehicle routing problem with time windows (PVRPTW) to a multiple VNS (mVNS) where several VNS instances are applied cooperat...
224
click to vote
AI
1998
Springer
15 years 9 months ago
1998
Springer
A variety of hybrid genetic algorithms has been recently proposed to address the vehicle routing problem with time windows (VRPTW), a problem known to be NP-hard. However, very few...
187
click to vote
PPSN
2010
Springer
15 years 4 months ago
2010
Springer
The Vehicle Routing Problem with Time Windows involves finding the lowest-cost set of routes to deliver goods to customers, which have service time windows, using a homogeneous ...
187
click to vote
HM
2007
Springer
15 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...