Search

Optimizing travel routes in urban transportation networks is essential for enhancing traffic efficiency in major cities. This study focuses on optimizing the combined subway and taxi travel routes from Beijing Union University to Beijing South Railway Station, a critical route for students and staff in Beijing. To address this, we propose three genetic algorithms: the Standard Genetic Algorithm (SGA), the Multipoint Crossover and Elitist Selection Genetic Algorithm (MPEGA), and the Improved Dynamic Crossover and Mutation Rate Genetic Algorithm (IDCMGA). Experimental results indicate that MPEGA reduces the mean travel cost by 15.21%, the variance by 81.72%, and the standard deviation by 57.25% compared to SGA. Additionally, IDCMGA reduces the average by 1.76%, the variance by 63.16%, and the standard deviation by 39.30% compared to MPEGA. The improved IDCMGA algorithm demonstrates significant advantages over the other two algorithms in terms of global optimization capability, convergence speed, and stability, and is more adept at adapting to new traffic conditions to identify the optimal route. Optimizing this route not only reduces commuting time and costs but also alleviates traffic congestion, thereby enhancing the overall efficiency of the urban transportation system. [ABSTRACT FROM AUTHOR]

Optimizing travel routes in urban transportation networks is essential for enhancing traffic efficiency in major cities. This study focuses on optimizing the combined subway and taxi travel routes from Beijing Union University to Beijing South Railway Station, a critical route for students and staff in Beijing. To address this, we propose three genetic algorithms: the Standard Genetic Algorithm (SGA), the Multipoint Crossover and Elitist Selection Genetic Algorithm (MPEGA), and the Improved Dynamic Crossover and Mutation Rate Genetic Algorithm (IDCMGA). Experimental results indicate that MPEGA reduces the mean travel cost by 15.21%, the variance by 81.72%, and the standard deviation by 57.25% compared to SGA. Additionally, IDCMGA reduces the average by 1.76%, the variance by 63.16%, and the standard deviation by 39.30% compared to MPEGA. The improved IDCMGA algorithm demonstrates significant advantages over the other two algorithms in terms of global optimization capability, convergence speed, and stability, and is more adept at adapting to new traffic conditions to identify the optimal route. Optimizing this route not only reduces commuting time and costs but also alleviates traffic congestion, thereby enhancing the overall efficiency of the urban transportation system.