公交网络最优出行路径模型与算法研究  

Network Optimal Path Model and Algorithm Research

作　　者：裴立秋[1] 

机构地区：[1]吉林建筑工程学院教务处,长春130118

出　　处：《吉林建筑工程学院学报》2012年第4期95-98,共4页Journal of Jilin Architectural and Civil Engineering

摘　　要：随着城市公交线路发展的加速,公交最佳路径的选择已成为人们出行亟待解决的问题.模型中通过对乘车方式进行分类,针对乘客出行的不同需求,同时考虑步行因素,运用Dijkstra算法并通过层次分析法构建因素指标,从而寻找出行的最优路径,较好地解决了交通网络模型问题.With the city transport lines speed up development, choosing the best path of public transportation has be- come urgent to resolve the issue of travel. In the model through carting on the classification to the riding way, going on a journey the different demand in view of the passenger, simultaneously considers the walk factor, utilizes the Di- jkstra algorithm and through the analytic hierarchy process construction factor target, thus seeks for the journey the optimal choice, has solved the transport network model problem well.

关 键 词：公交线路查询 DIJKSTRA算法 公交网络最优路径 广义费用函数 

分 类 号：O229[理学—运筹学与控制论]