摘要
路径寻优问题是交通网络优化中的基本问题.由于现实交通网络中的交叉口存在不同程度的转向延误,使得一般的最短路模型与算法并不适合城市交通路网,针对这类问题,设计带交叉口转向延误的交通网络路径寻优模型,并根据模型解的特征,将路径寻优模型转化为只含有0,1变量约束的非线性规划问题,随后采用基于增广Lagrangian法的遗传算法来求解该模型.仿真结果表明该模型和算法是有效的.
Optimal path searching is the basic network optimization problem. It is widely applied in urban transportation network planning and management. But the usual shortest model and algorithm isn ’t suitable for urban transportation network because of the intersection delay. To solve the problems,a model with intersection delay is proposed,and the model is transformed into a 0-1 nonlinear programming with augmented Lagrangian function according to the characteristics of model solution. Then the model is solved by genetic algorithm（GA）with augmented Lagrangian method. The simulation result demonstrates that this model and algorithm are efficient.
出处
《河南科学》
2015年第9期1500-1503,共4页
Henan Science
基金
国家自然科学基金资助项目(61402335)
陕西省自然科学基础研究计划项目(2014JM2-1004)
渭南师范学院科研基金项目(15ZRRC04)
陕西省(数学)扶持学科建设项目和渭南师范学院特色学科建设项目(14TSXK02)
