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 proceedingConference 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 languageEnglish
Title of host publication2006 IEEE International Conference on Automation Science and Engineering, CASE
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages236-241
Number of pages6
ISBN (Print)1424403103, 9781424403103
DOIs
Publication statusPublished - 2006
Externally publishedYes
Event2006 IEEE International Conference on Automation Science and Engineering, CASE - Shanghai, China
Duration: Oct 8 2006Oct 10 2006

Publication series

Name2006 IEEE International Conference on Automation Science and Engineering, CASE

Conference

Conference2006 IEEE International Conference on Automation Science and Engineering, CASE
CountryChina
CityShanghai
Period10/8/0610/10/06

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Decomposition of Petri Nets for optimization of routing problem for AGVs in semiconductor fabrication bays'. Together they form a unique fingerprint.

Cite this