Research And Simulate On Real-Time Carpooling Service Strategy

Internet-based network carpooling service has formed a brand new car model.Despite the rapid development of carpooling services in recent years,the simple carpo oling service model has not been able to adapt well to the increasingly complex market environment.This paper takes real-time carpooling service as the core,researches and designs a relatively complete carpooling service strategy.During the algorithm researching of carpooling service,this paper proposes a carpool order matching algorithm based on bilateral matching theory,which can reduce the time complexity in the order matching process.At the same time,this paper designs a cluster-based method to get the passenger boarding postions,and designs data to test algorithm.Firstly,this paper introduces the background knowledge and related technology of carpooling service.Secondly,this paper gives the research and data analysis of real-time carpooling service needs based on literature and data support.Thrid,this paper researches and designs some core algorithms in carpooling service.At the same time,the overall architecture,functional modules and key processes of the service are designed in detail.On this basis,the detailed design and implementation of the carpooling service is completed,and the key class diagrams and method descriptions of each module are given.The implementation results are displayed and the core functions are tested.This paper verified the road simulation with the help of traffic simulation tools.Finally,this paper summarizes the work of the full text and proposes further research directions in the future.