The lane covering problem with time windows

Gianpaolo Ghiani, Emanuele Manni, Chefi Triki

Research output: Contribution to journalArticle

3 Citations (Scopus)

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.

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

Fingerprint

Covering Problem
Time Windows
Logistics
Costs
Lagrangian Relaxation
Covering
Heuristics
Model

Keywords

  • Collaborative logistics
  • Lagrangian relaxation
  • Lane covering
  • Transportation

ASJC Scopus subject areas

  • Analysis
  • Algebra and Number Theory
  • Applied Mathematics

Cite this

The lane covering problem with time windows. / Ghiani, Gianpaolo; Manni, Emanuele; Triki, Chefi.

In: Journal of Discrete Mathematical Sciences and Cryptography, Vol. 11, No. 1, 2008, p. 67-81.

Research output: Contribution to journalArticle

Ghiani, Gianpaolo ; Manni, Emanuele ; Triki, Chefi. / The lane covering problem with time windows. In: Journal of Discrete Mathematical Sciences and Cryptography. 2008 ; Vol. 11, No. 1. pp. 67-81.
@article{00c2f9c83d854379825f2beeae7bdeca,
title = "The lane covering problem with time windows",
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.",
keywords = "Collaborative logistics, Lagrangian relaxation, Lane covering, Transportation",
author = "Gianpaolo Ghiani and Emanuele Manni and Chefi Triki",
year = "2008",
doi = "10.1080/09720529.2008.10698167",
language = "English",
volume = "11",
pages = "67--81",
journal = "Journal of Discrete Mathematical Sciences and Cryptography",
issn = "0972-0529",
publisher = "TARU Publications",
number = "1",

}

TY - JOUR

T1 - The lane covering problem with time windows

AU - Ghiani, Gianpaolo

AU - Manni, Emanuele

AU - Triki, Chefi

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

KW - Collaborative logistics

KW - Lagrangian relaxation

KW - Lane covering

KW - Transportation

UR - http://www.scopus.com/inward/record.url?scp=84969952414&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84969952414&partnerID=8YFLogxK

U2 - 10.1080/09720529.2008.10698167

DO - 10.1080/09720529.2008.10698167

M3 - Article

AN - SCOPUS:84969952414

VL - 11

SP - 67

EP - 81

JO - Journal of Discrete Mathematical Sciences and Cryptography

JF - Journal of Discrete Mathematical Sciences and Cryptography

SN - 0972-0529

IS - 1

ER -