Sciweavers

65 search results - page 3 / 13
» Reachability cuts for the vehicle routing problem with time ...
Sort
View
COR
2007
183views more  COR 2007»
13 years 7 months ago
Arcs-states models for the vehicle routing problem with time windows and related problems
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...
Thierry Mautor, Edith Naudin
PDP
2002
IEEE
14 years 9 days ago
Parallel Simulated Annealing for the Vehicle Routing Problem with Time Windows
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...
Zbigniew J. Czech, Piotr Czarnas
PPSN
2010
Springer
13 years 5 months ago
Optimizing Delivery Time in Multi-Objective Vehicle Routing Problems with Time Windows
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 ...
Abel Garcia-Najera, John A. Bullinaria
SAC
2002
ACM
13 years 7 months ago
Local search with annealing-like restarts to solve the vehicle routing problem with time windows
In this paper, we propose a metaheuristic based on snneedinglikerestarts to diversifyand intensifylocalsearches for solving the vehicle muting problem with time windows (VR_PTW). ...
Haibing Li, Andrew Lim
GECCO
2009
Springer
172views Optimization» more  GECCO 2009»
14 years 12 hour ago
Comparison of similarity measures for the multi-objective vehicle routing problem with time windows
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...
Abel Garcia-Najera, John A. Bullinaria