连续网络设计问题的遗传算法

Genetic Algorithm for Continuous Network Design Problem

网络设计问题来源于道路网络的规划,网络设计问题的算法研究对于交通规划的工程实践具有重要的实际意义.本文概述了网络设计问题,指出了网络设计问题数学模型算法研究的复杂性和重要意义.以连续网络设计问题为主要研究对象,分析了连续网络设计问题双层规划数学模型的结构特点.以现代遗传算法为基础,设计了适于解决连续网络设计问题的计算方法.以一个具体的连续网络设计问题为例,证实该算法不仅具有很好的收敛性而且算法所求得的最优解也是可靠的.本文的思想方法亦可运用于其它类型的网络设计问题.

Network Design Problems have arisen from the planning of road network and study on Algorithm for Network Design Problem is of great practical importance for the engineering practice of transportation planning. The Paper has summarized Network Design Problems and has pointed out the complexity and importance of the study on algorithm for network design problems. With continuous network design problems as the main study subject, it analyzes the structural characteristics of mathematical model of the bilevel programming for Continuous Network Design Problems. Based upon modem genetic algorithm, a new algorithm has been designed particularly for the solution of Continuous Network Design Problems. With a concrete Continuous Network Design Problems as an example, it has been testified that not only the algorithm has very good characteristics of convergence but that the best solution of the algorithm is credible. Idea and approach of the paper can also be applied to other types of continuous network design problems.