基于约束的线路设计方案重组算法

为了使设计者从道路线路设计的繁重计算统计工作中摆脱出来,应用组合数学理论分析了可能的重组方案数目,研究了局部方案间的逻辑关系和进行多方案重组的约束条件,提出用图的数据结构表示各局部方案间的关联,对指定的局部方案集合在图中按有向路径搜索原则确定局部方案的先后次序,并且从局部方案中获取数据,自动形成重组方案的算法。结果表明:该方案重组算法是正确的;应用该算法可以提高设计效率和水平。

Scheme Recombination Algorithm of Constraint-based Route Design

In order to get out from the cockamamie work in road route design for designers,authors analyzed the possible number of recombination schemes using combinatorics,and studied the logic relations among local schemes and the constraint condition on scheme recombination.Authors used the graph data structure to represent the relations among these local schemes and the recombination algorithm which could determine the order of the selected local schemes according to the directed route search principle and could get data from the local schemes to form recombination scheme.The results show that the algorithm which can be used to enhance design efficiency and level is correct.