Sciweavers

236 search results - page 5 / 48
» On the Vehicle Routing Problem with lower bound capacities
Sort
View
AISS
2010
161views more  AISS 2010»
14 years 7 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
ETFA
2006
IEEE
15 years 1 months ago
An Initial Task Assignment Method for Autonomous Distributed Vehicle Systems with Finite Buffer Capacity
This paper discusses an on-line Tasks Assignment and Routing Problem(TARP) for Autonomous Transportation Systems(ATSs) in manufacturing systems. The TARP results in a constrained ...
Yusuke Morihiro, Toshiyuki Miyamoto, Sadatoshi Kum...
EMO
2009
Springer
235views Optimization» more  EMO 2009»
15 years 4 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
84
Voted
TRANSCI
2008
94views more  TRANSCI 2008»
14 years 8 months ago
Routing for Relief Efforts
In the aftermath of a large disaster, the routing of vehicles carrying critical supplies can greatly impact the arrival times to those in need. Since it is critical that the deliv...
Ann Melissa Campbell, Dieter Vandenbussche, Willia...
IOR
2006
173views more  IOR 2006»
14 years 9 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