12 search results - page 1 / 3 » On the Power of Lookahead in On-Line Vehicle Routing Problem... |
COCOON
2005
Springer
13 years 6 months ago
2005
Springer
d Abstract] Luca Allulli, Giorgio Ausiello, and Luigi Laura Dip. di Informatica e Sistemistica Universit`a di Roma “La Sapienza” Via Salaria, 113 - 00198 Roma Italy.
TCS
2008
13 years 4 months ago
2008
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
EVOW
2008
Springer
13 years 6 months ago
2008
Springer
In this paper we examine five different strategies for limiting the local search neighborhoods in the context of vehicle routing problems. The vehicle routing problem deals with th...
WEA
2007
Springer
13 years 10 months ago
2007
Springer
This paper presents a robust branch-cut-and-price algorithm for the Heterogeneous Fleet Vehicle Routing Problem (HFVRP), vehicles may have distinct capacities and costs. The colum...
AMC
2006
13 years 4 months ago
2006
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...