64 search results - page 3 / 13 » A Branch-and-Cut Procedure for the Vehicle Routing Problem w... |
PDP
2002
IEEE
14 years 9 days ago
2002
IEEE
A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is presented. The objective is to find the best possible solutions to some wellkno...
PPSN
2010
Springer
13 years 5 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 ...
SAC
2002
ACM
13 years 7 months ago
2002
ACM
In this paper, we propose a metaheuristic based on snneedinglikerestarts to diversifyand intensifylocalsearches for solving the vehicle muting problem with time windows (VR_PTW). ...
GECCO
2009
Springer
14 years 3 hour ago
2009
Springer
The Vehicle Routing Problem can be seen as a fusion of two well known combinatorial problems, the Travelling Salesman Problem and Bin Packing Problem. It has several variants, the...
GECCO
2009
Springer
14 years 3 hour ago
2009
Springer
The Vehicle Routing Problem’s main objective is to find the lowest-cost set of routes to deliver goods to customers, which have a service time window, using a fleet of identic...