Please use this identifier to cite or link to this item:
http://hdl.handle.net/10603/96935
Title: | NATURE INSPIRED COMPUTATION METHODS AND THEIR APPLICATION IN FUNCTION OPTIMIZATION |
Researcher: | Sandeep Kumar |
Guide(s): | Sharma, Vivek Kumar |
Keywords: | Artificial Bee Colony Algorithm Differential Evolution Levy Flight Search Nature Inspired Computation Opposition Based Learning Spider Monkey Optimization Algorithm Swarm Intelligence |
University: | Jagannath University |
Completed Date: | 27-08-2014 |
Abstract: | The thesis entitled Nature Inspired Computation (NIC):Methods and their application in function optimization is intended to present the state of art Nature Inspired Computing (NIC) techniques and their applications in the field of optimization. Here this concern research focuses on three well known Nature Inspired Algorithms (NIAs). newlineFirstly, it focuses on the Artificial Bee Colony algorithm. Here this thesis suggest some modified hybrids of basic ABC algorithm like, Randomized Memetic ABC (RMABC) by adding two new parameters in Memetic ABC, improved onlooker bee phase in ABC (IoABC), enhanced local search in ABC (EnABC), improved Memetic search in ABC (IMeABC), fitness based position update in ABC (FPABC), Memetic search in FPABC (MFPABC), new local search strategy in ABC (NLSSABC) by introducing a new local search phase on ABC inspired by golden section search and a hybrid of levy flight search and Memetic search strategy in ABC (LFMABC). Secondly this thesis concerns with Differential Evolution (DE) an evolutionary algorithm. This thesis suggests three modifications in basic DE. First, Memetic search inspired by golden section search incorporated in basic DE (MSDE). Second, levy flight search in fitness based DE (LFBDE). Third, opposition based levy flight search in DE (OLFDE). Finally, it focuses on newly developed population based nature inspired algorithm named Spider Monkey Optimization (SMO). This thesis suggests three modifications in basic SMO algorithm.This thesis suggests three modifications in basic SMO algorithm. First, it proposed a modified position update in SMO (MPU-SMO) algorithm by enhancing position update strategy in both local leader phase and global leader phase. Second, a fitness based position update in SMO (FPSMO) and third opposition based learning in SMO (OBSMO) algorithm. In order to establish superiority of proposed algorithms over basic algorithms and their recent variants, they are tested over a set of benchmark functions and some real world optimization problems. |
Pagination: | |
URI: | http://hdl.handle.net/10603/96935 |
Appears in Departments: | Faculty of Engineering and Technology |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
01_title.pdf | Attached File | 267.41 kB | Adobe PDF | View/Open |
02_candidate�s declaration.pdf | 208.27 kB | Adobe PDF | View/Open | |
03_certificate of the supervisor.pdf | 163.21 kB | Adobe PDF | View/Open | |
04_acknowledgments.pdf | 161.32 kB | Adobe PDF | View/Open | |
05_preface.pdf | 277.43 kB | Adobe PDF | View/Open | |
06_table of contents.pdf | 304.2 kB | Adobe PDF | View/Open | |
07_list of figures.pdf | 234.5 kB | Adobe PDF | View/Open | |
08_list of tables.pdf | 235.25 kB | Adobe PDF | View/Open | |
09_list of algorithms.pdf | 245.91 kB | Adobe PDF | View/Open | |
10_list of abbreviations.pdf | 158.48 kB | Adobe PDF | View/Open | |
11_chapter 1.pdf | 401.51 kB | Adobe PDF | View/Open | |
12_chapter 2.pdf | 706.95 kB | Adobe PDF | View/Open | |
13_chapter 3.pdf | 1.7 MB | Adobe PDF | View/Open | |
14_chapter 4.pdf | 860.74 kB | Adobe PDF | View/Open | |
15_chapter 5.pdf | 883.47 kB | Adobe PDF | View/Open | |
16_chapter 6.pdf | 254.41 kB | Adobe PDF | View/Open | |
17_reference.pdf | 462.19 kB | Adobe PDF | View/Open | |
18_appendix.pdf | 451.16 kB | Adobe PDF | View/Open | |
19_list of publication.pdf | 284.66 kB | Adobe PDF | View/Open |
Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).
Altmetric Badge: