Abstract
This paper considers the postal logistics area, more precisely, the distribution networks for letter mail. A main service provided by postal companies is letter mail transportation and delivery. In this market segment there have been two key efforts during the last few years: reduction in transportation and delivery time (service quality) and minimization of costs under service quality constraints. Both efforts—reduction of service time and minimization of costs for providing the promised services—have a strong impact on the quality of the strategic and the tactical planning phases of the respective distribution networks. The Operations Research type of analytical models used in the strategic and tactical planning phases of distribution networks in postal organizations are: facility location, location routing, service networks design, and vehicle routing and scheduling models. In this article we introduce the structure of a typical distribution network for letter mail and for parcel mail, and we describe the main subnetworks. This paper is also concerned with projects on optimization of such subnetworks. Therefore, we have selected three projects dealing with different subsystems and covering the strategic and the tactical planning phases as well. The projects are in the areas of collecting mail from mailboxes (vehicle routing), replanning of delivery station locations (facility location combined with vehicle routing), and reducing deadheading in the last mile (facility location combined with vehicle routing). Each of the projects covers system analysis, modeling, development of optimization algorithms, and a software prototype.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Balinski ML (1965) Integer programming: methods, uses, computation. Manag Sci 12:253–313
Bräysy O, Gendreau M (2005) Vehicle routing with time windows, part I: route construction and local search algorithms. Transp Sci 39:104–118
Büdenbender K, Grünert T, Sebastian HJ (2000) A hybrid tabu search branch and bound algorithm for the direct flight network design problem. Transp Sci 34:364–380
Engelhard G, Grünert T, Sebastian HJ (1998) Thäringen M, Katz M, Kuchem R: Und ab geht die Post—Transportplanung für den Brieftransport der Deutschen Post AG. OR News
Grünert T, Sebastian HJ (2000) Planning models for long-haul operations of postal and express shipment companies. Eur J Oper Res 122:289–309
Hempsch C, Irnich S (2008) Vehicle-routing problems with inter-tour resource constraints. In: Golden BL, Raghavan S, Wasil EA (eds) The vehicle routing problem: latest advances and new challenges. Springer, New York, pp 421–444
Hermanns C (2009) Planung und Optimierung von Auslieferungsstandorten in komplexen Distributionsnetzwerken. Mainz Verlag, Aachen
Irnich S (2002) Netzwerk-Design für zweistufige Transportsysteme und ein Branch-and-Price-Verfahren für das gemischte Direkt- und Hinflugproblem. Dissertation, RWTH Aachen University, http://darwin.bth.rwth-aachen.de/opus3/volltexte/2002/300/pdf/Irnich_Stefan.pdf. Accessed 08 Nov 2013
Irnich S (2007) Resource extension functions: properties, inversion, and generalization to segments. OR Spectr 30:113–148
Irnich S (2008) A unified modeling and solution framework for vehicle routing and local search-based metaheuristics. Informs J Comput 20:270–287
Laporte G, Chapleau S, Landry PE, Mercure H (1989) An algorithm for the design of mailbox collection routes in Urban areas. Transp Res B-Methodol 23:271–280
Mechti R, Poujade S, Roucairol C, Lemarie B (1999) Global and local moves in tabu search: a real-life mail collection application. In: Voß S, Martello S, Osman IH, Roucairol C (eds) Meta-Heuristics: advances and trends in local search paradigms for optimization. Kluwer Academic, Boston, pp 155–174
Nagy G, Salhi S (2007) Location-routing: issues, models and methods. Eur J Oper Res 177:649–672
Pajunas A, Matto EJ, Trick M, Zuluaga LF (2007) Optimizing highway transportation at the United States postal service. Interfaces 37:515–525
Perl J, Daskin MS (1985) A warehouse location-routing problem. Transp Res B 19:381–396
Sebastian HJ (2012) Optimization in postal logistics. Presented at the INFORMS conference on applying science to the art of business, Miami, FL, http://meetings2.informs.org/Practice06/FINAL%20progPractice%20Conference%202006.pdf. Accessed 08 Nov 2013
Sebastian HJ (2012) Optimization approaches in the strategic and tactical planning of networks. In: Dolk D, Granat J (eds) Modeling for decision support in network-based services. Lecture Notes in Business Information Processing. Springer, Berlin Heidelberg, pp 36–61
Suhl UH (1994) MOPS—mathematical optimization system. Eur J Oper Res 72:312–322
Tarantilis CD, Kiranoudis CT, Markatos NC (2002) Use of the BATA algorithm and MIS to solve the mail carrier problem. Appl Math Model 26:481–500
Toth P, Vigo D (2002) An overview of vehicle routing problems. In: Toth P, Vigo D (eds) The vehicle routing problem. Siam, Philadelphia, pp 1–23
Toth P, Vigo D (2002) Branch-and-bound algorithms for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problem. Siam, Philadelphia, pp 29–51
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Gündüz, H.I., Hempsch, C.K., Sebastian, HJ. (2015). Recent Advances in Strategic and Tactical Planning of Distribution Subnetworks for Letter Mail. In: Sebastian, HJ., Kaminsky, P., Müller, T. (eds) Quantitative Approaches in Logistics and Supply Chain Management. Lecture Notes in Logistics. Springer, Cham. https://doi.org/10.1007/978-3-319-12856-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-12856-6_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-12855-9
Online ISBN: 978-3-319-12856-6
eBook Packages: EngineeringEngineering (R0)