摘要
为规划更优的共享通勤班车路径,提高通勤体验,构建了共享通勤班车规划模型,通过对启发式函数的改良和引入全局最优解概率的选择,提出了一种改进的蚁群算法,优化了对班车遍历路径的搜索,Matlab仿真运行结果表明该方法能有效优化共享通勤班车路径并提高效率。
To enhance the commuting experience by optimizing the routes of shared commuter buses,this paper constructs a planning model for shared commuter shuttles.An improved ant colony algorithm is introduced,which enhances the heuristic function and incorporates the selection of a global optimal solution probability,to optimize the search for the shuttle's traversal path.Simulation operations conducted with Matlab demonstrate that this method can effectively optimize the path of shared commuter buses,thereby increasing the efficiency of commuters'journeys.
作者
万佳琦
李旭鹏
闫国富
曾林昊
祁子豪
WAN Jiaqi;LI Xupeng;YAN Guofu;ZENG Linhao;QI Zihao(Wuhan Huaxia University of Technology,Wuhan 430223,China;School of Automotive Engineering,Wuhan University of Technology,Wuhan 430070,China;Hubei Collaborative Innovation Center for Automotive Components Technology,Wuhan 430070,China)
关键词
共享通勤
路径规划
优化
蚁群算法
数据处理
shared commuter
route planning
optimisation
ant colony algorithm
data processing
