计算机科学与技术毕业设计-随机蛙跳算法的研究与实现.docVIP

PAGE 本 科 毕 业 论 文 题 目 随机蛙跳算法的研究与实现 作 者： 胡云辰 专 业： 计算机科学与技术 指导教师： 丁卫平 完成日期： 2011年6月 南通大学毕业论文 PAGE I 摘 要 随机蛙跳算法(Shuffled Frog Leaping Algorithm,SFLA)是进化计算领域中一种新兴、有效的亚启发式种群算法，它结合了具有较强局部搜索能力的元算法(Memetic Alogrithm,MA)和具有良好全局搜索性能的粒子群算法(Particle Swarm Optimization,PSO)的优点，算法寻优能力强，易于编程实现，由Eusuff和Lansey于2003年正式提出，近几年来逐渐受到学术界和工程优化领域的关注。 本文首先介绍了随机蛙跳算法的理论基础-粒子群优化算法及其两者之间的关系；然后总结了随机蛙跳算法的基本原理、算法流程；及在背包求解问题上的应用。在上述研究基础上提出了一种带有电荷的改进随机蛙跳算法(QSFLA)和一种基于最差扰动的改进随机蛙跳算法(WDSFLA)，并通过实验对以上述两种算法进行了仿真测试和分析。 本课题对进一步研究和改进随机蛙跳算法提供了一定的参考价值。 关键词 随机蛙跳算法，亚启发式算法，粒子群优化算法，工程优化，背包问题， 最差扰动 ABSTRACT Shuffled Frog Leaping Algorithm is an emerging effective sub-heuristic in the field of evolutionary computation, which combines the advantages of Memetic Algorithm and Particle Swarm Optimization, which has strong local search and global search ability. So it is good at searching for the best and is easy to be programmed. It is raised formally by Eusuff and Lansey in 2003 and become gradually popular the field of academic and optimization in recent years Firstly, this paper describes the theoretical basis of shuffled frog leaping algorithm - Particle Swarm Optimization and their relationship. Then summarize the basic principle and flow of shuffled frog leaping. Next we solve problems about the application on packing bags.?Based on the above study, we raise two new shuffled frog leaping algorithm: an improved shuffled frog leaping with a charge on it and a new shuffled frog leaping algorithm based on worst disturbance. The simulations and analysis about the new algorithms are done by experiment. The subject provides a certain reference value for the further study and improvement of shuffled frog leaping algorithm Key Words: Shuffled Leaping Frog Algorithm, Sub-heuristic Algorithm, Engineering Optimization, Knapsack problem, Particle Swarm Optimization, Worst Disturbance 目 录 TOC \o 1-3 \h \u HYPERLINK \l _Toc7881 第一章 绪 论 PAGEREF _Toc7881 1