Sciweavers

50 search results - page 3 / 10
» Solving the Vehicle Routing Problem with Stochastic Demands ...
Sort
View
CONSTRAINTS
2000
96views more  CONSTRAINTS 2000»
13 years 5 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
INFORMATICALT
2006
116views more  INFORMATICALT 2006»
13 years 6 months ago
Optimized on Demand Routing Protocol of Mobile Ad Hoc Network
In this paper optimization of DSR is achieved using New Link Cache structure and Source Transparent Route Maintenance Method. The new link cache effectively utilizes the memory by ...
Chinnappan Jayakumar, Chenniappan Chellappan
HEURISTICS
2010
13 years 3 months ago
An adaptive memory algorithm for the split delivery vehicle routing problem
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill
AMC
2006
115views more  AMC 2006»
13 years 6 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 5 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