Decomposition of Petri Nets for optimization of routing problem for AGVs in semiconductor fabrication bays

Tatsushi Nishi; Ryota Maeno

doi:10.1109/COASE.2006.326886

Decomposition of Petri Nets for optimization of routing problem for AGVs in semiconductor fabrication bays

Tatsushi Nishi, Ryota Maeno

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

3 Citations (Scopus)

Abstract

In this paper, we propose a decomposition and optimization method for Petri Nets to solve routing problems for automated guided vehicles in semiconductor fabrication bays. An augmented Petri Net model is developed to represent concurrent motion for multiple AGVs. The routing problem to minimize total transportation time is formulated as an optimal firing sequence problem for the proposed Petri Net. The optimization model 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.

Original language	English
Title of host publication	2006 IEEE International Conference on Automation Science and Engineering, CASE
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	236-241
Number of pages	6
ISBN (Print)	1424403103, 9781424403103
DOIs	https://doi.org/10.1109/COASE.2006.326886
Publication status	Published - 2006
Externally published	Yes
Event	2006 IEEE International Conference on Automation Science and Engineering, CASE - Shanghai, China Duration: Oct 8 2006 → Oct 10 2006

Publication series

Name	2006 IEEE International Conference on Automation Science and Engineering, CASE

Conference

Conference	2006 IEEE International Conference on Automation Science and Engineering, CASE
Country/Territory	China
City	Shanghai
Period	10/8/06 → 10/10/06

ASJC Scopus subject areas

Control and Systems Engineering
Electrical and Electronic Engineering

Access to Document

10.1109/COASE.2006.326886

Cite this

Nishi, T., & Maeno, R. (2006). Decomposition of Petri Nets for optimization of routing problem for AGVs in semiconductor fabrication bays. In 2006 IEEE International Conference on Automation Science and Engineering, CASE (pp. 236-241). [4120352] (2006 IEEE International Conference on Automation Science and Engineering, CASE). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/COASE.2006.326886

Decomposition of Petri Nets for optimization of routing problem for AGVs in semiconductor fabrication bays. / Nishi, Tatsushi; Maeno, Ryota.

2006 IEEE International Conference on Automation Science and Engineering, CASE. Institute of Electrical and Electronics Engineers Inc., 2006. p. 236-241 4120352 (2006 IEEE International Conference on Automation Science and Engineering, CASE).

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

Nishi, T & Maeno, R 2006, Decomposition of Petri Nets for optimization of routing problem for AGVs in semiconductor fabrication bays. in 2006 IEEE International Conference on Automation Science and Engineering, CASE., 4120352, 2006 IEEE International Conference on Automation Science and Engineering, CASE, Institute of Electrical and Electronics Engineers Inc., pp. 236-241, 2006 IEEE International Conference on Automation Science and Engineering, CASE, Shanghai, China, 10/8/06. https://doi.org/10.1109/COASE.2006.326886

Nishi T, Maeno R. Decomposition of Petri Nets for optimization of routing problem for AGVs in semiconductor fabrication bays. In 2006 IEEE International Conference on Automation Science and Engineering, CASE. Institute of Electrical and Electronics Engineers Inc. 2006. p. 236-241. 4120352. (2006 IEEE International Conference on Automation Science and Engineering, CASE). doi: 10.1109/COASE.2006.326886

Nishi, Tatsushi ; Maeno, Ryota. / Decomposition of Petri Nets for optimization of routing problem for AGVs in semiconductor fabrication bays. 2006 IEEE International Conference on Automation Science and Engineering, CASE. Institute of Electrical and Electronics Engineers Inc., 2006. pp. 236-241 (2006 IEEE International Conference on Automation Science and Engineering, CASE).

@inproceedings{38331129b9c5493fa0096ecb7b95d98c,

title = "Decomposition of Petri Nets for optimization of routing problem for AGVs in semiconductor fabrication bays",

abstract = "In this paper, we propose a decomposition and optimization method for Petri Nets to solve routing problems for automated guided vehicles in semiconductor fabrication bays. An augmented Petri Net model is developed to represent concurrent motion for multiple AGVs. The routing problem to minimize total transportation time is formulated as an optimal firing sequence problem for the proposed Petri Net. The optimization model 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.",

author = "Tatsushi Nishi and Ryota Maeno",

year = "2006",

doi = "10.1109/COASE.2006.326886",

language = "English",

isbn = "1424403103",

series = "2006 IEEE International Conference on Automation Science and Engineering, CASE",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "236--241",

booktitle = "2006 IEEE International Conference on Automation Science and Engineering, CASE",

note = "2006 IEEE International Conference on Automation Science and Engineering, CASE ; Conference date: 08-10-2006 Through 10-10-2006",

}

TY - GEN

T1 - Decomposition of Petri Nets for optimization of routing problem for AGVs in semiconductor fabrication bays

AU - Nishi, Tatsushi

AU - Maeno, Ryota

PY - 2006

Y1 - 2006

N2 - In this paper, we propose a decomposition and optimization method for Petri Nets to solve routing problems for automated guided vehicles in semiconductor fabrication bays. An augmented Petri Net model is developed to represent concurrent motion for multiple AGVs. The routing problem to minimize total transportation time is formulated as an optimal firing sequence problem for the proposed Petri Net. The optimization model 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.

AB - In this paper, we propose a decomposition and optimization method for Petri Nets to solve routing problems for automated guided vehicles in semiconductor fabrication bays. An augmented Petri Net model is developed to represent concurrent motion for multiple AGVs. The routing problem to minimize total transportation time is formulated as an optimal firing sequence problem for the proposed Petri Net. The optimization model 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.

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

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

U2 - 10.1109/COASE.2006.326886

DO - 10.1109/COASE.2006.326886

M3 - Conference contribution

AN - SCOPUS:45149109812

SN - 1424403103

SN - 9781424403103

T3 - 2006 IEEE International Conference on Automation Science and Engineering, CASE

SP - 236

EP - 241

BT - 2006 IEEE International Conference on Automation Science and Engineering, CASE

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2006 IEEE International Conference on Automation Science and Engineering, CASE

Y2 - 8 October 2006 through 10 October 2006

ER -

Decomposition of Petri Nets for optimization of routing problem for AGVs in semiconductor fabrication bays

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this