An improved heuristic algorithm FEIDEQ for the maximum legal firing sequence problem of Petri nets

Author

Shimada, Satoru ; Taoka, Satoshi ; Yamauchi, Masahiro ; Watanabe, Toshimasa

Author_Institution

Graduate Sch. of Eng., Hiroshima Univ., Higashi-Hiroshima

fYear

2006

fDate

21-24 May 2006

Abstract

The paper proposes a heuristic algorithm FEIDEQ for the maximum legal firing sequence problem of Petri nets (MAX LFS for short) and evaluates it based on experimental results. FEIDEQ is improved from FSDC that has been known to have the highest capability among the existing ones, by incorporating a new selection rule of transitions. In our experimental evaluation, FEIDEQ is applied to 2540 test problems, and, for each of 2040 of them, existence of an optimum solution is guaranteed. Among these 2040 test problems, FEIDEQ has produced an optimum solution to each of 1864 (91.3%) test problems, showing about 2.57 times that of FSDC, the best one so far. Furthermore, by adopting improved backtracking, average CPU time is about 0.86 times that of FSDC for general nets

Keywords

Petri nets; backtracking; heuristic programming; FEIDEQ; MAX LFS; Petri nets; backtracking; heuristic algorithm; maximum legal firing sequence problem; transition selection rule; Graph theory; Heuristic algorithms; Law; Legal factors; Petri nets; Polynomials; Resource management; Scheduling algorithm; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 2006. ISCAS 2006. Proceedings. 2006 IEEE International Symposium on

Conference_Location

Island of Kos

Print_ISBN

0-7803-9389-9

Type

conf

DOI

10.1109/ISCAS.2006.1693625

Filename

1693625