Comparing Different Approaches on the Door Assignment Problem in LTL-Terminals

Authors Boris Naujoks, Annette Chmielewski



PDF
Thumbnail PDF

File

DagSemProc.09261.7.pdf
  • Filesize: 290 kB
  • 9 pages

Document Identifiers

Author Details

Boris Naujoks
Annette Chmielewski

Cite AsGet BibTex

Boris Naujoks and Annette Chmielewski. Comparing Different Approaches on the Door Assignment Problem in LTL-Terminals. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)
https://doi.org/10.4230/DagSemProc.09261.7

Abstract

The work at hand yields two different ways to address the assignment of inbound and outbound doors in less-than-truckload terminals. The considered optimization methods stem from two different scientific fields, which makes the comparison of the techniques a very interesting topic. The first solution approach origins from the field of discrete mathematics. For this purpose, the logistical optimization task is modeled as a time-discrete multi-commodity flow problem with side constraints. Based on this model, a decomposition approach and a modified column generation approach are developed. The second considered optimization method is an evolutionary multi-objective optimization algorithm (EMOA). This approach is able to handle different optimization goals in parallel. Both algorithms are applied to ten test scenarios yielding different numbers of tours, doors, loading areas, and affected relations.
Keywords
  • Door Assignment Problem
  • Column Generation Approach
  • Multi-objective evolutionary algorithm approach

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