Sciweavers

38 search results - page 4 / 8
» The Vehicle Routing Problem with Demand Range
Sort
View
AMC
2006
115views more  AMC 2006»
13 years 7 months ago
A memetic algorithm for a vehicle routing problem with backhauls
This paper considers an extension of a vehicle routing problem with backhauls (VRPB). In this problem, a set of costumers are divided in two subsets consisting of linehaul and bac...
Reza Tavakkoli-Moghaddam, A. R. Saremi, M. S. Ziae...
COR
2004
139views more  COR 2004»
13 years 7 months ago
A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
The routing of a fleet of vehicles to service a set of customers is important in the field of distribution. Vehicle Routing Problems (VRP) arise in many real-life applications wit...
Sin C. Ho, Dag Haugland
COR
2011
13 years 2 months ago
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
Abel Garcia-Najera, John A. Bullinaria
EOR
2007
92views more  EOR 2007»
13 years 7 months ago
Planning and approximation models for delivery route based services with price-sensitive demands
Classical vehicle routing problems typically do not consider the impact of delivery price on the demand for delivery services. Existing models seek the minimum sum of tour lengths...
Joseph Geunes, Zuo-Jun Max Shen, Akin Emir
ORL
2002
92views more  ORL 2002»
13 years 7 months ago
Efficient feasibility testing for dial-a-ride problems
Dial-a-Ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle operating agency requesting that an item be picked up from a specif...
Brady Hunsaker, Martin W. P. Savelsbergh