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

Maeno, Ryota; Nishi, Tatsushi; Konishi, Masami

doi:10.5687/iscie.19.426

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2007

2009

Publication Types

Select...

Article2

Other2

Relationship

Self Cite1

Independent3

Authors

Journals

Cited by 4 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A decomposition model for place/transition nets for AGVs routing problems has already been proposed by Maeno et al (11) . This paper addresses a general decomposition model for Petri Nets to represent a wide variety of production scheduling problems.…”

Section: Introductionmentioning

confidence: 99%

Petri Net Modeling and Decomposition Method for Solving Production Scheduling Problems

Nishi

Maeno

2007

JAMDSM

Self Cite

View full text Add to dashboard Cite

Considering the need to develop general scheduling problem solver, the recent integration of Petri Nets as modeling tools into effective optimization methods for scheduling problems is very promising. The paper addresses a Petri Net modeling and decomposition method for solving a wide variety of scheduling problems. The scheduling problems are represented as the optimal transition firing sequence problems for timed Petri Nets. The Petri Net is decomposed into several subnets in which each subproblem can be easily solved by Dijkstra' algorithm. The approach is applied to a flowshop scheduling problem. The performance of the proposed algorithm is compared with that of a simulated annealing method.

show abstract

Section: Introductionmentioning

confidence: 99%