Document Open Access Logo

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

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



PDF
Thumbnail PDF

File

DagSemProc.09261.8.pdf
  • Filesize: 102 kB
  • 3 pages

Document Identifiers

Author Details

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

Cite AsGet BibTex

Bernard Gendron, Paul-Virak Khuong, and Frédéric Semet. Formulations, Bounds and Heuristic Methods for a Two-Echelon Adaptive Location-Distribution Problem. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-3, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/DagSemProc.09261.8

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.
Keywords
  • Two-echelon location problem
  • formulations
  • relaxations
  • variable neighborhood search

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail