Sciweavers

236 search results - page 4 / 48
» On the Vehicle Routing Problem with lower bound capacities
Sort
View
HICSS
2005
IEEE
157views Biometrics» more  HICSS 2005»
15 years 3 months ago
A Two-Stage Heuristic for the Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles
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...
Andrew Lim, Xingwen Zhang
APIN
2006
207views more  APIN 2006»
14 years 9 months ago
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows
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...
Beatrice M. Ombuki, Brian Ross, Franklin Hanshar
SIAMCO
2010
93views more  SIAMCO 2010»
14 years 8 months ago
Dynamic Vehicle Routing with Priority Classes of Stochastic Demands
In this paper we introduce a dynamic vehicle routing problem in which there are multiple vehicles and multiple priority classes of service demands. Service demands of each priority...
Stephen L. Smith, Marco Pavone, Francesco Bullo, E...
COR
2010
77views more  COR 2010»
14 years 7 months ago
Lower bounds for the mixed capacitated arc routing problem
Luís Gouveia, Maria Cândida Mour&atil...
CONSTRAINTS
2000
96views more  CONSTRAINTS 2000»
14 years 9 months ago
A Comparison of Traditional and Constraint-based Heuristic Methods on Vehicle Routing Problems with Side Constraints
The vehicle routing problem (VRP) is a variant of the familiar travelling salesperson problem (TSP). In the VRP we are to perform a number of visits, using a number of vehicles of ...
Philip Kilby, Patrick Prosser, Paul Shaw