检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]清华大学自动化系系统工程研究所,北京100084 [2]清华大学深圳研究生院,广东深圳518055 [3]北方工业大学交通信息与控制工程系城市道路交通智能控制技术北京市重点实验室,北京100144
出 处:《交通运输系统工程与信息》2015年第4期118-122,128,共6页Journal of Transportation Systems Engineering and Information Technology
基 金:国家科技支撑计划(2013BAG18B00)
摘 要:交警在进行交通巡逻时,需要提前确定最优的交通巡逻路线.较为优化的交通巡逻路线应该具有覆盖所有路段、巡逻路径短和巡逻时间少等一些特点.本文提出了一种交警巡逻路线的计算方法,求得的交警巡逻路线既能覆盖所有路段,又能使交通巡逻花费的时间最短.交警在巡逻的过程中,所使用的总时间既与路线长短有关,又受到交通信号灯的影响,本文综合考虑了这两种情况,建立了考虑交通信号灯影响的交通警力巡逻模型,并采用两阶段求解法,对模型进行求解.通过仿真计算,给出多种路网形态下的交警巡逻路线,并且将所得结果与Stochastic算法、Clossey算法进行比较.通过对比分析得出,本文模型求得的交警巡逻路线总用时较少.When the traffic police doing the traffic patrol, they need to determine the optimal routes in advance. An optimal route should cover all the roads, have the shortest route and spend the least time. A method is given to calculate the traffic patrol routes. The routes not only can cover all the roads but also spend the least time. The time that the traffic police spend is affected by the length of the routes and the traffic lights. This paper considers the both and establishes the model of traffic police patrol. Using the two- stage method, the model is solved. By simulation calculation, this paper gives the police patrol routes on specific road network. And the results are compared with other two methods. Through the analysis of the results, it finds out that this paper proposed method is better others.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.140.195.190