License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-21892
URL: http://drops.dagstuhl.de/opus/volltexte/2009/2189/

Gendron, Bernard ; Khuong, Paul-Virak ; Semet, Frédéric

Formulations, Bounds and Heuristic Methods for a Two-Echelon Adaptive Location-Distribution Problem

pdf-format:
Dokument 1.pdf (103 KB)


Abstract

We consider a two-echelon location-distribution problem arising from an actual application in fast delivery service. This problem belongs to the class of adaptive logistics problems, as the locations of the facilities (typically, parking spaces) are revised on a daily basis according to demand variations. We present and compare two formulations for this problem: an arc-based model and a path-based model. Since these formulations cannot be solved in reasonable time for large-scale instances, we introduce a heuristic method based on a variable neighborhood search approach.

BibTeX - Entry

@InProceedings{gendron_et_al:DSP:2009:2189,
  author =	{Bernard Gendron and Paul-Virak Khuong and Fr{\'e}d{\'e}ric Semet},
  title =	{Formulations, Bounds and Heuristic Methods for a Two-Echelon Adaptive Location-Distribution Problem},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  year =	{2009},
  editor =	{Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M{\"o}hring},
  number =	{09261},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2189},
  annote =	{Keywords: Two-echelon location problem, formulations, relaxations, variable neighborhood search}
}

Keywords: Two-echelon location problem, formulations, relaxations, variable neighborhood search
Seminar: 09261 - Models and Algorithms for Optimization in Logistics
Issue date: 2009
Date of publication: 02.10.2009


DROPS-Home | Fulltext Search | Imprint Published by LZI