【摘要】：采用分布式交通仿真系統(tǒng)來對(duì)現(xiàn)實(shí)交通情況進(jìn)行模擬,是提高城市交通效率和機(jī)動(dòng)性的有利途徑。而分布式仿真系統(tǒng)中,任務(wù)是否均衡分配關(guān)系到整個(gè)仿真系統(tǒng)的仿真速度。因此,如何使分布式交通仿真節(jié)點(diǎn)的負(fù)載均衡成了亟待解決的問題。本文以分布式交通仿真平臺(tái)為基礎(chǔ),借鑒博弈論的思想,提出了基于博弈論的動(dòng)態(tài)負(fù)載均衡算法,并通過仿真實(shí)驗(yàn)和理論分析來驗(yàn)證了算法的優(yōu)越性。本文的主要工作包括以下幾點(diǎn):(1)提出了基于分布式交通仿真的網(wǎng)絡(luò)模型。首先,在自主研發(fā)的分布式微觀交通網(wǎng)絡(luò)仿真平臺(tái)的基礎(chǔ)之上,設(shè)計(jì)了混合模式的動(dòng)態(tài)負(fù)載均衡模型。該模型采用CS和P2P的結(jié)合來完成,總控端與仿真終端間以CS的模式存在,而仿真終端和仿真終端之間以P2P的模式存在。同時(shí)為了提高仿真系統(tǒng)的仿真速度、降低數(shù)據(jù)采集成本,本文將路網(wǎng)中道路簡(jiǎn)化為帶權(quán)重的點(diǎn),而路口簡(jiǎn)化為帶權(quán)重的邊。采用該模型對(duì)路網(wǎng)進(jìn)行仿真,能夠在不失仿真的真實(shí)性的同時(shí),簡(jiǎn)化仿真路網(wǎng)模型,提高仿真系統(tǒng)的仿真速度和仿真效率。(2)提出了基于博弈論的動(dòng)態(tài)負(fù)載均衡算法。本文借鑒博弈論中納什均衡的思想,將道路的遷移變?yōu)橹鲃?dòng)行為。算法首先對(duì)道路的效用函數(shù)進(jìn)行定義,并通過理論推導(dǎo)證明該函數(shù)存在納什均衡;然后,采用迭代生長(zhǎng)的方式來對(duì)地圖網(wǎng)絡(luò)進(jìn)行初始分割;最后,道路將根據(jù)效用函數(shù)計(jì)算自身的費(fèi)用,并根據(jù)自身的費(fèi)用來決定是否進(jìn)行遷移以及遷移的目的終端,直到完成整個(gè)路網(wǎng)的均衡;并且在仿真系統(tǒng)運(yùn)行中再次出現(xiàn)不均衡狀況時(shí),同樣也可以依據(jù)道路的費(fèi)用來對(duì)道路進(jìn)行遷移,并再次達(dá)到均衡狀態(tài)。(3)進(jìn)行了仿真對(duì)比實(shí)驗(yàn)。本文采用自主研發(fā)的微觀交通仿真系統(tǒng)為實(shí)驗(yàn)平臺(tái),通過設(shè)定實(shí)驗(yàn)參數(shù)等,與經(jīng)典的遞歸對(duì)分算法進(jìn)行了兩大組對(duì)比實(shí)驗(yàn)。實(shí)驗(yàn)的主要內(nèi)容包括:終端數(shù)變化及車輛數(shù)變化對(duì)仿真時(shí)間、仿真時(shí)間方差、通信時(shí)間總和及通信時(shí)間方差的影響。實(shí)驗(yàn)結(jié)果證明,本文提出的基于博弈論的動(dòng)態(tài)負(fù)載均衡算法的優(yōu)越性。通過理論及對(duì)比仿真實(shí)驗(yàn)的結(jié)果驗(yàn)證,本文提出的基于博弈論的動(dòng)態(tài)負(fù)載均衡算法能夠均衡的劃分路網(wǎng),并且能夠解決大規(guī)模分布式交通仿真系統(tǒng)的動(dòng)態(tài)負(fù)載均衡問題。
[Abstract]:Using distributed traffic simulation system to simulate the real traffic situation is a good way to improve urban traffic efficiency and mobility. In the distributed simulation system, whether the task is balanced or not is related to the simulation speed of the whole simulation system. Therefore, how to balance the load of distributed traffic simulation nodes becomes an urgent problem. Based on the distributed traffic simulation platform and using the idea of game theory for reference, a dynamic load balancing algorithm based on game theory is proposed in this paper, and the superiority of the algorithm is verified by simulation experiments and theoretical analysis. The main work of this paper is as follows: (1) A network model based on distributed traffic simulation is proposed. Firstly, based on the distributed micro traffic network simulation platform, a hybrid dynamic load balancing model is designed. The model is implemented by the combination of CS and P2P. The CS mode exists between the master control terminal and the simulation terminal, while the P2P mode exists between the simulation terminal and the simulation terminal. At the same time, in order to improve the simulation speed and reduce the cost of data acquisition, the road in the road network is simplified as the point with weight, and the intersection is simplified as the edge with weight. Using this model to simulate the road network can simplify the simulation road network model and improve the simulation speed and efficiency without losing the reality of simulation. (2) A dynamic load balancing algorithm based on game theory is proposed. This paper draws lessons from Nash equilibrium in game theory and turns road transfer into active behavior. Firstly, the utility function of the road is defined, and the Nash equilibrium is proved by theoretical derivation. Then, the map network is initially segmented by iterative growth. The road will calculate its own cost according to the utility function and decide whether to carry out the migration and whether to migrate the destination terminal according to its own cost until the balance of the whole road network is completed; and when the simulation system runs again when the imbalance occurs again. It is also possible to transfer the road according to the cost of the road and reach the equilibrium state again. (3) A comparative simulation experiment is carried out. In this paper, the micro traffic simulation system developed by ourselves is used as the experimental platform. By setting the experimental parameters and so on, two groups of comparative experiments are carried out with the classical recursive algorithm. The main contents of the experiment are as follows: the influence of terminal number change and vehicle number change on simulation time, simulation time variance, communication time sum and communication time variance. The experimental results show the superiority of the proposed dynamic load balancing algorithm based on game theory. The results of theoretical and simulation experiments show that the proposed dynamic load balancing algorithm based on game theory can evenly divide the road network and solve the dynamic load balancing problem of large-scale distributed traffic simulation system.
【學(xué)位授予單位】：電子科技大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類號(hào)】：U491;TP391.9

【共引文獻(xiàn)】

相關(guān)期刊論文 前10條

1 胡紅;劉小明;楊孝寬;;基于最小安全間距的應(yīng)急交通疏散車輛跟馳模型[J];北京工業(yè)大學(xué)學(xué)報(bào);2007年10期

2 許有俊;郭楠;;城市快速路出口輔路附加車道長(zhǎng)度的仿真研究[J];北京工業(yè)大學(xué)學(xué)報(bào);2009年11期

3 許有俊;張s，

本文編號(hào)：2214517