33 Search Results for "Clausen, Uwe"


Document
The Combinatorics of (S,M,L,XL) or the best fitting delivery of T-shirts

Authors: Constantin Gaul, Sascha Kurz, and Jörg Rambau

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


Abstract
A fashion discounter supplies its branches with apparel in various sizes. Apparel is ordered in pre-packs three months in advance from overseas: replenishment impossible. Thus, the supply in each size and branch must be consistent with the demand right away. We present new ILP-models for the resulting lot-type design problem: For each branch, find lot types and delivery volumes so that the demand is met best. Our vision is an integrated price-and-size optimization model that takes the mark-down process into account when placing the orders. The results are applied by a german fashion discounter with over 1000 branches.

Cite as

Constantin Gaul, Sascha Kurz, and Jörg Rambau. The Combinatorics of (S,M,L,XL) or the best fitting delivery of T-shirts. 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{gaul_et_al:DagSemProc.09261.29,
  author =	{Gaul, Constantin and Kurz, Sascha and Rambau, J\"{o}rg},
  title =	{{The Combinatorics of (S,M,L,XL) or the best fitting delivery of T-shirts}},
  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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.29},
  URN =		{urn:nbn:de:0030-drops-21718},
  doi =		{10.4230/DagSemProc.09261.29},
  annote =	{Keywords: Supply chain management, fashion retailer, integer linear programming, demand forecasting}
}
Document
The New Dutch Timetable: The OR Revolution

Authors: Dennis Huisman

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


Abstract
On April 14, 2008, INFORMS (The Institute for Operations Research and Management Sciences) announced Netherlands Railways to be the winner of the 2008 Franz Edelman Award. In this extended abstract, we give a short summary of both the paper and the presentation of the winning team.

Cite as

Dennis Huisman. The New Dutch Timetable: The OR Revolution. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


Copy BibTex To Clipboard

@InProceedings{huisman:DagSemProc.09261.30,
  author =	{Huisman, Dennis},
  title =	{{The New Dutch Timetable: The OR Revolution}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--3},
  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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.30},
  URN =		{urn:nbn:de:0030-drops-21696},
  doi =		{10.4230/DagSemProc.09261.30},
  annote =	{Keywords: Timetable}
}
Document
The Transport PDE and Mixed-Integer Linear Programming

Authors: Armin Fügenschuh, Björn Geißler, Alexander Martin, and Antonio Morsi

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


Abstract
Discrete, nonlinear and PDE constrained optimization are mostly considered as different fields of mathematical research. Nevertheless many real-life problems are most naturally modeled as PDE constrained mixed integer nonlinear programs. For example, nonlinear network flow problems where the flow dynamics are governed by a transport equation are of this type. We present four different applications together with the derivation of the associated transport equations and we show how to model these problems in terms of mixed integer linear constraints.

Cite as

Armin Fügenschuh, Björn Geißler, Alexander Martin, and Antonio Morsi. The Transport PDE and Mixed-Integer Linear Programming. 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{fugenschuh_et_al:DagSemProc.09261.31,
  author =	{F\"{u}genschuh, Armin and Gei{\ss}ler, Bj\"{o}rn and Martin, Alexander and Morsi, Antonio},
  title =	{{The Transport PDE and Mixed-Integer Linear Programming}},
  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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.31},
  URN =		{urn:nbn:de:0030-drops-21679},
  doi =		{10.4230/DagSemProc.09261.31},
  annote =	{Keywords: Transport Equation, Partial Differential Equation, Mixed-Integer Linear Programming, Modeling, Nonlinear Constraints}
}
Document
Traffic Information and Dynamic Vehicle Routing in Forwarding Agencies

Authors: Sascha Wohlgemuth

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


Abstract
Freight transportation is essential for most economies. The main focus is on forwarding agencies handling less-than-truckload freight. In general, direct transportation from origin to destination would be too expensive. Therefore, the main idea is to consolidate enough small shipments to efficiently conduct transportation for the majority of the distance. In preparation of this transport it is necessary to pick up commodities from different customer locations in the origin region. At the transshipment point consignments with the same destination region are grouped on one truck heading for this region. Upon arrival they are transshipped again on smaller trucks and distributed to the customers. Nearly every transshipment point collects as well as rolls out goods. Thus, typical forwarding agencies perform pickups as well as deliveries conjoined on the same vehicle. They have to cope with hundreds of pickups and deliveries each day and a few tens of vehicles are necessary to service the customers in the local region. The performance is mainly influenced by two dynamic factors: First, due to developments in information and communication technology, the agencies receive pickup orders increased shortly before the actual pickup. Second, unexpected traffic situations are endangering the scheduled pickups, though traffic information is increasingly available. Surprisingly this information is hardly used in the forwarding industry, even though vehicle locations are available in real-time via global positioning systems. The consequence is that these companies are fighting lateness of shipments and poor utilization of vehicles. Therefore, the objective is to develop an intelligent planning system based on mathematical optimization heuristics to assist forwarding agencies in routing vehicles efficiently.

Cite as

Sascha Wohlgemuth. Traffic Information and Dynamic Vehicle Routing in Forwarding Agencies. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


Copy BibTex To Clipboard

@InProceedings{wohlgemuth:DagSemProc.09261.32,
  author =	{Wohlgemuth, Sascha},
  title =	{{Traffic Information and Dynamic Vehicle Routing in Forwarding Agencies}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--7},
  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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.32},
  URN =		{urn:nbn:de:0030-drops-21736},
  doi =		{10.4230/DagSemProc.09261.32},
  annote =	{Keywords: Dynamic vehicle routing, pickup and delivery problem, forwarding agency, less-than-truckload freight, varying travel times, clustering, tabu search}
}
Document
Using Branch-and-Price to Find High Quality Solutions Quickly

Authors: George Nemhauser, Mike Hewitt, and Martin Savelsbergh

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


Abstract
We develop an exact solution approach for integer programs that produces high- quality solutions quickly by solving well-chosen restrictions of the problem. Column generation is used both for generating these problem restrictions and for producing bounds on the value of an optimal solution to the problem. Obtaining primal solutions by solving problem restrictions also provides an easy way to search for improved solutions in the neighborhood of the current best solution. The overall approach is parallelized and computational experiments demonstrate its efficacy. An application to inventory routing is presented.

Cite as

George Nemhauser, Mike Hewitt, and Martin Savelsbergh. Using Branch-and-Price to Find High Quality Solutions Quickly. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


Copy BibTex To Clipboard

@InProceedings{nemhauser_et_al:DagSemProc.09261.33,
  author =	{Nemhauser, George and Hewitt, Mike and Savelsbergh, Martin},
  title =	{{Using Branch-and-Price to Find High Quality Solutions Quickly}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--2},
  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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.33},
  URN =		{urn:nbn:de:0030-drops-21681},
  doi =		{10.4230/DagSemProc.09261.33},
  annote =	{Keywords: Column generation, branch-and-price, mixed-integer programming, inventory routing}
}
Document
09261 Abstracts Collection – Models and Algorithms for Optimization in Logistics

Authors: Cynthia Barnhart, Uwe Clausen, Ulrich Lauther, and Rolf H. Möhring

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


Abstract
From June 21 to June 26, 2009 the Dagstuhl Seminar Perspectives Workshop 09261 ``Models and Algorithms for Optimization in Logistics '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Cynthia Barnhart, Uwe Clausen, Ulrich Lauther, and Rolf H. Möhring. 09261 Abstracts Collection – Models and Algorithms for Optimization in Logistics. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


Copy BibTex To Clipboard

@InProceedings{barnhart_et_al:DagSemProc.09261.1,
  author =	{Barnhart, Cynthia and Clausen, Uwe and Lauther, Ulrich and M\"{o}hring, Rolf H.},
  title =	{{09261 Abstracts Collection – Models and Algorithms for Optimization in Logistics }},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--18},
  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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.1},
  URN =		{urn:nbn:de:0030-drops-21915},
  doi =		{10.4230/DagSemProc.09261.1},
  annote =	{Keywords: Logistics, optimization, transport}
}
Document
09261 Executive Summary – Models and Algorithms for Optimization in Logistics

Authors: Cynthia Barnhart, Uwe Clausen, Ulrich Lauther, and Rolf H. Möhring

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


Abstract
From June 21 to June 26, 2009, the Dagstuhl Seminar 09261 on Models and Algorithms for Optimization in Logistics was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

Cite as

Cynthia Barnhart, Uwe Clausen, Ulrich Lauther, and Rolf H. Möhring. 09261 Executive Summary – Models and Algorithms for Optimization in Logistics. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


Copy BibTex To Clipboard

@InProceedings{barnhart_et_al:DagSemProc.09261.2,
  author =	{Barnhart, Cynthia and Clausen, Uwe and Lauther, Ulrich and M\"{o}hring, Rolf H.},
  title =	{{09261 Executive Summary – Models and Algorithms for Optimization in Logistics}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--2},
  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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.2},
  URN =		{urn:nbn:de:0030-drops-21752},
  doi =		{10.4230/DagSemProc.09261.2},
  annote =	{Keywords: Logistics, optimization, transport}
}
Document
A Network Design Problem

Authors: Anton J. Kleywegt, Jinpyo Lee, and Amy R. Ward

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


Abstract
We consider the problem of designing a distribution network to facilitate the repeated movement of shipments from many origins to many destinations. A sufficient number of the origin-destination shipments require less than the capacity of a vehicle, so that consolidation of shipments is economical. We consider the case in which consolidation takes place at terminals, and we assume each shipment moves through exactly one terminal on its way from its origin to its destination. Then, a major design decision is to determine the best number of terminals. We develop a continuous approximation method to estimate transportation costs as a function of the number of terminals. We use the continuous approximation method to choose the number of terminals that minimizes the sum of terminal cost and transportation cost. Numerical results indicate that the design resulting from the continuous approximation method facilitates operations with lower cost than those resulting from a widely used integer programming based design.

Cite as

Anton J. Kleywegt, Jinpyo Lee, and Amy R. Ward. A Network Design Problem. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-56, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


Copy BibTex To Clipboard

@InProceedings{kleywegt_et_al:DagSemProc.09261.3,
  author =	{Kleywegt, Anton J. and Lee, Jinpyo and Ward, Amy R.},
  title =	{{A Network Design Problem}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--56},
  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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.3},
  URN =		{urn:nbn:de:0030-drops-21768},
  doi =		{10.4230/DagSemProc.09261.3},
  annote =	{Keywords: Network design, continuous approximation}
}
Document
A Robust PTAS for the Parallel Machine Covering Problem

Authors: Martin Skutella and Jose Verschae

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


Abstract
In general, combinatorial optimization problems are unstable: slight changes on the instance of a problem can render huge changes in the optimal solution. Thus, a natural question arises: Can we achieve stability if we only maintain approximate solutions?. In this talk I will first formalize these ideas, and then show some results on the parallel machine covering problem. In particular I will derive a robust PTAS, i.e., I will show how to construct a solution that is not only $(1-epsilon)$-approximate, but is also stable. That is, if the instance is changed by adding or removing a job, then we can construct a new near-optimal solution by only slightly modifying the previous one.

Cite as

Martin Skutella and Jose Verschae. A Robust PTAS for the Parallel Machine Covering 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)


Copy BibTex To Clipboard

@InProceedings{skutella_et_al:DagSemProc.09261.4,
  author =	{Skutella, Martin and Verschae, Jose},
  title =	{{A Robust PTAS for the Parallel Machine Covering Problem}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--3},
  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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.4},
  URN =		{urn:nbn:de:0030-drops-21609},
  doi =		{10.4230/DagSemProc.09261.4},
  annote =	{Keywords: Stability, approximation schemes, online algorithms}
}
Document
Aspects and Views on Mathematical Optimization in Logistics in the Chemical Process Industry

Authors: Josef Kallrath

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


Abstract
In large chemical companies, traffic logistics and supply chain logistics contain many decision problems which are suitable to be solved by mathematical optimization. The objectives are to exploit resources (traffic infrastructure such as roads and rail lines, production equipment) in a cost optimal way and to maximize profit. We present two cases: optimal sequences of rail cars in trains visiting various plants in a large company complex, and production and distribution planning. Finally, we discuss the importance of data structure and the consequences of differences between the "booking world" view of systems such as SAP and the "physical world" mapped into mathematical optimization models.

Cite as

Josef Kallrath. Aspects and Views on Mathematical Optimization in Logistics in the Chemical Process Industry. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


Copy BibTex To Clipboard

@InProceedings{kallrath:DagSemProc.09261.5,
  author =	{Kallrath, Josef},
  title =	{{Aspects and Views on Mathematical Optimization in Logistics in the Chemical Process Industry}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--4},
  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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.5},
  URN =		{urn:nbn:de:0030-drops-21616},
  doi =		{10.4230/DagSemProc.09261.5},
  annote =	{Keywords: Logistics, traffic, supply chain, role of data, planning systems, data interfacing to SAP}
}
Document
Branch-and-Price Solving in G12

Authors: Jakob Puchinger, Peter Stuckey, Mark Wallace, and Sebastian Brand

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


Abstract
The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combination of solving methods. Model annotations are used to control this process. In this paper we explain the mapping to branch-and-price solving. G12 supports the selection of specialised subproblem solvers, the aggregation of identical subproblems, automatic disaggregation when required by search, and the use of specialised branching rules. We demonstrate the benefits of the G12 framework on three examples: a trucking problem, cutting stock, and two-dimensional bin packing.

Cite as

Jakob Puchinger, Peter Stuckey, Mark Wallace, and Sebastian Brand. Branch-and-Price Solving in G12. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


Copy BibTex To Clipboard

@InProceedings{puchinger_et_al:DagSemProc.09261.6,
  author =	{Puchinger, Jakob and Stuckey, Peter and Wallace, Mark and Brand, Sebastian},
  title =	{{Branch-and-Price Solving in G12}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--3},
  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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.6},
  URN =		{urn:nbn:de:0030-drops-21641},
  doi =		{10.4230/DagSemProc.09261.6},
  annote =	{Keywords: Combinatorial optimization, branch-and-price, software}
}
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-dev.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
Formulations, Bounds and Heuristic Methods for a Two-Echelon Adaptive Location-Distribution Problem

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

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


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.

Cite as

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)


Copy BibTex To Clipboard

@InProceedings{gendron_et_al:DagSemProc.09261.8,
  author =	{Gendron, Bernard and Khuong, Paul-Virak and Semet, Fr\'{e}d\'{e}ric},
  title =	{{Formulations, Bounds and Heuristic Methods for a Two-Echelon Adaptive Location-Distribution Problem}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--3},
  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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.8},
  URN =		{urn:nbn:de:0030-drops-21892},
  doi =		{10.4230/DagSemProc.09261.8},
  annote =	{Keywords: Two-echelon location problem, formulations, relaxations, variable neighborhood search}
}
Document
Grammar-Based Integer Programing Models for Multi-Activity Shift Scheduling

Authors: Marie-Claude Cote, Bernard Gendron, and Louis-Martin Rousseau

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


Abstract
We present a new implicit formulation for shift scheduling problems, using context-free grammars to model regulation in the composition of shifts. From the grammar, we generate an integer programming (IP) model allowing the same set of shifts as Dantzig’s set covering model. When solved by a state-of-the- art IP solver on problems allowing a small number of shifts, our model, the set covering formulation and a typical implicit model from the literature yield comparable solving times. Moreover, on instances where many shifts are allowed, our model is superior and can encode a wider variety of constraints. Among others, multi-activity cases, which cannot be modeled by existing implicit formulations, can easily be captured with grammars.

Cite as

Marie-Claude Cote, Bernard Gendron, and Louis-Martin Rousseau. Grammar-Based Integer Programing Models for Multi-Activity Shift Scheduling. In Models and Algorithms for Optimization in Logistics. Dagstuhl Seminar Proceedings, Volume 9261, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009)


Copy BibTex To Clipboard

@InProceedings{cote_et_al:DagSemProc.09261.9,
  author =	{Cote, Marie-Claude and Gendron, Bernard and Rousseau, Louis-Martin},
  title =	{{Grammar-Based Integer Programing Models for Multi-Activity Shift Scheduling}},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  pages =	{1--2},
  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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.9},
  URN =		{urn:nbn:de:0030-drops-21775},
  doi =		{10.4230/DagSemProc.09261.9},
  annote =	{Keywords: Shift Scheduling, Implicit models, Integer Programming, Context-free grammars}
}
Document
Humanitarian Supply Chain Management - An Overview

Authors: Ozlem Ergun, Gonca Karakus, Pinar Keskinocak, Julie Swann, and Monica Villarreal

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


Abstract
Disasters recently received the attention of the Operations Research community due to the great potential of improving disaster related operations through the use of analytical tools, and the impact on people that this implies. In this introductory article, we describe the main characteristics of disaster supply chains, and we highlight the particular issues that are faced when managing these supply chains. We illustrate how Operations Research tools can be used to make better decisions, taking debris management operations as an example, and discuss potential general research directions in this area.

Cite as

Ozlem Ergun, Gonca Karakus, Pinar Keskinocak, Julie Swann, and Monica Villarreal. Humanitarian Supply Chain Management - An Overview. 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{ergun_et_al:DagSemProc.09261.10,
  author =	{Ergun, Ozlem and Karakus, Gonca and Keskinocak, Pinar and Swann, Julie and Villarreal, Monica},
  title =	{{Humanitarian Supply Chain Management - An Overview}},
  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-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.09261.10},
  URN =		{urn:nbn:de:0030-drops-21819},
  doi =		{10.4230/DagSemProc.09261.10},
  annote =	{Keywords: Humanitarian logistics}
}
  • Refine by Author
  • 3 Barnhart, Cynthia
  • 3 Clausen, Uwe
  • 3 Möhring, Rolf H.
  • 2 Chmielewski, Annette
  • 2 Fügenschuh, Armin
  • Show More...

  • Refine by Classification

  • Refine by Keyword
  • 4 Logistics
  • 3 optimization
  • 2 Crew Scheduling
  • 2 Integer Programming
  • 2 Waste Management
  • Show More...

  • Refine by Type
  • 33 document

  • Refine by Publication Year
  • 33 2009

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