天堂国产午夜亚洲专区-少妇人妻综合久久蜜臀-国产成人户外露出视频在线-国产91传媒一区二区三区

當(dāng)前位置:主頁 > 科技論文 > 交通工程論文 >

出租車合乘模式下的智能匹配問題的研究與實(shí)現(xiàn)

發(fā)布時間:2019-07-01 12:29
【摘要】:隨著我國經(jīng)濟(jì)的快速發(fā)展,出租車作為唯一能為城市居民提供個性化出行的公共交通方式,已經(jīng)成為人們?nèi)粘I钪胁豢苫蛉钡囊徊糠。然而,出租車在為廣大尋常百姓帶來了許多便利和享受的同時,其24小時尋客和“一車一人”的服務(wù)方式,造成了出租車空間資源浪費(fèi)、城市交通擁堵、大氣環(huán)境污染、石油能源消耗等一系列問題。針對上述情況,“車輛合乘”的概念應(yīng)運(yùn)而生,被許多專家學(xué)者譽(yù)為改善出租車運(yùn)營問題的最佳途徑。 本文以出租車智能合乘匹配問題作為研究對象,對相關(guān)理論方法展開了系統(tǒng)的分析,從乘客的實(shí)際需求出發(fā),設(shè)計(jì)完成了出租車智能匹配公共服務(wù)系統(tǒng)。該系統(tǒng)運(yùn)用一種分段求解的智能匹配算法,將整個問題分為兩部分,先通過乘客分配,將多輛出租車合乘匹配問題簡化為單輛出租車合乘匹配問題,再經(jīng)過車輛路線優(yōu)化,最終得到合乘匹配的最優(yōu)解。 本文主要進(jìn)行了以下幾個方面的工作: (1)對乘客進(jìn)行分配,確定每輛出租車搭乘的乘客。根據(jù)出租車初始路徑中各站點(diǎn)周圍的情況,運(yùn)用粒子群優(yōu)化算法,以匹配率作為目標(biāo)優(yōu)化函數(shù),加入約束條件和乘客的個性化需求,反復(fù)迭代得出每輛出租車行駛過程中途徑站點(diǎn)的最佳調(diào)整半徑。將半徑范圍內(nèi)的乘客劃分到某輛特定的出租車上,為進(jìn)行下一步的優(yōu)化過程做基礎(chǔ)。 (2)對車輛路線進(jìn)一步優(yōu)化,得到花費(fèi)最少的行駛路線。將已經(jīng)劃分到同一輛出租車上的乘客,運(yùn)用遺傳算法進(jìn)行優(yōu)化求解。以總花費(fèi)作為目標(biāo)優(yōu)化函數(shù),對個體進(jìn)行遺傳選擇,通過反復(fù)循環(huán)地進(jìn)行選擇、交叉、變異操作,對每輛車上的乘客內(nèi)部上下車順序進(jìn)行排序,剔除適應(yīng)度低的個體,留下適應(yīng)度高的個體,最后得到優(yōu)化的行駛路線,滿足總花費(fèi)最少的目標(biāo)。 (3)在算法研究的基礎(chǔ)上設(shè)計(jì)完成了出租車智能匹配公共服務(wù)系統(tǒng)。該系統(tǒng)是為滿足乘客的個性化合乘需求而設(shè)計(jì),集成了乘客合乘平臺、出租車車載平臺、智能匹配平臺和智能監(jiān)管平臺四大服務(wù)平臺。通過分段匹配算法,為出租車司機(jī)和乘客提供便捷的車輛合乘匹配服務(wù),以最少的花費(fèi)和代價,滿足盡可能多的乘客出行需求。同時,利用出租車作為信息采集終端,配合部分乘客用車的數(shù)據(jù),為監(jiān)督管理部門提供智能交通分析服務(wù)、安全生產(chǎn)分析服務(wù)等。 本文通過產(chǎn)生隨機(jī)數(shù)據(jù)進(jìn)行實(shí)驗(yàn)?zāi)M,驗(yàn)證了算法的有效性,對解決出租車合乘問題具有較強(qiáng)的實(shí)際應(yīng)用價值,可以為今后出租車行業(yè)的發(fā)展提供一定的理論支持,對優(yōu)化出租車資源合理配置,改善城市交通狀況,促進(jìn)城市公共交通更加和諧穩(wěn)定地發(fā)展提供了很大程度上的幫助。
[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

資料下載
論文發(fā)表

本文鏈接:http://sikaile.net/kejilunwen/jiaotonggongchenglunwen/2508470.html


Copyright(c)文論論文網(wǎng)All Rights Reserved | 網(wǎng)站地圖 |

版權(quán)申明:資料由用戶3020c***提供,本站僅收錄摘要或目錄,作者需要刪除請E-mail郵箱bigeng88@qq.com