Metaheuristic Algorithm of Multi-passengers Routing Path for Ride-Sharing Vehicle

With the standard of medical treatment raised up, the number of population is increased. People need to the extent new space for living. The convenient traffic is part of people life. Internet of things (IoT) promotes the development of riding-sharing which solving traffic blocked problem and made transportation flexible. This paper focuses on multi-people path planning by sharing vehicle problem to have more convenient traffic. In the current, public transports have fixed route so that passengers need to wait for the bus at the bus stop. The route path always cannot satisfy the request of customers. This paper adopts novelty concept of the ride-sharing to solve multi-path and passenger schedule planning problem to have highly flexible traffic method. We considering the waiting time of passenger and short path problem, and then propose two algorithms based on metaheuristic algorithm. Simulation represents that proposed method can design the best-shared vehicle path for different environments.