Drawing Network Planning Graph(PG) of Activity-on-Arrow Network Based on Particle Swarm Optimization 基于粒子群优化算法的双代号网络进度计划图的绘制
Most Artificial Intelligent Planning algorithms are based on planning graph or state space search. 基于规划图(PG)原理和启发式状态空间搜索的智能规划算法在众多的智能规划算法中表现十分突出。
An algorithm is presented for seeking the critical paths in the overall planning graph, which has polynomial complexity O ( n 3 ). The theory, which the algorithm depends on, is verified in detail. 给出了1个求统筹图中关键路线的多项式算法,证明了该算法的理论依据,分析了它的复杂性为O(n3)。
An algorithm for seeking the critical paths in the overall planning graph 统筹图中求关键路线的一个算法
Finally we propose a rough planning algorithm based on planning graph, include the algorithm of expanding rough planning graph and the algorithm of searching the rough planning graph. 在一系列概念的基础上给出了粗规划问题的两种求解模型,并提出基于规划图(PG)的粗规划算法,包括粗规划图(PG)的扩张算法和对粗规划图(PG)的搜索算法。