出租車合乘模式下的智能匹配問題的研究與實(shí)現(xiàn)
[Abstract]:With the rapid development of economy in our country, taxi, as the only public transportation mode which can provide individualized travel for urban residents, has become an indispensable part of people's daily life. However, taxi has brought a lot of convenience and enjoyment to ordinary people, at the same time, its 24-hour passenger search and "one car, one person" service mode have caused a series of problems, such as waste of taxi space resources, urban traffic congestion, air environment pollution, oil energy consumption and so on. In view of the above situation, the concept of "vehicle ride" emerges as the times require, which is praised by many experts and scholars as the best way to improve taxi operation. In this paper, the intelligent taxi combination matching problem is taken as the research object, and the related theories and methods are systematically analyzed. According to the actual needs of passengers, the taxi intelligent matching public service system is designed and completed. The system uses a piecewise intelligent matching algorithm to divide the whole problem into two parts. first, the problem of multiple taxi combination matching is simplified to a single taxi combination matching problem through passenger assignment, and then the optimal solution of combination matching is obtained by optimizing the vehicle route. The main work of this paper is as follows: (1) distribute the passengers and determine the passengers taken by each taxi. According to the situation around each station in the initial path of taxi, the particle swarm optimization algorithm is used to take the matching rate as the objective optimization function, and the constraints and the personalized needs of passengers are added to obtain the optimal adjustment radius of each taxi during the driving process. The passengers in the radius range are divided into a specific taxi to serve as the basis for the next optimization process. (2) further optimize the vehicle route and get the least expensive driving route. The passengers who have been divided into the same taxi are optimized by genetic algorithm. Taking the total cost as the objective optimization function, the genetic selection of the individual is carried out. Through repeated cyclic selection, crossing and variation operation, the internal boarding sequence of each passenger is sorted, the individuals with low fitness are eliminated, the individuals with high fitness are left behind, and the optimized driving route is finally obtained to meet the goal of the least total cost. (3) on the basis of algorithm research, the intelligent matching public service system of taxi is designed and completed. The system is designed to meet the personalized needs of passengers. It integrates four service platforms: passenger ride platform, taxi vehicle platform, intelligent matching platform and intelligent supervision platform. Through the segmented matching algorithm, a convenient vehicle matching service is provided for taxi drivers and passengers to meet the travel needs of as many passengers as possible with the least cost and cost. At the same time, the taxi is used as the information collection terminal to cooperate with the data of some passengers to provide intelligent transportation analysis service, safety production analysis service and so on for the supervision and management department. In this paper, the effectiveness of the algorithm is verified by generating random data, which has strong practical application value for solving the taxi ride problem, can provide certain theoretical support for the development of taxi industry in the future, and provides great help for optimizing the rational allocation of taxi resources, improving urban traffic conditions and promoting the more harmonious and stable development of urban public transport.
【學(xué)位授予單位】:中國海洋大學(xué)
【學(xué)位級別】:碩士
【學(xué)位授予年份】:2014
【分類號】:U492.434;U495;TP18
【參考文獻(xiàn)】
相關(guān)期刊論文 前10條
1 盧川;吳群;;城市居民出行合乘出租車問題的研究[J];道路交通與安全;2007年05期
2 楊偉新;張曉森;;粒子群優(yōu)化算法綜述[J];甘肅科技;2012年05期
3 覃運(yùn)梅;石琴;;出租車合乘模式的探討[J];合肥工業(yè)大學(xué)學(xué)報(自然科學(xué)版);2006年01期
4 吳耀華;張念志;;帶時間窗車輛路徑問題的改進(jìn)粒子群算法研究[J];計(jì)算機(jī)工程與應(yīng)用;2010年15期
5 鄭麗娟;;有關(guān)汽車合乘問題的研究[J];交通標(biāo)準(zhǔn)化;2010年11期
6 翟泳;楊金梁;連劍;樊銘渠;;合乘出行信息檢索的路徑匹配算法[J];交通與計(jì)算機(jī);2007年01期
7 張瑾;何瑞春;;解決動態(tài)出租車“拼車”問題的模擬退火算法[J];蘭州交通大學(xué)學(xué)報;2008年03期
8 鄧社軍;陳峻;李春燕;畢昕;;我國城市快速路基本路段HOV車道設(shè)置方案研究[J];交通運(yùn)輸工程與信息學(xué)報;2013年02期
9 曾毅;朱旭生;廖國勇;;一種基于鄰域空間的混合粒子群優(yōu)化算法[J];華東交通大學(xué)學(xué)報;2013年03期
10 葛瑞原;王而山;;也說“合乘出租車”[J];交通與運(yùn)輸;2012年04期
相關(guān)博士學(xué)位論文 前1條
1 段鳳華;帶軟時間窗約束的開放式車輛路徑問題及其應(yīng)用[D];中南大學(xué);2010年
,本文編號:2508470
本文鏈接:http://sikaile.net/kejilunwen/jiaotonggongchenglunwen/2508470.html