Research On Dynamic Vehicle Online Scheduling Algorithm For Urban Traffic Trip

With the development of 5g communication technology,the coordination and cooperation between dynamic vehicles will become more credible,which provides a realistic possibility for dynamic fleet scheduling.We study two scenarios of dynamic vehicle online scheduling.First of all,in urban transportation,due to the lack of efficient matching strategy between passengers and vehicles,it is easy to cause that many passengers can not get a taxi at some time,while many idle taxis are cruising aimlessly.In order to solve the problem of congestion and energy consumption in urban traffic and improve the efficiency of vehicle operation,this paper models the taxi scheduling problem and designs an efficient allocation algorithm for taxi mobile service.The real-time taxi scheduling problem is defined as a group of taxi fleet controlled by the central controller.Passengers send real-time requests through the application program.These requests are unknown in advance,and they hope that the passengers can be picked up as soon as possible after the request is sent and delivered directly to the destination.In this paper,a new heuristic algorithm of passenger taxi assignment is proposed,which can improve the efficiency of assignment and plan the whole assignment more reasonably.We do a group of experiments based on real data sets,and compare several common allocation algorithms with different examples of our heuristic algorithm.The results show that our algorithm can effectively reduce the mileage of taxi fleet,and reduce the waiting time of customers,so as to improve the operation efficiency of vehicles and passenger satisfaction,and relieve the pressure of urban traffic.Secondly,the main problems of urban transportation are the long waiting time of passengers and the long empty mileage of vehicles.According to the situation of one person per taxi,there is an upper limit to the carrying capacity,and there will always be free seats on the taxi,which can not be fully utilized.Therefore,sharing is the better choice.Sharing means that different passengers can take the same car at the same time to improve the carrying capacity of the vehicle.In this paper,the green bus sharing problem is modeled.The control center receives passengers’requests in real time.Here,we adopt the concept of dynamic time slice.When the tasks reach a certain number or wait for a certain period of time,we start the task vehicle scheduling.In the scheduling process,we allow the passengers who have not yet got on the bus to participate in the allocation again,fully considering the dynamic nature of the scheduling process,However,passengers who have already boarded will not be assigned to other vehicles.In this paper,a heuristic algorithm is proposed to solve the co multiplication problem.The algorithm ensures the correctness of the search direction through an allocation constraint,and provides the worst guarantee for the feasible solution.We do a group of experiments based on real data sets,and compare several common allocation algorithms with different examples of our heuristic algorithm.The results show that our algorithm can effectively reduce the mileage of taxi fleet,the detour distance of vehicles and the total waiting time of passengers.So as to improve the operation efficiency of vehicles and passenger satisfaction,relieve the pressure of urban traffic.