基于Petri网与改进A*搜索算法的矿井机车调度优化  

Optimization of Mine Locomotive Scheduling Based on Petri Net and Improved A*Search Algorithm

作　　者：闫世昌 李文宏[1] 孙彦良 YAN Shi-chang;LI Wen-hong;SUN Yan-liang(College of Ocean Science and Engineering,Shandong University of Science and Technology,Qingdao 266510,China;Yankuang Group Donghua Heavy Industry,Zoucheng 273500,China)

机构地区：[1]山东科技大学海洋科学与工程学院,青岛266510 [2]兖矿集团,邹城273500

出　　处：《科学技术与工程》2020年第15期5990-5996,共7页Science Technology and Engineering

基　　金：山东省自然科学基金(ZR2014FQ020)。

摘　　要：为了提高煤矿井下机车调度效率、防止机车碰撞、堵塞,根据井下调度特点建立机车运行赋时Petri网模型。针对原有启发式A*搜索算法存在的易陷入局部最优的缺点,提出了基于Petri网的并发变迁遴选算法,引入变迁并发度概念,与启发式A*搜索算法相结合,得到改进的A*搜索算法。经过改进后算法的回溯计算,得到Petri可达图上的最佳路径,从而得出最优调度策略。根据以上算法进行MATLAB建模,最终仿真结果表明,经过改进的启发式A*搜索算法有效地避免了陷入局部最优解,其计算得出的调度路径及调度策略资源消耗量最少,调度效率较高且未出现机车堵塞碰撞等问题。To improve the efficiency of underground locomotive dispatch and prevent locomotive collision and blockage,the time Petri network model of locomotive operation was established in line with the mine scheduling.Aiming at the shortcomings of the original heuristic A*search algorithm,which was easy to be trapped in local optimal,a concurrency transition selection algorithm based on Petri network was proposed.The concept of transition concurrency was introduced and combined with heuristic A*search algorithm,and the improved A*search algorithm was obtained.After retrospective calculation,the best path on the Petri reachable marking graph was acquired,and then the optimal scheduling strategy was achieved.In addition,MATLAB modeling was carried out according to the above algorithm.The final simulation results show that the improved heuristic A*search algorithm could effectively avoid the falling into the local optimal solution.The calculated scheduling strategy resource consumption was the least,the scheduling efficiency was high,and the number of locomotive jam or collision was nil.

关 键 词：井下机车调度 PETRI网模型 A~*搜索算法 并发变迁遴选算法 可达图 

分 类 号：TD524[矿业工程—矿山机电]