双代号网络路径的矩阵查找法

Matrix searching law for line in dual-network

针对双代号网络信息系统中特定的路径查询问题,提出了一种矩阵式快速搜索算法。该算法模拟人脑寻找路径的思维过程,首先针对实际问题建立基于先验知识库的双代号网络工序矩阵、关联矩阵与权数矩阵。在路径搜索过程中,利用知识库中的信息剪去不可能的搜索路径,构造出简化的查询路径,并给出通解,从而大大提高路径的搜索速度。最后,结合实例验证了该算法的实用性和快捷性。

A matrix-style fast search algorithm is posed aiming at solving the problem of the specific path in dual-network information system. This algorithm simulated the thinking process in which path is found by the human brain. Firstly, dual-network operations matrix, code-named matrix and Matrix associated with the weights of the matrix are established. They are all based on prior knowledge and are in connection with practical problems. Then, in the path search process, the impossible search path is cut down by the information in the knowledge bases to simplify the structure of the search criterion and gives general solution. Thus improves the speed of the search path greatly. Finally, verifies the practicality and quickness of the algorithm by examples.