论文部分内容阅读
对井下机车运输系统进行无死锁调度和性能优化,首先,建立三种不同调度策略下的资源分配Petri网模型,设计对应调度策略下无死锁标识的最大边界设置算法,证明了调度策略在最大标识边界设置下的无死锁性.然后,以最小化时耗和能耗为优化目标,利用遗传算法,采用变迁标号的自然编码方式,通过检查变迁的引发条件检测染色体的可行性,修复不可行的染色体使其对应的调度满足资源约束,从而保证了算法所利用的所有染色体均可对应系统的可行调度,最后进行实例仿真.设计的无死锁调度的最大标识边界设置算法和遗传算法为井下机车的运输调度提供了可靠的理论基础.
First of all, the resource allocation Petri net model under three different scheduling strategies is established, and the maximum boundary setting algorithm without deadlock identification is designed according to the scheduling strategy. It is proved that the scheduling strategy in Maximum deadlock without deadlock under the boundary of the maximum mark.Based on the genetic algorithm, the natural coding method of the transition mark, the feasibility of detecting the chromosome by examining the triggering conditions of the mutation, Infeasible chromosomes make their corresponding scheduling satisfy the resource constraint, so that all the chromosomes utilized by the algorithm can be corresponding to the feasible scheduling of the system.Finally, an example simulation is carried out.The design of the maximum identification boundary without deadlock scheduling and genetic algorithm It provides a reliable theoretical basis for the transportation scheduling of underground locomotives.