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 SizeFormat 
01_title.pdfAttached File267.41 kBAdobe PDFView/Open
02_candidate�s declaration.pdf208.27 kBAdobe PDFView/Open
03_certificate of the supervisor.pdf163.21 kBAdobe PDFView/Open
04_acknowledgments.pdf161.32 kBAdobe PDFView/Open
05_preface.pdf277.43 kBAdobe PDFView/Open
06_table of contents.pdf304.2 kBAdobe PDFView/Open
07_list of figures.pdf234.5 kBAdobe PDFView/Open
08_list of tables.pdf235.25 kBAdobe PDFView/Open
09_list of algorithms.pdf245.91 kBAdobe PDFView/Open
10_list of abbreviations.pdf158.48 kBAdobe PDFView/Open
11_chapter 1.pdf401.51 kBAdobe PDFView/Open
12_chapter 2.pdf706.95 kBAdobe PDFView/Open
13_chapter 3.pdf1.7 MBAdobe PDFView/Open
14_chapter 4.pdf860.74 kBAdobe PDFView/Open
15_chapter 5.pdf883.47 kBAdobe PDFView/Open
16_chapter 6.pdf254.41 kBAdobe PDFView/Open
17_reference.pdf462.19 kBAdobe PDFView/Open
18_appendix.pdf451.16 kBAdobe PDFView/Open
19_list of publication.pdf284.66 kBAdobe PDFView/Open
Show full item record


Items in Shodhganga are licensed under Creative Commons Licence Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0).

Altmetric Badge: