检索结果-内蒙古大学图书馆

q value-based dynamic programming with Boltzmann Distribution in Large Scale Road Network

SICE Journal of Control, Measurement, and System Integration 2011年第2期4卷 129-136页

作者： Shanqing Yu Yelei Xu Shingo Mabu Manoj Kanta Mainali Kaoru Shimada Kotaro Hirasawa Graduate School of Information Production and Systems Waseda University

In this paper, a global optimal traffic assignment strategy, i.e., q value-based dynamic programming with Boltzmann Distribution is applied to the Kitakyushu City traffic system. The main idea of the proposed traffic assignment strategy is to calculate the expected traveling time for each origin-destination pair and the probability of selecting the next section, then to generate a considerable number of route candidates for the drivers based on the calculated probability. In the simulation, how to select the temperature parameter and the number of the route candidates is discussed in detail. The comparison between the proposed method and the shortest path algorithms indicates that the proposed method could reduce the risk of the traffic congestion occurrence and save the traveling cost effectively. In addition, the computation time is given to reveal the feasibility of the proposed method in large scale networks.

关键词： q value-based dynamic programming Boltzmann distribution shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-Routes Algorithm using Temperature Control of Boltzmann Distribution in q value-based dynamic programming

Multi-Routes Algorithm using Temperature Control of Boltzman...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Yu, Shanqing Mabu, Shingo Mainali, Manoj Kanta Eto, Shinji Shimada, Kaoru Hirasawa, Kotaro Waseda Univ Grad Sch Informat Prod & Syst Wakamatsu Ku Fukuoka 8080135 Japan

ISBN: (纸本)9781424427932

In this paper, we propose a heuristic method trying to improve the efficiency of traffic systems in the global perspective, where the optimal traveling time for each Origin-Destination (OD)pair is calculated by extended q value-based dynamic programming and the global optimum routes are produced by adjusting the temperature parameter in Boltzmann distribution. The key point is that the temperature parameter for each section is not identical, but constantly changing with the traffic of the section, which enables the diversified routing strategy depending on the latest traffics. In addition, the simulation results show that comparing with the Greedy strategy and constant temperature parameter strategy, the proposed method, Le., temperature parameter control strategy of the q value-based dynamic programming with Boltzmann distribution, could reduce the traffic congestion effectively and minimize the negative impact of the information update interval by adopting suitable temperature parameter control strategy.

关键词： q value-based dynamic programming Boltzmann Distribution Temperature Parameter Greedy Strategy

来源：评论

学校读者我要写书评

暂无评论

Various Temperature Parameter Control Methods in q value-based dynamic programming with Boltzmann Distribution

Various Temperature Parameter Control Methods in Q value-bas...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： Yu, Shanqing Mabu, Shingo Mainali, Manoj Kanta Shimada, Kaoru Hirasawa, Kotaro Waseda Univ Grad Sch Informat Prod & Syst Wakamatsu Ku Fukuoka 8080135 Japan

ISBN: (纸本)9781424465880

In order to alleviate the congestion in modern metropolises with over crowded traffics and improve the efficiency of Intelligent Transportation Systems, three temperature parameter control methods of q value-based dynamic programming with Boltzmann Distribution have been proposed in this paper. T he simulation result shows that each method has its own areas of expertise depending on its features and all of the methods could improve the efficiency of the traffic system comparing with the conventional Greedy Method.

关键词： q value-based dynamic programming Boltzmann Distribution Greedy Method Temperature Parameter

来源：评论

学校读者我要写书评

暂无评论

Routing Algorithm by using Extend q value-based dynamic programming with Boltzmann Distribution

Routing Algorithm by using Extend Q Value-based Dynamic Prog...

引用

SICE Annual Conference

作者： Liang Yu Shanqing Yu Shingo Mabu Kotaro Hirasawa Graduate School of Information Production and Systems Waseda University

ISBN: (纸本)9784907764388

In this paper, a method is proposed which evaluates q value-based dynamic programming with Boltzmann Distribution in static road network. The method could distribute vehicles well on all the possible routes from the origin to destination according to the probability. And in this paper, a new method is proposed to calculate the probability which considers the expected traveling time to the destination more efficiently, where two parameters τ and m are used. The proposed method is evaluated using the Kitakyushu city road network data. The simulation shows that better results could be obtained using appropriate τ and m values.

关键词： q value-based dynamic programming Boltzmann Distribution Vehicle Distribution

来源：评论

学校读者我要写书评

暂无评论

Pruning High-level Network Using Genetic Algorithm for Efficient Hierarchical Route Planning in Road Networks

Pruning High-level Network Using Genetic Algorithm for Effic...

引用

SICE Annual Conference

作者： Manoj Kanta Mainali Shingo Mabu Kotaro Hirasawa Graduate School of Information Production and Systems Waseda University

ISBN: (纸本)9781457707148

This paper proposes a pruning method to improve the computational efficiency of the hierarchical route search using q value-based dynamic programming. In the hierarchical route search, the road network is divided into several subnetworks and the high-level network built with origin, destination and border intersections is used for the route search. In the previous work, it was shown that the hierarchical route search is efficient compared to the non-hierarchical method. To further improve the computational efficiency of the hierarchical route search, an offline pruning method for the high-level network is proposed in which the border intersections are selected using Genetic Algorithm in order to include them in the high-level network. But, pruning the high-level network leads to the loss of accuracy of the routes. Therefore, the border intersections are selected considering the traveling time of the routes and time required to do the route search during the pruning process. The proposed method is evaluated using the Kitakyushu city road network and the simulation results show that the proposed method improves the computational efficiency of the route search with small loss of accuracy on average.

关键词： Route planning Hierarchical route planning Genetic algorithm q value-based dynamic programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：