Sciweavers

6 search results - page 1 / 2
» An adaptive memory algorithm for the split delivery vehicle ...
Sort
View
HEURISTICS
2010
13 years 2 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
AISS
2010
161views more  AISS 2010»
13 years 2 months ago
Two GRASP Metaheuristic for the Capacitated Vehicle Routing Problem Considering Split Delivery and Solving the Three Dimensional
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...
Joseph Gallart Suarez, Manuel Tupia Anticona
DISOPT
2006
118views more  DISOPT 2006»
13 years 4 months ago
Improved bounds for vehicle routing solutions
We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then...
Agustín Bompadre, Moshe Dror, James B. Orli...
COR
2007
163views more  COR 2007»
13 years 4 months ago
A general heuristic for vehicle routing problems
We present a unified heuristic, which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacit...
David Pisinger, Stefan Ropke
IWCMC
2006
ACM
13 years 10 months ago
SCAR: context-aware adaptive routing in delay tolerant mobile sensor networks
Sensor devices are being embedded in all sorts of items including vehicles, furniture but also animal and human bodies through health monitors and tagging techniques. The collecti...
Cecilia Mascolo, Mirco Musolesi