Sciweavers

146 search results - page 5 / 30
» Vehicle routing and scheduling with dynamic travel times
Sort
View
HICSS
2005
IEEE
157views Biometrics» more  HICSS 2005»
14 years 20 days 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
CORR
2011
Springer
239views Education» more  CORR 2011»
12 years 10 months ago
Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows
: The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints....
Imen Harbaoui Dridi, Ryan Kammarti, Pierre Borne, ...
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
14 years 1 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi
LR
2011
170views more  LR 2011»
13 years 2 months ago
Routing automated guided vehicles in container terminals through the Q-learning technique
This paper suggests a routing method for automated guided vehicles in port terminals that uses the Q-learning technique. One of the most important issues for the efficient operati...
Su Min Jeon, Kap Hwan Kim, Herbert Kopfer
CONSTRAINTS
2000
96views more  CONSTRAINTS 2000»
13 years 6 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