Title :
Decomposition of Petri Nets for Optimization of Routing Problem for AGVs in Semiconductor Fabrication Bays
Author :
Nishi, Tatsushi ; Maeno, Ryota
Author_Institution :
Graduate Sch. of Eng. Sci., Osaka Univ.
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
Keywords :
Petri nets; automatic guided vehicles; optimisation; semiconductor device manufacture; transportation; Petri nets; concurrent motion; multiple AGV; optimal firing sequence problem; routing problem; semiconductor fabrication bays; Discrete event systems; Fabrication; Law; Legal factors; Optimization methods; Petri nets; Routing; Transportation; Turning; Vehicles;
Conference_Titel :
Automation Science and Engineering, 2006. CASE '06. IEEE International Conference on
Conference_Location :
Shanghai
Print_ISBN :
1-4244-0310-3
Electronic_ISBN :
1-4244-0311-1
DOI :
10.1109/COASE.2006.326886
