Sciweavers

71 search results - page 1 / 15
» Optimizing departure times in vehicle routes
Sort
View
EOR
2011
85views more  EOR 2011»
12 years 11 months ago
Optimizing departure times in vehicle routes
Most solution methods for the vehicle routing problem with time windows (VRPTW) develop routes from the earliest feasible departure time. In practice, however, temporal traffic co...
A. L. Kok, E. W. Hans, J. M. J. Schutten
DISOPT
2008
118views more  DISOPT 2008»
13 years 4 months ago
Approximation algorithm for minimizing total latency in machine scheduling with deliveries
We study the problem of minimizing total latency in machine scheduling with deliveries, which is defined as follows. There is a set of n jobs to be processed by a single machine a...
Asaf Levin, Michal Penn
EMO
2009
Springer
235views Optimization» more  EMO 2009»
13 years 11 months ago
Bi-objective Optimization for the Vehicle Routing Problem with Time Windows: Using Route Similarity to Enhance Performance
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...
Abel Garcia-Najera, John A. Bullinaria
PPSN
2010
Springer
13 years 3 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
PDP
2002
IEEE
13 years 9 months 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