An Optimization Method for Routing Problems for Multiple AGVs by Decomposition of Petri Nets

• MAENO Ryota

  The Graduate School of Natural Science and Technology, Okayama University

• NISHI Tatsushi

  The Graduate School of Natural Science and Technology, Okayama University

• KONISHI Masami

  The Graduate School of Natural Science and Technology, Okayama University

Bibliographic Information

Other Title

• ペトリネットを用いたＡＧＶ経路計画問題の分解法による最適化
• ペトリネット オ モチイタ AGV ケイロ ケイカク モンダイ ノ ブンカイホウ ニ ヨル サイテキカ

Abstract

In this paper, we propose a decomposition and coordination method for routing problems for multiple automated guided vehicles (AGVs) using Petri Nets. An extended Petri Net model is created to represent concurrent motion of multiple AGVs. The routing problem to minimize total transportatin time is formulated by the proposed Petri Net. The optimization model for the Petri Net is decomposed into several subproblems which can be solved by Dijkstra's algorithm in polynomial order. The effectiveness of the proposed method is evaluated by several numerical examples.

Journal

• Transactions of the Institute of Systems, Control and Information Engineers

  Transactions of the Institute of Systems, Control and Information Engineers 19 (11), 426-434, 2006

  THE INSTITUTE OF SYSTEMS, CONTROL AND INFORMATION ENGINEERS (ISCIE)

Keywords

• decomposition
• optimization
• routing problem
• automated guided vehicle
• Petri nets

Details

• CRID: 1390282680143128704
• NII Article ID: 10018420297
• NII Book ID: AN1013280X
• DOI: 10.5687/iscie.19.426
• ISSN: 2185811X
• ISSN: 13425668
• ISSN: http://id.crossref.org/issn/13425668
• NDL BIB ID: 8538844
• Web Site: https://ndlsearch.ndl.go.jp/books/R000000004-I8538844
• Text Lang: ja
• Data Source:
  • JaLC
  • NDL
  • Crossref
  • CiNii Articles
• Abstract License Flag: Disallowed