IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-540-27679-1_3.html
   My bibliography  Save this book chapter

Conflict-free Real-time AGV Routing

In: Operations Research Proceedings 2004

Author

Listed:
  • Rolf H. Möhring

    (Technische Universität Berlin)

  • Ekkehard Köhler

    (Technische Universität Berlin)

  • Ewgenij Gawrilow

    (Technische Universität Berlin)

  • Björn Stenzel

    (Technische Universität Berlin)

Abstract

We present an algorithm for the problem of routing Automated Guided Vehicles (AGVs) in an automated logistic system. The algorithm avoids collisions, deadlocks and livelocks already at the time of route computation (conflict-free routing). After a preprocessing step the real-time computation for each request consists of the determination of a shortest path with time-windows and a following readjustment of these time-windows. Both is done in polynomial-time. Using goal-oriented search we get computation times which are appropriate for real-time routing. Additionally, in comparison to a static routing approach, used in Container Terminal Altenwerder (CTA) at Hamburg Harbour, our algorithm had an explicit advantage.

Suggested Citation

  • Rolf H. Möhring & Ekkehard Köhler & Ewgenij Gawrilow & Björn Stenzel, 2005. "Conflict-free Real-time AGV Routing," Operations Research Proceedings, in: Hein Fleuren & Dick Hertog & Peter Kort (ed.), Operations Research Proceedings 2004, pages 18-24, Springer.
    • Handle: RePEc:spr:oprchp:978-3-540-27679-1_3
    DOI: 10.1007/3-540-27679-3_3
    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 search for a similarly titled item that would be available.

    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:oprchp:978-3-540-27679-1_3. 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.