Advertisement

Heuristics for a Real-World Mail Delivery Problem

  • Elisabeth Gussmagg-Pfliegl
  • Fabien Tricoire
  • Karl F. Doerner
  • Richard F. Hartl
  • Stefan Irnich
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6625)

Abstract

We are solving a mail delivery problem by combining exact and heuristic methods. The problem is a tactical routing problem as routes for all postpersons have to be planned in advance for a period of several months. As for many other routing problems, the task is to construct a set of feasible routes serving each customer exactly once at minimum cost. Four different modes (car, moped, bicycle, and walking) are available, but not all customers are accessible by all modes. Thus, the problem is characterized by three interdependent decisions: the clustering of customers into districts, the choice of a mode for each district, and the routing of the postperson through its district. We present a two-phase solution approach that we have implemented and tested on real world instances. Results show that the approach can compete with solutions currently employed and is able to improve them by up to 9.5%.

Keywords

mail delivery hybrid solution approach set covering 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baker, E.K., Schaffer, J.R.: Solution improvement heuristics for the vehicle routing and scheduling problem with time window constraints. Amer. J. Math. Management Sci. 6, 261–300 (1986)MATHGoogle Scholar
  2. Bodin, L., Levy, L.: Scheduling of Local Delivery Carrier Routes for the United States Postal Service. In: Dror, M. (ed.) Arc Routing: Theory, Solutions, and Applications, pp. 419–442. Kluwer, Boston (2000)CrossRefGoogle Scholar
  3. Clarke, G., Wright, J.W.: Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations Research 12, 568–581 (1964)CrossRefGoogle Scholar
  4. Doerner, K.F., Schmid, V.: Survey: Matheuristics for Rich Vehicle Routing Problems. In: Blesa, M.J., Blum, C., Raidl, G., Roli, A., Sampels, M. (eds.) HM 2010. LNCS, vol. 6373, pp. 206–221. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  5. Fisher, M.L., Jaikumar, R.: A generalized assignment heuristic for vehicle routing. Networks 11, 109–124 (1981)MathSciNetCrossRefGoogle Scholar
  6. Golden, B., Raghavan, S., Wasil, E. (eds.): The Vehicle Routing Problem. Latest Advances and New Challenges. Springer Science+Business Media, LLC (2008)MATHGoogle Scholar
  7. Muter, I., Birbil, S.I., Sahin, G.: Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems. Informs Journal on Computing 22(4), 603–619 (2010)CrossRefMATHGoogle Scholar
  8. Oppen, J., Løkketangen, A.: Arc routing in a node routing environment. Computers & Operations Research 33, 1033–1055 (2006)CrossRefMATHGoogle Scholar
  9. Orloff, C.S.: A Fundamental Problem in Vehicle Routing. Networks 4, 35–64 (1974)MathSciNetCrossRefMATHGoogle Scholar
  10. Renaud, J., Boctor, F.F., Laporte, G.: An Improved Petal Heuristic for the Vehicle Routeing Problem. Journal of the Operational Research Society 47, 329–336 (1996)CrossRefMATHGoogle Scholar
  11. Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia (2002)Google Scholar
  12. Wøhlk, S.: Contributions to Arc Routing. PhD thesis, University of Southern Denmark (2006)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Elisabeth Gussmagg-Pfliegl
    • 1
  • Fabien Tricoire
    • 1
  • Karl F. Doerner
    • 1
    • 2
  • Richard F. Hartl
    • 1
  • Stefan Irnich
    • 3
  1. 1.University of ViennaAustria
  2. 2.Johannes Kepler University LinzAustria
  3. 3.Johannes Gutenberg University MainzGermany

Personalised recommendations