Skip to main content
SpringerLink
Log in

Strategic Vehicle Routing in Practice — A pure Software Problem or a Problem Requiring Scientific Advice? Routing Problems of Daily Deliveries to the Same Customers

  • Conference paper
Quantitative Approaches to Distribution Logistics and Supply Chain Management

Part of the book series: Lecture Notes in Economics and Mathematical Systems ((LNE,volume 519))

Abstract

For improving their delivery tours, newspaper and magazine wholesalers require a practice-oriented solution to the strategic vehicle routing problem. The main tool to achieve this goal is a special software but if the most is to be gained from the existing optimization potential, it is necessary to have a detailed knowledge of the problem in its real context. This knowledge can be easily acquired by solving the problem in dialog. This paper discusses a practicable approach to the press distribution problem. It presents the situations where software tools are helpful and how they should be applied. Furthermore, a working-in-dialog procedure is described.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Becker, B. / Beckefeld, V. / Dillmann, R. (1994): Tourenplanung im Pressegrosso. In: U. Dehrigs / A. Bachem / A. Drexl, eds., Operations Research Proceedings, pp. 547–522. Springer-Verlag, Berlin.

    Google Scholar 

  • Berens, W. / Körling, F.-J. (1985): Estimating road distances by mathematical functions. European Journal of Operations Research, 21:54–56.

    Article  Google Scholar 

  • Brimberg, J. / Love, R.F. (1991): Estimating travel distances by the weighted Ip norm. Naval Research Logistics Quarterly, 38:241–259.

    Article  Google Scholar 

  • Burkard, R.E. / Rendl, F. (1984): A thermodynamics!ly motivated solution procedure for combinatorial optimization problems. European Journal of Operations Research, 17:169–174.

    Article  Google Scholar 

  • Cerny, V. (1985): Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm. Journal of Optimization Theory and Applications, 45:41–51.

    Article  Google Scholar 

  • Christofides, N. / Eilon, S. (1969): Expected distances in distribution problems. Operational Research Quarterly, 23:437–443.

    Article  Google Scholar 

  • Croes, G.A. (1958): A method for solving travelling-salesman problems. Operations Research, 6:791–812.

    Article  Google Scholar 

  • Dillmann, R. / Becker, B. / Beckefeld, V. (1996): Practical aspects of route planning for magazines and newspaper wholesalers. European Journal of Operations Research, 90:1–12.

    Article  Google Scholar 

  • Dueck, G. (1993): New optimization heuristics, the Great Deluge Algorithm and the Record-to-Record Travel. Journal of Computational Physics, 104:86–92.

    Article  Google Scholar 

  • Dueck, G. / Scheuer, T. (1990): Threshold Accepting: A General Purpose Optimization Algorithm Superior to Simulated Annealing, Journal of Computational Physics, 90:161–175.

    Article  Google Scholar 

  • Gendreau, M. / Hertz, A. / Laporte, G. (1992): New insertion and postoptimization procedures for the traveling salesman problem. Operations Research, 40:1086–1094.

    Article  Google Scholar 

  • Glover, F. (1989): Tabu Search. Part 1. ORSA Journal on Computing, 1:190–206.

    Article  Google Scholar 

  • Glover, F. (1998): Tabu Search — Wellsprings and Challenges. European Journal of Operations Research, 106:221–225.

    Article  Google Scholar 

  • Glover, F. / Laguna, M. (1995): Tabu Search. In: C. R. Reeves, ed., Modem heuristic techniques for combinatorial problems, pp. 70–150, McGraw-Hill, London.

    Google Scholar 

  • Glover, F / Taillard, E. / de Werra, D. (1993): A user’s guide to tabu search. Annals of Operations Research, 41:3–28

    Article  Google Scholar 

  • Golden, B.L. (1993): Vehicle routing problems and variants. American Journal of Mathematical and Management Science, 13:245–248.

    Google Scholar 

  • Holt, J.N. / Watts, A.M. (1988): Vehicle routing and scheduling in the newspaper industry. In: B.L. Golden / A.A. Assad, eds., Vehicle Routing: Methods and Studies, pp. 347–358, Elsevier, Amsterdam.

    Google Scholar 

  • Homberger, J. / Gehring, H. (1999): Ein Simulated-Annealing-Verfahren für das Standardproblem der Tourenpianung mit Zeitfensterrestriktionen. In: P. Kall / H.-J., Lüthi, eds., Operations Research Proceedings, pp.483–492, Springer-Verlag, Berlin.

    Google Scholar 

  • Kolesar, P. / Walker, W. / Hausner, J. (1975): Determining the relation between fire engine travel times and travel distances in New York City. Operations Research, 23:614–627.

    Article  Google Scholar 

  • Lin, S. / Kernighan, B.W. (1973): An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 21:498–516.

    Article  Google Scholar 

  • Love, R.F. / Morris, J.G. (1972): Modelling inter-city road distances by mathematical functions. Operational Research Quarterly, 23:61–71.

    Article  Google Scholar 

  • Love, R.F. / Morris, J.G. (1988): On estimating road distances by mathematical functions. European Journal of Operations Research, 36:251–253.

    Article  Google Scholar 

  • Marin, A. / Salmerón, J. (1996): A simulated annealing approach to the railroad freight transportation design problem. International Transactions in Operational Research, 3:139–149.

    Google Scholar 

  • Or, I. (1976): Traveling salesman-type combinatorial optimization problems and their relation to the logistics of regional blood banking, Ph. D. Thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston.

    Google Scholar 

  • Osman, I.H. (1993): Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research, 41:421–451.

    Article  Google Scholar 

  • Pesch, E. / Voss, S. (1995): Strategies with memories: local search in an application oriented environment, Applied local search — a prologue. OR-Spektrum, 17:55–66.

    Article  Google Scholar 

  • Renaud, J. / Boctor, F.F. / Laporte, G. (1996a): A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem. INFORMS Journal of Computing, 8:134–143.

    Article  Google Scholar 

  • Renaud, J. / Boctor, F.F. / Laporte, G. (1996b): A tabu search heuristic for the multi-depot vehicle routing problem. Computers & Operations Research, 23:229–235.

    Article  Google Scholar 

  • Rossier, Y. / Troyon, M. / Liebling, Th.M. (1986): Probabilistic exchange algorithms and euclidean traveling salesman problems. OR-Spektrum, 8:151–164.

    Article  Google Scholar 

  • Solot, P. / Cuenot, E. / Proca, A. (1990): The distribution of photographic material in Switzerland, INFOR, 29:213–224.

    Google Scholar 

  • Stokx, C.F.M. / Tilanus, C.B. (1991): Deriving route length from radial distances. European Journal of Operational Research, 50:22–26.

    Article  Google Scholar 

  • Van Breedam, A. (1994): An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle-related, customer-related, and time-related constraints, Ph.D. Thesis, Faculty of Applied Economics, University of Antwerp.

    Google Scholar 

  • Van Breedam, A. (1995): Improvement heuristics for the vehicle routing problem based on simulated annealing. European Journal of Operations Research, 86:480–490.

    Article  Google Scholar 

  • Ward, J.E. / Wendell, R.E. (1985): Using block norms for location modeling. Operations Research, 33:1074–1090.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Economics and Business Administration, University of Wuppertal, 42097, Wuppertal, Germany

    Roland Dillmann

Authors
  1. Roland Dillmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of St. Gallen, Bodanstr. 6, 9000, St. Gallen, Switzerland

    Andreas Klose

  2. Department of Quantitative Methods, University of Brescia, C. da S. Chiara, 48B, 25122, Brescia, Italy

    M. Gracia Speranza

  3. INSEAD, 77305, Fontainebleau Cedex, France

    Luk N. Van Wassenhove

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dillmann, R. (2002). Strategic Vehicle Routing in Practice — A pure Software Problem or a Problem Requiring Scientific Advice? Routing Problems of Daily Deliveries to the Same Customers. In: Klose, A., Speranza, M.G., Van Wassenhove, L.N. (eds) Quantitative Approaches to Distribution Logistics and Supply Chain Management. Lecture Notes in Economics and Mathematical Systems, vol 519. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-56183-2_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-56183-2_17

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43690-4

  • Online ISBN: 978-3-642-56183-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation