本文關(guān)鍵詞：基于時(shí)間依賴的車輛路徑問題研究　出處：《山東師范大學(xué)》2014年碩士論文　論文類型：學(xué)位論文

  更多相關(guān)文章： 時(shí)間依賴 交通流 路線優(yōu)化

【摘要】：社會(huì)經(jīng)濟(jì)的飛速發(fā)展，帶給交通運(yùn)輸行業(yè)巨大的沖擊力。道路擁堵問題正日漸嚴(yán)重，道路擁堵消耗了大量的機(jī)會(huì)成本。避免道路擁擠的有效措施是設(shè)計(jì)合理的出行路線，道路的擁擠依賴于人們的出行時(shí)間。道路交通流變化清楚地顯示，擁擠出現(xiàn)的時(shí)間和地點(diǎn)。根據(jù)交通流的可預(yù)測(cè)性和規(guī)律性，預(yù)估出現(xiàn)擁擠的區(qū)域和時(shí)間。論文對(duì)時(shí)間依賴性車輛路徑問題（TDVRP）的研究充分利用交通流的這一特點(diǎn)構(gòu)建時(shí)間依賴性交通網(wǎng)絡(luò)，，同時(shí)采用啟發(fā)式算法作為這一問題的主要解決方法。這一研究有助于企業(yè)進(jìn)行高效精準(zhǔn)的運(yùn)輸，提升了企業(yè)的競(jìng)爭(zhēng)力，也對(duì)人們的簡(jiǎn)單快速出行提供了一些幫助。 當(dāng)前對(duì)于時(shí)間依賴性車輛路徑問題的解決主要是將道路上的速度進(jìn)行變化，構(gòu)造一些擁擠區(qū)域，缺乏對(duì)時(shí)間依賴性網(wǎng)絡(luò)的研究，因此對(duì)于時(shí)間依賴性網(wǎng)絡(luò)的研究還存在以下問題： （１）如何構(gòu)造時(shí)間依賴性網(wǎng)絡(luò)，尋找在時(shí)間依賴性網(wǎng)絡(luò)的基礎(chǔ)上解決車輛路徑問題的有效方法。 （２）構(gòu)造時(shí)間依賴性網(wǎng)絡(luò)時(shí)，尋找確定造成網(wǎng)絡(luò)時(shí)間性變化的關(guān)鍵因素。 （３）時(shí)間依賴性車輛路徑問題的解決方法與傳統(tǒng)的車輛路徑問題的解決方法存在哪些區(qū)別。 本文從分析交通流的變化趨勢(shì)開始，分析總結(jié)交通流變化的時(shí)間特點(diǎn)以及交通流變化與速度的關(guān)系。通過(guò)交通流的變化估算道路擁擠的時(shí)間變化，以此理論為基礎(chǔ)對(duì)所要研究的道路網(wǎng)上的每條路線進(jìn)行分析標(biāo)注。逐步構(gòu)建具有時(shí)間特性的道路網(wǎng)絡(luò)。在構(gòu)建時(shí)間依賴性網(wǎng)絡(luò)時(shí)，文中認(rèn)真分析了國(guó)內(nèi)外有關(guān)TDVRP中時(shí)間依賴性網(wǎng)絡(luò)的研究，在此基礎(chǔ)上充分利用交通流的變化趨勢(shì)對(duì)于擁擠的影響，構(gòu)建了具有時(shí)間依賴性、動(dòng)態(tài)的交通網(wǎng)絡(luò)。該網(wǎng)絡(luò)可以根據(jù)目標(biāo)區(qū)域交通流的變化趨勢(shì)做出調(diào)整，使之貼近真實(shí)的路網(wǎng)環(huán)境。 時(shí)間依賴性網(wǎng)絡(luò)是解決時(shí)間依賴性問題的關(guān)鍵，在進(jìn)行路線構(gòu)造時(shí)路線會(huì)隨著網(wǎng)絡(luò)的調(diào)整發(fā)生變化。為提高解決時(shí)間依賴性車輛路徑問題的有效性，在解決的方法上選擇啟發(fā)式算法，該種發(fā)法能夠有效控制可行解的質(zhì)量，快速有效的解決問題。文中對(duì)TDVRP的路線構(gòu)造主要有路線構(gòu)造算法，路線優(yōu)化算法。對(duì)于含有時(shí)間窗的TDVRP路線構(gòu)造增加服務(wù)時(shí)間窗的改善算法。通過(guò)編程實(shí)現(xiàn)對(duì)時(shí)間依賴性網(wǎng)絡(luò)的構(gòu)建，并對(duì)帶有時(shí)間窗的TDVRP和不帶有時(shí)間窗的TDVRP進(jìn)行求解，結(jié)果表明本文提出的方法能夠獲得有效的可行解。 本文通過(guò)深入分析交通變化的時(shí)間特性，以貼近現(xiàn)實(shí)的數(shù)學(xué)模型，精準(zhǔn)簡(jiǎn)便的求解方法，詳細(xì)描述了時(shí)間依賴性車輛路徑問題的求解過(guò)程，為實(shí)現(xiàn)交通運(yùn)輸行業(yè)中的精準(zhǔn)運(yùn)輸，改善城市環(huán)境污染，緩解城市交通壓力提供了參考和借鑒。
[Abstract]:With the rapid development of social economy, the transportation industry has a huge impact. The problem of road congestion is becoming more and more serious. Road congestion consumes a lot of opportunity cost. The effective measure to avoid road congestion is to design a reasonable travel route. Road congestion depends on people's travel time. The change of road traffic flow clearly shows. Time and place of congestion. According to the predictability and regularity of traffic flow. In this paper, the time-dependent vehicle routing problem (TDVRP) is studied to make full use of the characteristics of traffic flow to construct time-dependent traffic network. At the same time, heuristic algorithm is used as the main solution to this problem. This research helps enterprises to carry out efficient and accurate transportation, and improve the competitiveness of enterprises. It also provides some help for people to travel easily and quickly. At present, the main solution to the time-dependent vehicle routing problem is to change the speed on the road, construct some crowded areas, and lack the research on time-dependent network. Therefore, the study of time-dependent networks also has the following problems: 1) how to construct the time-dependent network and find an effective method to solve the vehicle routing problem based on the time-dependent network. 2) in constructing time dependent networks, the key factors to determine the temporal changes of networks are sought. 3) what are the differences between the time-dependent vehicle routing problem and the traditional vehicle routing problem. This paper begins with the analysis of the changing trend of traffic flow, analyzes and summarizes the time characteristics of traffic flow change and the relationship between traffic flow change and speed, and estimates the time change of road congestion through the change of traffic flow. On the basis of this theory, each route of the road network to be studied is analyzed and annotated. The road network with time characteristics is constructed step by step, and the time-dependent network is constructed. In this paper, the domestic and foreign research on time-dependent network in TDVRP is carefully analyzed, and on this basis, the influence of traffic flow trend on congestion is fully utilized, and a time-dependent network is constructed. Dynamic traffic network, which can be adjusted according to the changing trend of traffic flow in the target area, so as to make it close to the real road network environment. Time-dependent network is the key to solve the time-dependent problem. In order to improve the effectiveness of the time-dependent vehicle routing problem, the route will change with the adjustment of the network. The heuristic algorithm is chosen to solve the problem, which can effectively control the quality of feasible solution and solve the problem quickly and effectively. In this paper, the main route construction algorithm for TDVRP is route construction. Route optimization algorithm. The improved algorithm of adding service time window to TDVRP route construction with time window. The construction of time-dependent network is realized by programming. The TDVRP with time window and TDVRP without time window are solved. The results show that the proposed method can obtain effective and feasible solutions. Through in-depth analysis of the time characteristics of traffic changes, in order to close to the reality of the mathematical model, accurate and simple method to solve the time-dependent vehicle routing problem is described in detail. It provides reference and reference for realizing accurate transportation in transportation industry, improving urban environmental pollution and relieving urban traffic pressure.
【學(xué)位授予單位】：山東師范大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2014
【分類號(hào)】：U492.22

【參考文獻(xiàn)】

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

1 干宏程;汪晴;范炳全;;基于宏觀交通流模型的行程時(shí)間預(yù)測(cè)[J];上海理工大學(xué)學(xué)報(bào);2008年05期

2 譚國(guó)真,李程旭,劉浩,伍建q;交通網(wǎng)格的研究與應(yīng)用[J];計(jì)算機(jī)研究與發(fā)展;2004年12期

3 陳永恒;葛興;王殿海;;城市干線典型路段速度-流量特性分析[J];吉林大學(xué)學(xué)報(bào)(工學(xué)版);2006年04期

4 譚國(guó)真;孫景昊;肖宏業(yè);呂凱;;時(shí)間依賴無(wú)向中國(guó)郵路問題的分支限界算法[J];計(jì)算機(jī)科學(xué);2011年02期

5 譚國(guó)真,高文;時(shí)間依賴的網(wǎng)絡(luò)中最小時(shí)間路徑算法[J];計(jì)算機(jī)學(xué)報(bào);2002年02期

6 譚國(guó)真,柳亞玲,高文;隨機(jī)時(shí)間依賴網(wǎng)絡(luò)的K期望最短路徑[J];計(jì)算機(jī)學(xué)報(bào);2003年03期

7 孫立光;李瑞敏;董\~;陸化普;;短時(shí)交通流組合預(yù)測(cè)模型研究[J];武漢理工大學(xué)學(xué)報(bào)(交通科學(xué)與工程版);2010年05期

8 王旭;葛顯龍;代應(yīng);;基于兩階段求解算法的動(dòng)態(tài)車輛調(diào)度問題研究[J];控制與決策;2012年02期

9 劉旺盛;楊帆;李茂青;陳培芝;;需求可拆分車輛路徑問題的聚類求解算法[J];控制與決策;2012年04期

10 張弘_";閭國(guó)年;溫永寧;;基于TRANSIMS的順序出發(fā)時(shí)間與路徑選擇模型研究[J];南京師大學(xué)報(bào)(自然科學(xué)版);2011年03期

相關(guān)博士學(xué)位論文 前1條

1 雷洪濤;隨機(jī)與動(dòng)態(tài)物流網(wǎng)絡(luò)優(yōu)化問題研究[D];國(guó)防科學(xué)技術(shù)大學(xué);2011年

本文編號(hào)：1417749