Font Size: a A A

Route Choice Optimization For Ride Matching Under One-to-Many Travel Demand

Posted on:2018-08-17Degree:MasterType:Thesis
Country:ChinaCandidate:X P DuFull Text:PDF
GTID:2322330536485119Subject:Transportation planning and management
Abstract/Summary:PDF Full Text Request
In recent years,with the rapid development of the China's economy,on the one hand,auto possession is expanding rapidly,which leads to some problems that can not be ignored,such as environment,resources,noise and traffic.On the other hand,the existing public transport,such as taxi,subway and bus,etc.,has become difficult to satisfy travel demand.Despite there are some measures,such as the government's limit,research on line planning of relatedd enterprises,and new energy vehicles,etc.,that's not enough.The implementation of the “car pool” travel is not only a great way to alleviate traffic pressure and effective use of resources,but also is an auxiliary way of the government policy and travelers preferred option.“Carpooling” early appeared in Shanghai,Beijing,Guangzhou,and many people called the “mutual bus”.Then in other domestic cities,the phenomenon of taking a car to and from work with others has heat up.According to the relevant reports,in many second-tier cities,“carpooling” has gradually become an alternative way to travel.Paper takes the “carpooling” as the development of root,combining the actual situation of our country,the people's travel demand and abundant resources of the private cars,and takes carpool as the research object,which has important practical significance and creative.Based on the futher research,the paper starts from the typical Vehicle Routing Problem(VRP),laying a solid foundation for building a resonable scientific and effective model of path optimization for private cars “carpool”,which has the important supporting role to improve the traffic efficiency,reduce energy consumption,and save people's travel cost.Based on the study of the Dial-a-Ride Problem and Carpooling Problem,this paper proposes a multi-vehicle ride match problem(MVRMP)model which makes the cost of travel and time to be minimized,which is different from the two models.At first,a small-scale data is used to test the validity of the established model,solved with Lingo software.Then,the paper adopts the three series of Solomon standard database,according to an improved genetic algorithm,solving on MATLAB platform.The results demonstrates the applicability of the model in this paper and the effectiveness of the algorithm designed.Through the analysis of the results,private cars carpool can achieve a win-win effect,namely,for passengers,it's can not only save travel cost,but also can satisfy the requirement of the comfort and convenience of driving;for the urban environment,it's can alleviate traffic pressure,improve the environment,and has important social benefits.
Keywords/Search Tags:Ride Match, Matching, Route Optimization, Passenger Psychology, Genetic Algorithm
PDF Full Text Request
Related items