Advertisement

Hector pp 432-440 | Cite as

A Heuristic Method for Solving the Vehicle Routing Problem — Implementation and Graphics

  • Martin Morlock
Conference paper

Abstract

The vehicle routing problem (VRP) or vehicle scheduling problem appears in a large number of various practical situations concerning the distribution or collection of commodities which may be of physical or nonphysical nature. Furthermore a lot of problems can be formulated as VRPs. In this paper the applications of well known heuristics for solving the VRP on a PC are described with emphasis on their use in practice. For successfull applications of quantitative operations research methods beside efficient algorithms a comfortable handling of the problems and supporting facilities like graphics are required to visualize the resulting solutions. On the basis of the approved Savings-method in the course of some study-and diploma thesises a suitable editor as well as the graphic presentation of the routes was implemented and tested, thus showing for example the requirement of zooming-techniques for practical use. To incooperate the experience of practical men for the construction of satisfactory solutions, it seems to be evident, that the application of knowledge-based systems is forthcoming. In a first study with the expert-system-shell M.1 problems with these very promising opportunities of artificial intelligence tools are sketched.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Jung, M., “Tourenplanung mit Kundenzeitschranken auf der Grundlage von Multitour - Entwicklung und Test anhand realer logistischer Probleme,” Diploma Thesis. Institut für Wirtschaftstheorie und Operations Research, University of Karlsruhe, 1986Google Scholar
  2. [2]
    Kohler, J., “Tourenplanung Beschreibung des parallelen, sequentiellen und m-parallelen Savings-Verfahrens.” Study Thesis, Institut für Wirtschaftstheorie und Operations Research, University of Karlsruhe, 1986Google Scholar
  3. [3]
    Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B. (Eds.), “The Travelling Salesman Problem,” John Wiley & Sons, 1985Google Scholar
  4. [4]
    Paul, A., “Entwurf und Implementierung eines benutzerfreundlichen Editors für Tourenplanungsprobleme auf IBM PC-XT/AT,” Diploma Thesis, Institut für Wirtschaftstheorie und Operations Research, University of Karlsruhe, 1986Google Scholar
  5. [5]
    Rothermel, R., “Entwurf und Implementierung einer Graphik-Ausgabe für Tourenplanungsprobleme auf dem IBM PC-XT/AT,” Study Thesis, Institut für Wirtschaftstheorie und Operations Research, University of Karlsruhe, 1987Google Scholar
  6. [6]
    Rösch, J., “Implementierung des m-parallelen Savings-Verfahrens auf dem IBM PC,” Diploma Thesis, Institut für Wirtschaftstheorie und Operations Research, University of Karlsruhe, 1987Google Scholar
  7. [7]
    Schnelle, M., “Programmpaket Tourenplanung,” Report WIOR-254, Institut für Wirtschaftstheorie und Operations Research, Unviversity of Karlsruhe, 1987Google Scholar
  8. [8]
    Schwarz, J., “Einsatzmöglichkeiten des Expetensystem-Shell M.1 in der Tourenplanung,” Diploma Thesis, Institut für Wirtschaftstheorie und Operations Research, University of Karlsruhe, 1987Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Martin Morlock
    • 1
  1. 1.Institut für Wirtschaftstheorie und Operations ResearchUniversität KarlsruheKarlsruheGermany

Personalised recommendations