DROPS

Document

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

Authors: Boris Naujoks and Annette Chmielewski

Published in: Dagstuhl Seminar Proceedings, Volume 9261, Models and Algorithms for Optimization in Logistics (2009)

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.

Cite as

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)

Copy BibTex To Clipboard

@InProceedings{naujoks_et_al:DagSemProc.09261.7,
  author =	{Naujoks, Boris and Chmielewski, Annette},
  title =	{{Comparing Different Approaches on the Door Assignment Problem in LTL-Terminals}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--9},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9261},
  editor =	{Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M\"{o}hring},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.7},
  URN =		{urn:nbn:de:0030-drops-21870},
  doi =		{10.4230/DagSemProc.09261.7},
  annote =	{Keywords: Door Assignment Problem, Column Generation Approach, Multi-objective evolutionary algorithm approach}
}

Document

DOI: 10.4230/DagSemProc.09261.14

Integrated Vehicle Routing and Crew Scheduling in Waste Management (Part II)

Authors: Jens Baudach, Annette Chmielewski, and Uwe Clausen

Published in: Dagstuhl Seminar Proceedings, Volume 9261, Models and Algorithms for Optimization in Logistics (2009)

Abstract

Planning Waste Management involves the two major resources collection-vehicles and crews. The overall goal of our project with two waste management companies is an integrative approach for planning the routes and the crews of the vehicles. In the first phase of our three-phase approach we generate daily crew tasks which contain routes operated by a single crew at a particular day within a given disposal horizon considering various practical requirements. The goal is to minimize the number of crews/vehicles required for the entire disposal process. Given the minimal number of crews, in phase 2 we re-optimize the daily crew tasks to increase the robustness of the routes. In the third phase we assign employees to the generated daily crew tasks for all working days over the year such that the constraints concerning crew scheduling are satisfied and the benefits for the employees and the company are maximal. For all phases we present solution methods yielding first promising results for a real-world data set.

Cite as

Jens Baudach, Annette Chmielewski, and Uwe Clausen. Integrated Vehicle Routing and Crew Scheduling in Waste Management (Part II). In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)

Copy BibTex To Clipboard

@InProceedings{baudach_et_al:DagSemProc.09261.14,
  author =	{Baudach, Jens and Chmielewski, Annette and Clausen, Uwe},
  title =	{{Integrated Vehicle Routing and Crew Scheduling in Waste Management (Part II)}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2009},
  volume =	{9261},
  editor =	{Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M\"{o}hring},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.14},
  URN =		{urn:nbn:de:0030-drops-21836},
  doi =		{10.4230/DagSemProc.09261.14},
  annote =	{Keywords: Crew Scheduling, Waste Management, Integer Programming, Column Generation, Lagrangean Relaxation}
}

Search Results

Documents authored by Chmielewski, Annette

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

Abstract

Cite as

Integrated Vehicle Routing and Crew Scheduling in Waste Management (Part II)

Abstract

Cite as

Thanks for your feedback!

Could not send message