本文選題：限行 + 雙層規(guī)劃��； 參考：《中南大學(xué)》2012年碩士論文

【摘要】：隨著社會(huì)發(fā)展和人民生活水平的提高,現(xiàn)階段城市高峰期交通擁擠問題日益嚴(yán)重。交通擁擠不僅給居民出行帶來困擾,給交通管理帶來困難,給環(huán)境帶來污染,而且降低了整個(gè)社會(huì)福利,使得資源在無形之中被消耗。為了解決城市交通需求劇增或交通網(wǎng)絡(luò)能力嚴(yán)重下降問題,交通限行方案輪流限制一定比例的小汽車進(jìn)入指定限行區(qū)域,迫使部分被限行的小汽車出行者轉(zhuǎn)向公共交通,這是城市交通管理的一種有效手段。限行方案優(yōu)化問題是交通管理者與交通出行者之間的Stackelberg博弈,本文采用雙層規(guī)劃模型描述限行方案優(yōu)化問題,上層規(guī)劃以限行方案為優(yōu)化決策,在最小化超限流量的基礎(chǔ)上,最大化消費(fèi)者剩余；下層規(guī)劃基于當(dāng)前限行方案確定彈性需求、方式選擇、多類用戶均衡配流。設(shè)計(jì)了求解雙層規(guī)劃模型的可變長編碼遺傳算法,動(dòng)態(tài)地將求解過程中超過能力限制的路段都列入搜索范圍,并設(shè)計(jì)了梯度投影子算法求解下層規(guī)劃。對(duì)于求解雙層規(guī)劃獲得的限行方案,通過成片處理和繞道程度判斷,最終獲得實(shí)用化限行方案。本文的算例分析表明：優(yōu)化方法對(duì)限行方案的制定提供了有效手段理論支撐。
[Abstract]:With the development of society and the improvement of people's living standard, the problem of urban rush hour traffic congestion is becoming more and more serious. Traffic congestion not only brings troubles to residents' travel, brings difficulties to traffic management, pollutes the environment, but also reduces the whole social welfare and resources are consumed in the invisible way. In order to solve the problem of sharp increase in urban traffic demand or serious decline in traffic network capacity, traffic restriction schemes take turns to restrict a certain proportion of cars entering designated restricted areas, forcing some restricted car travelers to turn to public transport. This is an effective means of urban traffic management. The optimization problem of the limit scheme is a Stackelberg game between the traffic manager and the traffic traveler. In this paper, a bilevel programming model is used to describe the optimization problem of the limit scheme. The upper level programming takes the limit scheme as the optimal decision and minimizes the excess flow. The lower level programming is based on the current limit scheme to determine the elastic demand, the way to choose, and the multi-class users to balance the allocation of flow. A variable length coding genetic algorithm for solving bilevel programming model is designed, which dynamically includes all sections beyond the capacity limit in the search range, and a gradient projection subalgorithm is designed to solve the lower level programming. Finally, the practical limit scheme is obtained by slice processing and judging the degree of bypass for the line limiting scheme obtained by solving the bilevel programming. The analysis of the example shows that the optimization method provides an effective means theory support for the establishment of the limit scheme.
【學(xué)位授予單位】：中南大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2012
【分類號(hào)】：F572;F224

【參考文獻(xiàn)】

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

1 孫德鋒;廣義非線性互補(bǔ)問題的投影收縮法[J];計(jì)算數(shù)學(xué);1994年02期

2 陳義華;吳國強(qiáng);朱玉琴;;多模式擁擠交通網(wǎng)絡(luò)中的路徑分配與收費(fèi)定價(jià)模型[J];交通與計(jì)算機(jī);2007年06期

3 方建安,邵世煌;采用遺傳算法學(xué)習(xí)的神經(jīng)網(wǎng)絡(luò)控制器[J];控制與決策;1993年03期

4 周晶,盛昭瀚,何建敏;彈性需求下公交網(wǎng)絡(luò)系統(tǒng)票價(jià)結(jié)構(gòu)的優(yōu)化[J];自動(dòng)化學(xué)報(bào);2001年05期

5 李相勇,蔣葛夫;城市道路服務(wù)水平的模糊綜合評(píng)判[J];交通運(yùn)輸系統(tǒng)工程與信息;2002年03期

6 王健,安實(shí),徐亞國;道路擁擠定價(jià)下的公交收費(fèi)模型研究[J];中國公路學(xué)報(bào);2005年04期

7 黃海軍;擁擠道路使用收費(fèi)的研究進(jìn)展和實(shí)踐難題[J];中國科學(xué)基金;2003年04期

，

本文編號(hào)：1814864