License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09261.22
URN: urn:nbn:de:0030-drops-21625
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2009/2162/
Go to the corresponding Portal

Hempsch, Christoph

Optimization of mail collection networks

pdf-format:
09261.HempschChristoph.ExtAbstract.2162.pdf (0.08 MB)

Abstract

Some providers of postal or parcel services promise high levels of service to their customers, e.g., next day delivery, resulting in tight lead times. To meet these high service levels, complex logistics networks need to be planned and operated. Such networks are typically divided into transportation of letters or parcels from customer locations to a local sorting terminal (collection), inter-terminal transportation, and transportation from a terminal to customer locations (delivery). Within postal logistics networks the interaction of processing at and transportation between different kinds of facilities plays a vital role. Normally, collection and initial sorting, as well as inter-terminal transportation and final sorting need to be finished before certain cut-off times. Thus, guaranteeing the subsequent transportation to start on time.

The talk presents various optimization problems within the part of a postal logistics network where collection takes place. Then, two of those problems are presented in more detail. First, the allocation of pickup locations to sorting terminals and, second, the optimization of collection tours. Both problems not only consider service time windows at customer locations and at terminals but also complex sorting capacities at the sorting terminals. For both problems appropriate mathematical models and solution methods will be discussed. Also generic and practical applications are presented.

BibTeX - Entry

@InProceedings{hempsch:DagSemProc.09261.22,
  author =	{Hempsch, Christoph},
  title =	{{Optimization of mail collection networks}},
  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.dagstuhl.de/opus/volltexte/2009/2162},
  URN =		{urn:nbn:de:0030-drops-21625},
  doi =		{10.4230/DagSemProc.09261.22},
  annote =	{Keywords: Postal logistics, allocation, VRPTW}
}

Keywords: Postal logistics, allocation, VRPTW
Collection: 09261 - Models and Algorithms for Optimization in Logistics
Issue Date: 2009
Date of publication: 02.10.2009

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI