Abstract

In recent years, intercity carpooling has been vigorously developed in China. Considering the differences between intercity carpooling and intracity carpooling, this paper first defines the intercity carpooling path optimization problem with time window. Based on the balance of interests among passengers, platform, and government, a multi-objective function is constructed to minimize passenger cost, maximize platform revenue, and minimize carbon emission cost, with vehicle capacity, boarding and alighting points, vehicle service, and other constraints. Secondly, in order to further improve the coordination ability and search speed of the operator, this paper uses the particle swarm optimization algorithm to help the operator remember the previous search position and iterative information, and designs the PSO (Particle Swarm Optimization) improved NSGA-II (Non-dominated Sorting Genetic Algorithm) algorithm to solve the multi-objective model. Finally, the feasibility of the model is verified by numerical analysis of Xi’an–Xianyang intercity carpool. The results show that the path of vehicle 1 is 5-8-O-D-16-13, the path of vehicle 2 is 7-3-6-O-D-15-11-14, and the path of vehicle 3 is 2-1-4-O-D-12-10-9. Compared with NSGA-II algorithm, the PSO-NSGA-II algorithm designed in this paper has significant advantages in global search ability and convergence speed.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call