Sciweavers

54 search results - page 2 / 11
» Formulations and exact algorithms for the vehicle routing pr...
Sort
View
IOR
2006
173views more  IOR 2006»
13 years 5 months ago
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
In the dial-a-ride problem, users formulate requests for transportation from a specific origin to a specific destination. Transportation is carried out by vehicles providing a sha...
Jean-François Cordeau
APIN
2006
207views more  APIN 2006»
13 years 5 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
HICSS
2005
IEEE
157views Biometrics» more  HICSS 2005»
13 years 11 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
EMO
2009
Springer
235views Optimization» more  EMO 2009»
13 years 12 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