本文關(guān)鍵詞：公共自行車(chē)調(diào)度路徑優(yōu)化問(wèn)題研究　出處：《西南交通大學(xué)》2015年碩士論文　論文類(lèi)型：學(xué)位論文

  更多相關(guān)文章： 公共自行車(chē) 調(diào)度路徑優(yōu)化 旅行商問(wèn)題 遺傳算法

【摘要】：當(dāng)前,公共自行車(chē)租賃系統(tǒng)作為一種新興的公共交通系統(tǒng)在世界范圍內(nèi)蓬勃發(fā)展,公共自行車(chē)不僅可以在中短距離出行發(fā)揮其靈活、高效的優(yōu)勢(shì),還可以有效延伸公共交通的服務(wù)范圍。但在實(shí)際運(yùn)營(yíng)中,“租車(chē)難”“還車(chē)難”問(wèn)題嚴(yán)重制約公共自行車(chē)作用的發(fā)揮并影響公共自行車(chē)系統(tǒng)的推廣發(fā)展�！白廛�(chē)難”“還車(chē)難”問(wèn)題的出現(xiàn)與城市功能布局、租賃點(diǎn)分布和規(guī)模、居民出行規(guī)律等因素有關(guān),而高效的車(chē)輛調(diào)度有助于這一問(wèn)題的解決。車(chē)輛調(diào)度主要解決多個(gè)租賃點(diǎn)和調(diào)度中心間公共自行車(chē)的存量問(wèn)題,其包含租賃點(diǎn)調(diào)度需求預(yù)測(cè)和調(diào)度路徑優(yōu)化問(wèn)題兩部分；本文重點(diǎn)研究的是調(diào)度中的路徑優(yōu)化問(wèn)題,需要重點(diǎn)考慮到調(diào)度時(shí)間約束、調(diào)度中心個(gè)數(shù)、調(diào)度需求變化等因素。本文將公共自行車(chē)調(diào)度路徑優(yōu)化問(wèn)題歸為多路旅行商問(wèn)題,對(duì)公共自行車(chē)調(diào)度路徑優(yōu)化問(wèn)題進(jìn)行分類(lèi)研究以適應(yīng)于不同的調(diào)度環(huán)境,具體的研究工作包括以下幾個(gè)方面：(1)根據(jù)車(chē)輛路徑問(wèn)題的分類(lèi)標(biāo)準(zhǔn)并結(jié)合公共自行車(chē)調(diào)度路徑優(yōu)化問(wèn)題的特性,分別對(duì)4類(lèi)問(wèn)題進(jìn)行研究。其中第1類(lèi)問(wèn)題是單個(gè)調(diào)度中心無(wú)時(shí)間窗的公共自行車(chē)調(diào)度路徑優(yōu)化問(wèn)題,本文在考慮車(chē)輛容量約束和行駛距離約束的前提下建立了以調(diào)度路徑最短為目標(biāo)的優(yōu)化模型,實(shí)現(xiàn)了非對(duì)稱(chēng)網(wǎng)絡(luò)的調(diào)度路徑的求解。根據(jù)問(wèn)題的分類(lèi),單調(diào)度中心無(wú)時(shí)間窗調(diào)度模型是研究其他幾類(lèi)問(wèn)題的基礎(chǔ)。(2)第2類(lèi)問(wèn)題研究的是單個(gè)調(diào)度中心軟時(shí)間窗的調(diào)度路徑優(yōu)化問(wèn)題,文中用時(shí)間窗約束來(lái)衡量調(diào)度服務(wù)的及時(shí)性以提高客戶(hù)滿意度,違反時(shí)間窗約束則需要接受一定的懲罰并建立懲罰函數(shù),并通過(guò)時(shí)間的迭代關(guān)系表述車(chē)輛到達(dá)各個(gè)租賃點(diǎn)的時(shí)間,從而構(gòu)造了調(diào)度路徑最短、客戶(hù)滿意度最高的多目標(biāo)調(diào)度路徑優(yōu)化模型。(3)第3類(lèi)問(wèn)題研究的是多個(gè)調(diào)度中心軟時(shí)間窗調(diào)度路徑優(yōu)化問(wèn)題,在模型的建立上,削弱了問(wèn)題的假設(shè)條件,本文的研究不要求調(diào)度車(chē)輛返回原來(lái)的調(diào)度中心,實(shí)現(xiàn)了問(wèn)題在調(diào)度車(chē)輛數(shù)和調(diào)度路徑長(zhǎng)度兩方面的進(jìn)一步優(yōu)化。(4)進(jìn)一步削弱假設(shè)條件,對(duì)需求動(dòng)態(tài)變化的調(diào)度路徑優(yōu)化問(wèn)題進(jìn)行研究,通過(guò)設(shè)立時(shí)間軸和關(guān)鍵點(diǎn),將動(dòng)態(tài)需求問(wèn)題轉(zhuǎn)化成靜態(tài)問(wèn)題,建立了動(dòng)態(tài)需求下的公共自行車(chē)調(diào)度路徑優(yōu)化模型。文中研究的4類(lèi)問(wèn)題,通過(guò)對(duì)約束條件做適當(dāng)?shù)乃沙诨蚋郊硬煌匦?不斷逼近實(shí)際調(diào)度問(wèn)題,構(gòu)建了公共自行車(chē)調(diào)度路徑優(yōu)化問(wèn)題的體系,能夠滿足不同調(diào)度環(huán)境下問(wèn)題的要求。(5)通過(guò)改進(jìn)遺傳算法對(duì)問(wèn)題進(jìn)行求解,用Matlab軟件編寫(xiě)程序,以濰坊市奎文區(qū)22個(gè)公共自行車(chē)租賃點(diǎn)為調(diào)度實(shí)例,針對(duì)上述4類(lèi)模型分別進(jìn)行計(jì)算,通過(guò)對(duì)計(jì)算結(jié)果的分析,驗(yàn)證了算法的有效性。
[Abstract]:At present, the public bicycle rental system as a new public transport system to flourish in the world, the public bicycle can not only in the short distance travel to play its flexible and efficient advantages, but also can effectively extend the public transport service scope. But in actual operation, "" car car difficult problem restrict public bicycle to play the role and influence of public bicycle system to promote the development of the car difficult. "The car is difficult" problems and the function of the city layout, rental distribution and scale, factors of resident trip distribution, and vehicle scheduling and efficient help to solve this problem is mainly to solve the vehicle scheduling. A number of rental and dispatch center between the stock of public bicycles, including rental demand forecasting and scheduling scheduling path optimization of two part of the paper focuses on the problem; The path optimization problem in scheduling, taking into account the need to focus on scheduling time constraints, the number of dispatch center, scheduling demand changes and other factors. The public bicycle scheduling path optimization problem into multiple travelling salesman problem, scheduling of public bike path optimization problem of research to adapt to different scheduling environment, the specific research work includes the following aspects: (1) according to the classification standard of vehicle routing problem and the combination of public bicycle scheduling optimization characteristics, the paper study 4 kinds of problems. The first problem is a single scheduling center without time window problem of public bicycle path scheduling optimization, considering the vehicle capacity constraints and driving distance constraint the optimization model is established by scheduling the shortest path as the goal, to achieve the scheduling path for asymmetric networks. Based on the problem Classification, single dispatch center without time windows scheduling model is based on other types of problem. (2) study on the second kinds of problems are scheduling path optimization problem single dispatch center soft time windows, timeliness with time window constraints to measure the scheduling service in order to improve customer satisfaction, in violation of time window constraints need accept certain punishment and penalty function was established, and the iterative time expression of vehicle arriving each lease point of time, so as to construct the shortest path scheduling, optimization model of multi objective scheduling path of the highest customer satisfaction. (3) a study of the third class is a multiple dispatch center soft time windows scheduling route optimization problem. On the basis of model, weaken the hypothesis condition of the problem, this paper does not require the return to the original vehicle scheduling and dispatching center, the number of vehicles and scheduling problems in scheduling the path length of the two party The further optimization. (4) to further weaken the assumptions of scheduling path optimization problem of dynamic demand, through the establishment of the time axis and the key points, the dynamic demand problem into static problem, the establishment of public bicycle road scheduling under dynamic demand size optimization model. 4 kinds of problems in this paper, through do the appropriate relaxation of the constraints or with different characteristics, approaching the actual problem, the construction of public bicycle scheduling optimization system can meet different scheduling environment problems. (5) by using the improved genetic algorithm to solve the problem, using Matlab programming software, with 22 public bike rental Kuiwei District of Weifang city for example scheduling, calculated according to the above 4 models respectively, through analysis of calculation results, verify the validity of the algorithm.

【學(xué)位授予單位】：西南交通大學(xué)
【學(xué)位級(jí)別】：碩士
【學(xué)位授予年份】：2015
【分類(lèi)號(hào)】：U491.225

【參考文獻(xiàn)】

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

1 王勇;毛海軍;劉靜;;帶時(shí)間窗的物流配送區(qū)域劃分模型及其算法[J];東南大學(xué)學(xué)報(bào)(自然科學(xué)版);2010年05期

2 廖良才;王棟;周峰;;基于混合遺傳算法的物流配送車(chē)輛調(diào)度優(yōu)化問(wèn)題求解方法[J];系統(tǒng)工程;2008年08期

3 俞慶生;林冬梅;王東;;多旅行商問(wèn)題研究綜述[J];價(jià)值工程;2012年02期

4 柳祖鵬;李克平;朱曉宏;;基于蟻群算法的公共自行車(chē)站間調(diào)度優(yōu)化[J];交通信息與安全;2012年04期

5 焦云濤;李文權(quán);馮佩雨;丁冉;;公共自行車(chē)租賃站點(diǎn)調(diào)度需求量模型研究[J];交通信息與安全;2014年04期

6 梅新;崔偉宏;高飛;劉俊怡;;基于空間聚類(lèi)的物流配送決策研究[J];武漢大學(xué)學(xué)報(bào)(信息科學(xué)版);2008年04期

7 姜大立,楊西龍,杜文,周賢偉;車(chē)輛路徑問(wèn)題的遺傳算法研究[J];系統(tǒng)工程理論與實(shí)踐;1999年06期

8 彭勇;殷樹(shù)才;;時(shí)變單車(chē)路徑優(yōu)化模型及動(dòng)態(tài)規(guī)劃算法[J];運(yùn)籌與管理;2014年02期

9 王詩(shī)瑤;王文發(fā);富文軍;李曉英;;大規(guī)模單車(chē)場(chǎng)VRP問(wèn)題中掃描法的改進(jìn)[J];現(xiàn)代電子技術(shù);2014年24期

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

1 蔣波;基于遺傳算法的帶時(shí)間窗車(chē)輛路徑優(yōu)化問(wèn)題研究[D];北京交通大學(xué);2010年

2 張建國(guó);城市公共自行車(chē)車(chē)輛調(diào)配問(wèn)題研究[D];西南交通大學(xué);2013年

3 秦茜;公共自行車(chē)租賃系統(tǒng)調(diào)度問(wèn)題研究[D];北京交通大學(xué);2013年

4 劉臻;城市公共自行車(chē)運(yùn)營(yíng)中的多車(chē)場(chǎng)車(chē)輛調(diào)配優(yōu)化研究[D];北京交通大學(xué);2014年

，

本文編號(hào)：1431971