A decomposition method for optimal firing sequence problems for first-order hybrid Petri nets

Authors:
Tatsushi Nishi;Kenichi Shimatani;Masahiro Inuiguchi
Affiliations:
Mathematical Science for Social Systems, Graduate School of Engineering Science, Osaka University, Toyonaka City, Japan;Mathematical Science for Social Systems, Graduate School of Engineering Science, Osaka University, Toyonaka City, Japan;Mathematical Science for Social Systems, Graduate School of Engineering Science, Osaka University, Toyonaka City, Japan
Venue:
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Year:
2009

Citing 5
Cited 0

On Hybrid Petri Nets

Discrete Event Dynamic Systems
Discrete-Event Simulation of Fluid Stochastic Petri Nets

IEEE Transactions on Software Engineering
Urban traffic control structure based on hybrid Petri nets

IEEE Transactions on Intelligent Transportation Systems
Application of Petri Nets and Lagrangian Relaxation to Scheduling Automatic Material-Handling Vehicles in 300-mm Semiconductor Manufacturing

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Control of systems integrating logic, dynamics, and constraints

Automatica (Journal of IFAC)

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a general decomposition method for transition firing sequence problems for first order hybrid Petri Nets. The optimal transition firing sequence problem for first-order hybrid Petri Nets is formulated as a mixed integer programming problem. We propose a Lagrangian relaxation method for solving optimal transition firing sequence problems. The hybrid Petri Net is decomposed into several subnets in which the optimal firing sequence for each subnet is easily solved. The optimality of solution can be evaluated by duality gap derived by Lagrangian relaxation method. The proposed method is applied to a small-scale example. Computational experiments demonstrate the validity of the proposed formulation.