id: 05300237
dt: j
an: 05300237
au: Ghiani, Gianpaolo; Manni, Emanuele; Triki, Chefi
ti: The lane covering problem with time windows.
so: J. Discrete Math. Sci. Cryptography 11, No. 1, 67-81 (2008).
py: 2008
pu: Taru Publications, New Delhi, Delhi, India
la: EN
cc: 
ut: lane covering; collaborative logistics; Lagrangian relaxation;
    transportation
ci: 
li: 
ab: Summary: The lane covering problem with time windows arises in the context
    of collaborative logistics. Given a set of lanes, it aims at finding a
    set of tours covering all lanes with the objective of minimizing the
    total travel cost. The purpose of this paper is to formulate a model
    for such a problem and to propose a heuristic approach based on
    Lagrangian relaxation for its solution. The behavior of this procedure
    is tested on a set of random instances.
rv: