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

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.