线路设计中多方案组合优化算法

Multi-scheme Combinatorial Optimization Algorithm of Route Design

为了使设计者从道路线路设计的繁重计算统计工作中解脱出来,在研究了局部方案间内在关联的基础上,提出了将局部方案分解为更小单位的逻辑方案,用有向网络图表示逻辑方案间的拓扑关系,采用节点-弧段联合数据结构来表示网络图;同时基于最短路径理论,提出了在网络图中智能化搜索综合指标最优的逻辑方案集,自动形成整体方案的组合优化算法。研究结果表明:该组合优化算法是正确的,应用该算法能自动生成整体最优的方案,提高了设计效率和水平。

In order to get out from the coekamamie work in road route design for designers, on the basis of studying the internal relations among local schemes, local scheme was decomposed to small unit logic schemes; the directed network was used to represent the topological connection; the united data structure of point-arc was used to express a network graph. Based on the shortest path theory, the combinatorial optimization algorithm that can search optimal logical schemes of some targets in the network graph intelligently and can form the whole scheme automatically was put forward. The study results show that the algorithm which can produce optimal design scheme automatically and can enhance design efficiency and level is correct.