Robust Optimization Of Ride Path For Online Taxi-Hailing

In the rapid development of modern economic information,the number of various vehicles has increased rapidly,especially the increase in various private cars,which has led to a large number of congestion in many cities.Most of the choices of vehicle travel routes are driven by experience and there is a certain subjective awareness.Therefore,vehicle sharing is expected to ease urban traffic congestion.Allowing passengers to choose a ride and formulate a reasonable route for the vehicle,on the one hand,can reduce passenger travel costs and reduce travel time delays;on the other hand,due to passengers' sharing,the number of empty vehicles can be reduced and the driver's income can be increased..It can also respond to the country's sustainable transportation concept,reduce energy consumption and reduce environmental pollution,thereby improving urban traffic congestion and alleviating traffic pressure.China's network-to-car sharing route system is still in its infancy,and has not been vigorously promoted and implemented,and there is no rigorous basis for the system model and charging standards of the network-car-to-car route,resulting in frequent network car rides.Various personnel disputes have caused resentment against the ride due to improper path selection.Therefore,whether it is from the perspective of consumers or service consumers,the promotion of effective network-car sharing route optimization mode can realize the rational allocation of vehicles and promote the more stable and healthy development of urban traffic.Based on the original research on vehicle sharing and vehicle routing problems,this paper establishes a situation of multi-win and win-win situation.Through analysis and consideration of the win-win situation between drivers and passengers,this paper establishes the network under certain circumstances and uncertain situations.Two major problem models for vehicle synthesis path optimization.For the two problem models,the most comprehensive passengers in the multi-station system are designed.The passengers take the shortest time and the shortest driving distance as the objective function.The vehicle capacity and the number of passengers are used as constraints to establish the network vehicle synthesis path.The model is optimized and the NSGA-II multi-objective genetic algorithm for solving the model is designed.In the optimization model of the network-on-car-integration path under uncertainty,based on the robust optimization model,the robust optimization model for single-car and vehicle-integrated paths under uncertain conditions and the multi-network car-integration path under uncertain conditions are established.Robust optimization model.A multi-objective genetic algorithm with two-stage coding is used to solve the robust optimization problem model of single-network car-integration path under uncertain conditions.For the robust optimization model of multi-network car-integration path under uncertain conditions,thispaper uses The greedy strategy optimizes the Pareto optimal solution set by the fast sorting method.Finally,according to the models and algorithms of each chapter,the analysis of each case is carried out,which shows that under the same conditions,the optimization of the network-about car route can reduce the no-load phenomenon of the network car,alleviate the traffic pressure and reduce the environmental pollution,to a certain extent.To alleviate the problem of urban traffic congestion,we will achieve a win-win situation.The results of the case study show that the feasibility of the optimization model and algorithm can provide a decision basis for the implementation of the network-based car-pooling route selection.