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

Tatsushi Nishi; Kenichi Shimatani; Masahiro Inuiguchi

doi:10.1109/ICSMC.2009.5345896

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

Tatsushi Nishi, Kenichi Shimatani, Masahiro Inuiguchi

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

2 Citations (Scopus)

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.

Original language	English
Title of host publication	Proceedings 2009 IEEE International Conference on Systems, Man and Cybernetics, SMC 2009
Pages	2854-2859
Number of pages	6
DOIs	https://doi.org/10.1109/ICSMC.2009.5345896
Publication status	Published - 2009
Externally published	Yes
Event	2009 IEEE International Conference on Systems, Man and Cybernetics, SMC 2009 - San Antonio, TX, United States Duration: Oct 11 2009 → Oct 14 2009

Publication series

Name	Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
ISSN (Print)	1062-922X

Conference

Conference	2009 IEEE International Conference on Systems, Man and Cybernetics, SMC 2009
Country	United States
City	San Antonio, TX
Period	10/11/09 → 10/14/09

Keywords

Decomposition
Firing sequence problem
First-order hybrid petri nets
Lagrangian relaxation
Optimization

ASJC Scopus subject areas

Electrical and Electronic Engineering
Control and Systems Engineering
Human-Computer Interaction

Access to Document

10.1109/ICSMC.2009.5345896

Fingerprint Dive into the research topics of 'A decomposition method for optimal firing sequence problems for first-order hybrid petri nets'. Together they form a unique fingerprint.

Cite this

Nishi, T., Shimatani, K., & Inuiguchi, M. (2009). A decomposition method for optimal firing sequence problems for first-order hybrid petri nets. In Proceedings 2009 IEEE International Conference on Systems, Man and Cybernetics, SMC 2009 (pp. 2854-2859). [5345896] (Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics). https://doi.org/10.1109/ICSMC.2009.5345896

A decomposition method for optimal firing sequence problems for first-order hybrid petri nets. / Nishi, Tatsushi; Shimatani, Kenichi; Inuiguchi, Masahiro.

Proceedings 2009 IEEE International Conference on Systems, Man and Cybernetics, SMC 2009. 2009. p. 2854-2859 5345896 (Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Nishi, T, Shimatani, K & Inuiguchi, M 2009, A decomposition method for optimal firing sequence problems for first-order hybrid petri nets. in Proceedings 2009 IEEE International Conference on Systems, Man and Cybernetics, SMC 2009., 5345896, Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics, pp. 2854-2859, 2009 IEEE International Conference on Systems, Man and Cybernetics, SMC 2009, San Antonio, TX, United States, 10/11/09. https://doi.org/10.1109/ICSMC.2009.5345896

Nishi T, Shimatani K, Inuiguchi M. A decomposition method for optimal firing sequence problems for first-order hybrid petri nets. In Proceedings 2009 IEEE International Conference on Systems, Man and Cybernetics, SMC 2009. 2009. p. 2854-2859. 5345896. (Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics). https://doi.org/10.1109/ICSMC.2009.5345896

@inproceedings{043a34735daf45e0be0f5d51697a1b25,

title = "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.",

keywords = "Decomposition, Firing sequence problem, First-order hybrid petri nets, Lagrangian relaxation, Optimization",

author = "Tatsushi Nishi and Kenichi Shimatani and Masahiro Inuiguchi",

year = "2009",

doi = "10.1109/ICSMC.2009.5345896",

language = "English",

isbn = "9781424427949",

series = "Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics",

pages = "2854--2859",

booktitle = "Proceedings 2009 IEEE International Conference on Systems, Man and Cybernetics, SMC 2009",

note = "2009 IEEE International Conference on Systems, Man and Cybernetics, SMC 2009 ; Conference date: 11-10-2009 Through 14-10-2009",

}

TY - GEN

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

AU - Nishi, Tatsushi

AU - Shimatani, Kenichi

AU - Inuiguchi, Masahiro

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - Decomposition

KW - Firing sequence problem

KW - First-order hybrid petri nets

KW - Lagrangian relaxation

KW - Optimization

UR - http://www.scopus.com/inward/record.url?scp=74849129584&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=74849129584&partnerID=8YFLogxK

U2 - 10.1109/ICSMC.2009.5345896

DO - 10.1109/ICSMC.2009.5345896

M3 - Conference contribution

AN - SCOPUS:74849129584

SN - 9781424427949

T3 - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

SP - 2854

EP - 2859

BT - Proceedings 2009 IEEE International Conference on Systems, Man and Cybernetics, SMC 2009

T2 - 2009 IEEE International Conference on Systems, Man and Cybernetics, SMC 2009

Y2 - 11 October 2009 through 14 October 2009

ER -