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. © 2008 Taylor & Francis Group, LLC.
The lane covering problem with time windows
Ghiani G.;Manni E.;Triki C.
2008-01-01
Abstract
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. © 2008 Taylor & Francis Group, LLC.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
The lane covering problem with time windows.pdf
solo utenti autorizzati
Tipologia:
Versione editoriale
Licenza:
Copyright dell'editore
Dimensione
399.45 kB
Formato
Adobe PDF
|
399.45 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
