Petri net decomposition approach for bi-objective conflict-free routing for AGV systems

Shuhei Eda; Tatsushi Nishi; Toshisada Mariyama; Satomi Kataoka; Kazuya Shoda; Katsuhiko Matsumura

doi:10.1109/ICSMC.2011.6083754

Petri net decomposition approach for bi-objective conflict-free routing for AGV systems

Shuhei Eda, Tatsushi Nishi, Toshisada Mariyama, Satomi Kataoka, Kazuya Shoda, Katsuhiko Matsumura

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

Abstract

In this paper, we propose a Petri Net decomposition approach for solving the bi-objective conflict-free routing for AGV systems. The objective is to minimize the deviation of delivery time and to minimize the total transportation time. The dispatching and conflict-free routing problem for AGVs is represented as an optimal firing sequence problem for Petri Net. A Petri Net decomposition approach is applied to solve the multi-objective optimization problem efficiently. The convergence of the algorithm is improved by reducing the search region. The effectiveness of the proposed method is compared with that of the conventional method. Computational results show the effectiveness of the proposed method.

Original language	English
Title of host publication	2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Conference Digest
Pages	820-825
Number of pages	6
DOIs	https://doi.org/10.1109/ICSMC.2011.6083754
Publication status	Published - 2011
Externally published	Yes
Event	2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Anchorage, AK, United States Duration: Oct 9 2011 → Oct 12 2011

Publication series

Name	Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
ISSN (Print)	1062-922X

Conference

Conference	2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011
Country/Territory	United States
City	Anchorage, AK
Period	10/9/11 → 10/12/11

Keywords

AGV routing
conflict-free routing
decomposition
multi-objective optimization
Petri Net

ASJC Scopus subject areas

Electrical and Electronic Engineering
Control and Systems Engineering
Human-Computer Interaction

Access to Document

10.1109/ICSMC.2011.6083754

Cite this

Eda, S., Nishi, T., Mariyama, T., Kataoka, S., Shoda, K., & Matsumura, K. (2011). Petri net decomposition approach for bi-objective conflict-free routing for AGV systems. In 2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Conference Digest (pp. 820-825). Article 6083754 (Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics). https://doi.org/10.1109/ICSMC.2011.6083754

Petri net decomposition approach for bi-objective conflict-free routing for AGV systems. / Eda, Shuhei; Nishi, Tatsushi; Mariyama, Toshisada et al.
2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Conference Digest. 2011. p. 820-825 6083754 (Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Eda, S, Nishi, T, Mariyama, T, Kataoka, S, Shoda, K & Matsumura, K 2011, Petri net decomposition approach for bi-objective conflict-free routing for AGV systems. in 2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Conference Digest., 6083754, Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics, pp. 820-825, 2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011, Anchorage, AK, United States, 10/9/11. https://doi.org/10.1109/ICSMC.2011.6083754

Eda S, Nishi T, Mariyama T, Kataoka S, Shoda K, Matsumura K. Petri net decomposition approach for bi-objective conflict-free routing for AGV systems. In 2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Conference Digest. 2011. p. 820-825. 6083754. (Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics). doi: 10.1109/ICSMC.2011.6083754

@inproceedings{77442435d8cd4fa6a3474dc94152649d,

title = "Petri net decomposition approach for bi-objective conflict-free routing for AGV systems",

abstract = "In this paper, we propose a Petri Net decomposition approach for solving the bi-objective conflict-free routing for AGV systems. The objective is to minimize the deviation of delivery time and to minimize the total transportation time. The dispatching and conflict-free routing problem for AGVs is represented as an optimal firing sequence problem for Petri Net. A Petri Net decomposition approach is applied to solve the multi-objective optimization problem efficiently. The convergence of the algorithm is improved by reducing the search region. The effectiveness of the proposed method is compared with that of the conventional method. Computational results show the effectiveness of the proposed method.",

keywords = "AGV routing, conflict-free routing, decomposition, multi-objective optimization, Petri Net",

author = "Shuhei Eda and Tatsushi Nishi and Toshisada Mariyama and Satomi Kataoka and Kazuya Shoda and Katsuhiko Matsumura",

year = "2011",

doi = "10.1109/ICSMC.2011.6083754",

language = "English",

isbn = "9781457706523",

series = "Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics",

pages = "820--825",

booktitle = "2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Conference Digest",

note = "2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 ; Conference date: 09-10-2011 Through 12-10-2011",

}

TY - GEN

T1 - Petri net decomposition approach for bi-objective conflict-free routing for AGV systems

AU - Eda, Shuhei

AU - Nishi, Tatsushi

AU - Mariyama, Toshisada

AU - Kataoka, Satomi

AU - Shoda, Kazuya

AU - Matsumura, Katsuhiko

PY - 2011

Y1 - 2011

N2 - In this paper, we propose a Petri Net decomposition approach for solving the bi-objective conflict-free routing for AGV systems. The objective is to minimize the deviation of delivery time and to minimize the total transportation time. The dispatching and conflict-free routing problem for AGVs is represented as an optimal firing sequence problem for Petri Net. A Petri Net decomposition approach is applied to solve the multi-objective optimization problem efficiently. The convergence of the algorithm is improved by reducing the search region. The effectiveness of the proposed method is compared with that of the conventional method. Computational results show the effectiveness of the proposed method.

AB - In this paper, we propose a Petri Net decomposition approach for solving the bi-objective conflict-free routing for AGV systems. The objective is to minimize the deviation of delivery time and to minimize the total transportation time. The dispatching and conflict-free routing problem for AGVs is represented as an optimal firing sequence problem for Petri Net. A Petri Net decomposition approach is applied to solve the multi-objective optimization problem efficiently. The convergence of the algorithm is improved by reducing the search region. The effectiveness of the proposed method is compared with that of the conventional method. Computational results show the effectiveness of the proposed method.

KW - AGV routing

KW - conflict-free routing

KW - decomposition

KW - multi-objective optimization

KW - Petri Net

UR - http://www.scopus.com/inward/record.url?scp=83755173192&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=83755173192&partnerID=8YFLogxK

U2 - 10.1109/ICSMC.2011.6083754

DO - 10.1109/ICSMC.2011.6083754

M3 - Conference contribution

AN - SCOPUS:83755173192

SN - 9781457706523

T3 - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

SP - 820

EP - 825

BT - 2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011 - Conference Digest

T2 - 2011 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2011

Y2 - 9 October 2011 through 12 October 2011

ER -

Petri net decomposition approach for bi-objective conflict-free routing for AGV systems

Abstract

Publication series

Conference

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this