IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-37270-4_21.html
   My bibliography  Save this book chapter

The Shortest Path Algorithm Based on Petri Net

In: The 19th International Conference on Industrial Engineering and Engineering Management

Author

Listed:
  • Yu-jie Zheng

    (Kunming University of Science and Technology)

  • Kai-hu Hou

    (Kunming University of Science and Technology)

  • Wei-zhen Liao

    (Kunming University of Science and Technology)

  • Lin Yang

    (Kunming University of Science and Technology)

Abstract

The Dijkstra algorithm is the classic algorithm to solve the shortest path problem, but the solving process is relatively complicated. As the visual graphics ability and good computer skills of Petri Net, it is used to solve the shortest path problem, and according to the thought of directed Petri Net and transition enabled rules, Petri Net algorithm of solving the shortest path problem is designed. Compared to the Dijkstra algorithm, this algorithm which omits the P, T tabs and λ, S functions of the Dijkstra algorithm, can make the solution of the shortest path simpler and more convenient, improve the solution efficiency, and at the same time provide convenience for achieving algorithm objectively using computer.

Suggested Citation

  • Yu-jie Zheng & Kai-hu Hou & Wei-zhen Liao & Lin Yang, 2013. "The Shortest Path Algorithm Based on Petri Net," Springer Books, in: Ershi Qi & Jiang Shen & Runliang Dou (ed.), The 19th International Conference on Industrial Engineering and Engineering Management, edition 127, chapter 0, pages 221-229, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-37270-4_21
    DOI: 10.1007/978-3-642-37270-4_21
    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:sprchp:978-3-642-37270-4_21. 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.