| 求解k条最短路径问题的混合蛙跳算法 |
| |
| 引用本文： | 马炫,刘庆.求解k条最短路径问题的混合蛙跳算法[J].信息与控制,2011,40(5). |
| |
| 作者姓名： | 马炫 刘庆 |
| |
| 作者单位： | 西安理工大学自动化与信息工程学院,陕西西安,710048 |
| |
| 基金项目： | 陕西省教育厅专项科研计划资助项目 |
| |
| 摘 要： | 提出了一种求解k条最短路径问题的混合蛙跳算法.采用自然路径的形式对青蛙个体编码,设计了一种能够使模因信息在青蛙个体间传递的蛙跳方法.在各青蛙族群内部,通过较差个体向优秀个体的跳跃进行局部搜索,从而优化模因信息.在族群之间,通过混合与排序使各族群的模因信息得以交流与重组,从而获取新的寻优方向.数值实验表明,本文算法搜索k条最短路径的能力强、收敛速度快、稳定性好,可应用于求解大规模网络中的多条最优路径问题.
|
| 关 键 词： | 混合蛙跳算法 最短路径 局部搜索 |
A Shuffled Frog Leaping Algorithm for k-Shortest Paths Problem |
| |
| MA Xuan,LIU Qing.A Shuffled Frog Leaping Algorithm for k-Shortest Paths Problem[J].Information and Control,2011,40(5). |
| |
| Authors: | MA Xuan LIU Qing |
| |
| Affiliation: | MA Xuan,LIU Qing (The Faculty of Automation and Information Engineering,Xi'an University of Technology,Xi'an 710048,China) |
| |
| Abstract: | A shuffled frog leaping algorithm for solving k-shortest paths problem is proposed.The algorithm uses the form of natural route to encode frog individual.A method of carrying out leaping behavior of frog is designed to transmit meme information among frogs.In each memeplex,the meme information of frog individuals is optimized by the local search realized through the leaping from the worse individuals to the better ones.New searching orientation of each memeplex is made by shuffling all memeplexes together a... |
| |
| Keywords: | shuffled frog leaping algorithm shortest path local search |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
