車輛動態(tài)合乘匹配算法研究
[Abstract]:With the improvement of material standard of living, more and more families begin to own private cars. The rapid growth of the number of vehicles in China is accompanied by a series of problems, such as traffic congestion, environmental pollution and so on. At the same time, although there are a lot of traffic on the road, the major cities still have varying degrees of difficulty in taxi problems. Simply widening roads and increasing the number of taxis will not solve this problem very well. To this end, car-sharing began to walk into people's lives, using the spare seats as a ride resource. At present, the European and American countries have regular vehicle ride, and China is still in its infancy. In the early days, some websites that provided information on vehicle rides provided only basic travel time and terminal information, and the use of text matching technology made it difficult for passengers and car owners to match effectively and were not widely accepted by the public. Therefore, an effective vehicle matching algorithm is the key to the research of vehicle ridership problem. At present, many scholars only study the static vehicle matching problem, and lack of considering the influence of external factors, such as road traffic situation, vehicle owner and passenger factors, etc. In particular, the deterministic static vehicle matching problem has already stipulated the time and location of passengers getting on and off before the departure of the vehicle. In actual life, it is very difficult for the owner and passenger to reach the point of the ride strictly according to the time window, as long as there is a link error. The whole combination is likely to be a failed multiplicative match. In this paper, we focus on the dynamic matching problem of vehicles, which can only be matched by vehicles located near passengers in real time, so as to solve the problem of vehicle arrival time uncertainty. With the help of Dijkstra algorithm and genetic algorithm, with the addition of passengers, the vehicle can always get the new shortest path. On this basis, the time window is checked, the matching degree between passenger and vehicle is calculated, and the matching relationship is determined. Finally, the paper constructs a road network including the main trunk roads in Kunming, and tests the matching process of passenger and vehicle on the simulation system, which proves that the algorithm in this paper can effectively solve the problem of vehicle dynamic matching.
【學位授予單位】:昆明理工大學
【學位級別】:碩士
【學位授予年份】:2017
【分類號】:U491
【參考文獻】
相關(guān)期刊論文 前10條
1 賈賀棋;劉黎;;論眾籌成功項目的發(fā)展現(xiàn)狀——以滴滴打車為例[J];價值工程;2015年36期
2 ;搖搖百米:打車軟件的鼻祖是如何倒下的?[J];中國商人;2015年06期
3 李洪波;;破解城市道路交通擁堵的實踐——新加坡道路交通管理的價格機制運用措施[J];市場經(jīng)濟與價格;2014年12期
4 王飾欣;胡靜波;王莉莉;;地圖數(shù)據(jù)結(jié)構(gòu)的簡要分析[J];測繪與空間地理信息;2014年10期
5 周桂良;黃凱;毛麗娜;朱艷茹;;定時、定線路上下班拼車方案實現(xiàn)與評價——以淮安為試點[J];交通信息與安全;2014年04期
6 黃藝;胡善岳;何芊;王濤;謝智勇;;基于Android平臺的移動通訊設(shè)備的GPS定位研究[J];激光雜志;2014年03期
7 黃師化;;鄰接矩陣求帶權(quán)圖中最短通路[J];安慶師范學院學報(自然科學版);2013年04期
8 宋超超;王洪國;邵增珍;楊福萍;;一種求解多車輛合乘匹配問題的適應(yīng)性算法[J];計算機科學;2013年02期
9 顧玉磊;陳文強;吳群琪;;特大城市居民出行行為決策研究[J];湘潭大學自然科學學報;2012年04期
10 蔡立斌;;基于Android的智能移動設(shè)備GPS定位系統(tǒng)設(shè)計與實現(xiàn)[J];電腦知識與技術(shù);2012年35期
相關(guān)重要報紙文章 前1條
1 馬小寧;;美國的拼車文化[N];人民日報;2012年
相關(guān)博士學位論文 前1條
1 王海梅;基于GIS的最優(yōu)路徑算法研究與實現(xiàn)[D];南京理工大學;2008年
相關(guān)碩士學位論文 前10條
1 吳樹新;基于雙層遺傳算法的城市出租車合乘模型的研究[D];大連交通大學;2015年
2 劉欣欣;旅行商問題的基因片段插入算法研究[D];閩南師范大學;2015年
3 陳思o,
本文編號:2417056
本文鏈接:http://sikaile.net/kejilunwen/daoluqiaoliang/2417056.html