一种基于单亲遗传算法的petri网发射路径求解算法  

An Algorithm for Finding Firing Sequences of Petri Nets Based on Partheno-Genetic Algorithm

作　　者：李勇[1] 曹广益[1] 朱新坚[1] 

机构地区：[1]上海交通大学信息工程学院自动化系,上海200030

出　　处：《系统仿真学报》2005年第1期203-206,共4页Journal of System Simulation

基　　金：国家863项目(2003AA517020)

摘　　要：给出了一种基于单亲遗传算法的petri网发射路径求解算法,提出了裂解和聚合两种新的单亲遗传算法算子。算法通过对染色体中的染色体片段进行裂解和聚合等操作,实现了发射序列的快速求解。仿真结果表明,本算法能够以较大的收敛概率快速地收敛,最终得到多个发射序列。进一步的研究表明,适当的选取样本空间的大小可以使本算法更加快速高效。Based on partheno-genetic algorithm, we developed a new algorithm for finding firing sequences of Petri net. New fusing operator and fragment operator of partheno-genetic algorithm are presented too. By using fusion operator and fragment operator on chromosome segment, firing sequences of Petri net can be found in a very short period of time. Experiment data show that our algorithm converges rapidly in a high probability. Consequently a set of firing sequences of Petri net is found. We can conclude that a suitable number of chromosomes in the selected chromosome complex will make the algorithm more effective when it is used to find firing sequences of Petri nets.

关 键 词：PETRI网 可达树分析 发射序列 单亲遗传算法 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]