首页 | 本学科首页   官方微博 | 高级检索  
     检索      

基于可变网元的离散路网设计模型与算法
引用本文:邵敏华,孙立军.基于可变网元的离散路网设计模型与算法[J].同济大学学报(自然科学版),2008,36(10).
作者姓名:邵敏华  孙立军
作者单位:同济大学,道路与交通工程教育部重点实验室,上海,200092
基金项目:国家科技支撑计划,中国博士后科学基金 
摘    要:对离散路网设计问题中新增道路带来原有路网单元结构与属性变化的影响进行分析,指出考虑这一影响后,Braess诡异出现的可能性大大增加.进而建立了基于可变网元的离散路网设计模型,采用路网生成算子来表征道路增减带来的路网单元结构的变化,设计了路网生成算子的算法流程.最后给出了求解离散路网设计模型的模拟退火遗传算法,并给出了算法实例.

关 键 词:离散路网设计问题  可变网元  Braess诡异  路网生成算子  模拟退火遗传算法

Transformable Network Units-Based Model of Discrete Network Design Problem and Its Algorithm
SHAO Minhua,SUN Lijun.Transformable Network Units-Based Model of Discrete Network Design Problem and Its Algorithm[J].Journal of Tongji University(Natural Science),2008,36(10).
Authors:SHAO Minhua  SUN Lijun
Abstract:The impact of adding a road into the network is discussed.The result shows that,for urban road network,the new road will change the topological structure of its intersectant road units and their performance parameters accordingly.With this effect considered,the probability of Braess' paradox occurring is higher than the previous estimation.So,a model of the discrete network design problem(DNDP)based on the transformable network units is built by introducing the network generation arithmetic operator(NGAO)into the traditional model.The NGAO can regenerate the whole road network to reflect the effect of adding or subtracting roads.The algorithm of NGAO is given.Finally,the simulated annealing genetic approach(SAGA)is designed to solve the proposed model of transformable network units based DNDP,and an example is followed.
Keywords:discrete network design problem  transformable network units  Braess' paradox  network generation arithmetic operator  simulated annealing genetic approach
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号