IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/5040513.html
   My bibliography  Save this article

Exact and Heuristic Algorithms for Routing AGV on Path with Precedence Constraints

Author

Listed:
  • Liang Xu
  • Yao Wang
  • Lin Liu
  • Jiaxing Wang

Abstract

A new problem arises when an automated guided vehicle (AGV) is dispatched to visit a set of customers, which are usually located along a fixed wire transmitting signal to navigate the AGV. An optimal visiting sequence is desired with the objective of minimizing the total travelling distance (or time). When precedence constraints are restricted on customers, the problem is referred to as traveling salesman problem on path with precedence constraints (TSPP-PC). Whether or not it is NP-complete has no answer in the literature. In this paper, we design dynamic programming for the TSPP-PC, which is the first polynomial-time exact algorithm when the number of precedence constraints is a constant. For the problem with number of precedence constraints, part of the input can be arbitrarily large, so we provide an efficient heuristic based on the exact algorithm.

Suggested Citation

  • Liang Xu & Yao Wang & Lin Liu & Jiaxing Wang, 2016. "Exact and Heuristic Algorithms for Routing AGV on Path with Precedence Constraints," Mathematical Problems in Engineering, Hindawi, vol. 2016, pages 1-8, July.
    • Handle: RePEc:hin:jnlmpe:5040513
    DOI: 10.1155/2016/5040513
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2016/5040513.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2016/5040513.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2016/5040513?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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:hin:jnlmpe:5040513. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.