欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
针对传统算法在计算大规模路网的优化问题时所表现出来的计算时间长、存储空间大等缺点，提出了一种改进的人工蜂群算法来求解最优路径选择的方法．试验结果表明，对于有向图和无向图，该算法都具有较好的全局寻优能力，即能获得满足条件的最优路径．
英文摘要：
It is noted that the traditional algorithms for the large--scale road network optimization problem need long computing time and large storage space, an improved artificial bee colony algorithm is proposed for solving the shortest path problem in this paper. We use two different test problems to measure and evaluate the proposed algorithm, including the directed graph and the undirected graph, and the experimental results show that the proposed algorithm has better global optimization ability namely that it can obtained the optimization path which satisfy the conditions.
同期刊论文项目
同项目期刊论文
Solving high dimensional bilevel multiobjective programming problem using a hybrid particle swarm op
Solving Bilevel Multiobjective Programming Problem by Elite Quantum Behaved Particle Swarm Optimizat
期刊信息
位置：