蛙跳算法研究及应用.docx

陕西师范大学毕业论文 PAGE \* MERGEFORMAT II 陕西师范大学本科生毕业论文 PAGE \* MERGEFORMAT 1 陕西师范大学毕业论文 PAGE \* MERGEFORMAT 2 摘 要 随机蛙跳算法(Shuffled Frog Leaping Algorithm,SFLA)是进化计算领域中一种新兴、有效的亚启发式种群算法，它的基本思想来源于文化基因传承,其显著特点是具有局部搜索与全局信息混合的协同搜索策略，寻优能力强，易于编程实现，由Eusuff和Lansey于2003年正式提出，近几年来逐渐受到学术界和工程优化领域的关注。 本文从蛙跳算法的基本概念开始，分析算法的工作过程总结其基本原理与算法流程，然后对其关键参数进行说明并采用测试函数测试，最后将蛙跳算法应用于解决0-1背包问题，并与相关文献的结果进行对比，验证了算法解决此类问题的可行性。 关键词：蛙跳算法，函数优化，背包问题 ABSTRACT Shuffled Frog Leaping Algorithm (SFLA) is an emerging effective sub-heuristic in the field of evolutionary computation. Its basic idea comes from the cultural genetic inheritance and notable feature is a collaborative search strategy that is a mixture of local search and global information. SFLA 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 concept of SFLA, and summarizes its basic principle. Then, we draw the flowsheet, describe the key parameters and verify the algorithm by use of the test function. At last, we solve problems about the application on packing bags and prove its feasibility. Key words: Shuffled Leaping Frog Algorithm，Function optimization ， Knapsack problem 目 录 TOC \o 1-3 \h \z \u HYPERLINK \l _Toc356855510 第一章 绪论 PAGEREF _Toc356855510 \h 1 HYPERLINK \l _Toc356855511 1.1选题意义及研究背景 PAGEREF _Toc356855511 \h 1 HYPERLINK \l _Toc356855512 1.2国内外研究现状 PAGEREF _Toc356855512 \h 2 HYPERLINK \l _Toc356855513 1.3 论文研究的内容 PAGEREF _Toc356855513 \h 4 HYPERLINK \l _Toc356855514 1.4 论文章节安排 PAGEREF _Toc356855514 \h 4 HYPERLINK \l _Toc356855515 第二章 蛙跳算法的基本理论 PAGEREF _Toc356855515 \h 5 HYPERLINK \l _Toc356855516 2.1 蛙跳算法概述 PAGEREF _Toc356855516 \h 5 HYPERLINK \l _Toc356855517 2.2 蛙跳算法原理 PAGEREF _Toc356855517 \h 5 HYPERLINK \l _Toc356855518 2.2.1 蛙跳算法的基本原理描述 PAGEREF _Toc356855518 \h 5