The lane covering problem with time windows

Gianpaolo Ghiani, Emanuele Manni, Chefi Triki

Research output: Contribution to journalArticlepeer-review

8 Citations (Scopus)


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.

Original languageEnglish
Pages (from-to)67-81
Number of pages15
JournalJournal of Discrete Mathematical Sciences and Cryptography
Issue number1
Publication statusPublished - 2008
Externally publishedYes


  • Collaborative logistics
  • Lagrangian relaxation
  • Lane covering
  • Transportation

ASJC Scopus subject areas

  • Analysis
  • Algebra and Number Theory
  • Applied Mathematics


Dive into the research topics of 'The lane covering problem with time windows'. Together they form a unique fingerprint.

Cite this