Sciweavers

KES
2007
Springer
13 years 10 months ago
Multiple Ant Colony Optimization for a Rich Vehicle Routing Problem: A Case Study
Rich vehicle routing problems try to represent situations that can be found in reality. Starting from a case study, in this paper a rich vehicle routing problem is analyzed. The e...
Paola Pellegrini, Daniela Favaretto, Elena Moretti
IPPS
2007
IEEE
13 years 10 months ago
Parallel Tabu Search and the Multiobjective Vehicle Routing Problem with Time Windows
Abstract—In this paper the author presents three approaches to parallel Tabu Search, applied to several instances of the Capacitated Vehicle Routing Problem with Time Windows (CV...
Andreas Beham
SLS
2009
Springer
224views Algorithms» more  SLS 2009»
13 years 11 months ago
High-Performance Local Search for Solving Real-Life Inventory Routing Problems
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
Thierry Benoist, Bertrand Estellon, Fréd&ea...
EMO
2009
Springer
235views Optimization» more  EMO 2009»
13 years 11 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
WEA
2010
Springer
338views Algorithms» more  WEA 2010»
13 years 11 months ago
New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
Abstract. This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery. We propose undirected and directed two-commodity flow formulations, which are bas...
Anand Subramanian, Eduardo Uchoa, Luiz Satoru Ochi
SOFSEM
2010
Springer
13 years 11 months ago
On a Labeled Vehicle Routing Problem
In this paper, we study the complexity and (in)approximability of the minimum label vehicle routing problem. Given a simple complete graph G = (V, E) containing a special vertex 0 ...
Hatem Chatti, Laurent Gourvès, Jér&o...
SODA
2010
ACM
172views Algorithms» more  SODA 2010»
14 years 1 months ago
A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
Aparna Das, Claire Mathieu