检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:文孟飞[1] 彭军[1] 刘伟荣[1] 李冲[1] 张晓勇[1]
机构地区:[1]中南大学信息科学与工程学院,湖南长沙410075
出 处:《湖南大学学报(自然科学版)》2013年第5期55-60,共6页Journal of Hunan University:Natural Sciences
基 金:国家自然科学基金资助项目(61071096;61073103;61003233;61202342);高等学校博士学科点专项科研基金资助项目(20100162110012;20110162110042);湖南省科技计划科研基金资助项目(2011GK3214)
摘 要:路径诱导是一种主动引导车辆合理分流来解决城市交通拥堵的方法.本文提出了一种基于增量搜索的多目标优化路径诱导方法.该方法首先利用图论法将复杂路网抽象为点线的赋权图,引入多目标优化变量,建立路网模型;然后在启发式搜索基础上引入增量搜索,结合全局规划和局部动态重规划,实现车辆的实时路径诱导.仿真结果表明该方法能有效地解决复杂路网中车辆的实时路径诱导问题.Route guidance can effectively solve the increasingly crowded urban traffic problem. In this paper, a research on multi-objective path guidance based on increment searching was presented. Firstly, the graph theory method was used to abstract complex road networks to weighted graph that consists of points and lines. Then, a road network model was established by introducing multi-objective optimization variables. Secondly, a heuristic search algorithm based on incremental searching was proposed to achieve vehicle dynamic route guidance. This algorithm combines with the global planning and local dynamic re- planning. Finally, simulation results show that this method can effectively solve the vehicle real-time dy- namic route guidance problem in complex road networks.
分 类 号:U491.123[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28