大理大学学报 ›› 2026, Vol. 11 ›› Issue (6): 93-100.

• 学生园地 • 上一篇    

基于图论与遗传算法的大理市公交线路优化研究

  

  1. (大理大学数学与计算机学院,云南大理 671003)
  • 收稿日期:2025-11-10 出版日期:2026-06-15 发布日期:2026-06-30
  • 通讯作者: 李佳梅,讲师,E-mail: 510420996@qq.com。
  • 作者简介:李雾,2022级数学与应用数学专业本科生,主要从事应用数学研究。
  • 基金资助:
    2023年度云南省专业学位研究生教学案例库建设项目(云学位〔2023〕9号);大理大学科研发展基金项目(FZ2025ZD030;FZ2025YB069;FZ2024ZD009;FZ2023YB032;FZ2023YB035;FZ2023YB039);大理大学第九期教育教学改革研究项目(JG09318)

Research on Bus Routes Optimization in Dali City Based on Graph Theory and Genetic Algorithms

  1. (College of Mathematics and Computer Science, Dali University, Dali, Yunnan 671003, China)
  • Received:2025-11-10 Online:2026-06-15 Published:2026-06-30

摘要: 以大理市公交系统为研究对象,针对旅游旺季客流量激增导致的候车时间长、线路拥堵等问题,本研究结合图论与遗传算法开展公交线路优化研究。首先,构建以公交站点为节点、综合通行代价为边权的网络拓扑结构;进而建立以乘客候车时间最短和运营成本最低为目标的多目标优化模型,利用遗传算法对该模型进行求解,获得公交调度优化方案,并通过MATLAB仿真进行验证与对比分析。仿真结果表明,优化后的方案能有效提升公交运行效率,为旅游城市公交系统优化提供理论支持与实践参考。

关键词: 图论, 遗传算法, 大理市公交线路, 线路优化

Abstract: Taking the public transportation system of Dali City as the research subject, this study addresses issues such as prolonged
waiting times and route congestion caused by the surge in passenger flow during tourist peak seasons. By integrating graph theory and genetic algorithms, the research conducts an optimization study on bus routes. First, a network topology structure is constructed with bus stops as nodes and comprehensive travel costs as edge weights. Subsequently, a multi-objective optimization model is established with the goals of minimizing passenger waiting time and operational costs. The genetic algorithm is employed to solve this model, yielding an optimized bus scheduling scheme. MATLAB simulations are then conducted for verification and comparative analysis. The results demonstrate that the optimized scheme effectively enhances bus operational efficiency, providing theoretical support and practical reference for the  optimization of public transportation systems in tourist cities.

Key words: graph theory, genetic algorithm, bus routes in Dali City, route optimization

中图分类号: