IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-60550-5_50.html

Optimale Linienführung und Routenplanung in Verkehrssystemen

In: Mathematik Schlüsseltechnologie für die Zukunft

Author

Listed:
  • A. Bachem

    (Universität zu Köln, Zentrum für Paralleles Rechnen)

  • A. Hamacher

    (Universität zu Köln, Zentrum für Paralleles Rechnen)

  • Ch. Moll

    (Universität zu Köln, Zentrum für Paralleles Rechnen)

  • G. Raspel

    (FGT Logistik)

Abstract

This paper decribes Vehicle Routing Problems appearing at a specific company, the Gerresheimer Glas AG. There are two different kind of problems: a full load routing problem and a multi-depot partial load delivery problem. We introduce algorithms that solve these problems and discuss modifications and alternatives for our specific practical constraints. Another approach to minimize the overall distance covered by empty trucks is the idea of introducing reload stations. This leads to the mathematical formulation of Steiner problems. For all these problems a good calculation of the driving times is necessary to employ the algorithms on practical problems. In this context a short overview over traffic simulation systems is given. At last the software engineering problems of dispositions systems are discussed.

Suggested Citation

  • A. Bachem & A. Hamacher & Ch. Moll & G. Raspel, 1997. "Optimale Linienführung und Routenplanung in Verkehrssystemen," Springer Books, in: Karl-Heinz Hoffmann & Willi Jäger & Thomas Lohmann & Hermann Schunck (ed.), Mathematik Schlüsseltechnologie für die Zukunft, pages 625-636, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-60550-5_50
    DOI: 10.1007/978-3-642-60550-5_50
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-642-60550-5_50. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.