Cover Image

Seed disperser ant algorithm for optimization / Chang Wen Liang

The Seed Disperser Ant Algorithm (SDAA) is developed based on the evolution or expansion process of Seed Disperser Ant (Aphaenogaster senilis) colony. The genotype of every ant is represented in binary form as the variables. These binary variables are used to locally search for optimum solution. SDA...

Full description

Saved in:
Bibliographic Details
Main Author: Chang , Wen Liang
Format: Thesis
Published: 2018
Subjects:
TA Engineering (General). Civil engineering (General)
Online Access:http://studentsrepo.um.edu.my/9377/1/Chang_Wen_Liang.jpg
http://studentsrepo.um.edu.my/9377/11/wen_liang.pdf
http://studentsrepo.um.edu.my/9377/
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.um.stud.9377
record_format eprints
spelling my.um.stud.93772021-01-20T23:27:21Z Seed disperser ant algorithm for optimization / Chang Wen Liang Chang , Wen Liang TA Engineering (General). Civil engineering (General) The Seed Disperser Ant Algorithm (SDAA) is developed based on the evolution or expansion process of Seed Disperser Ant (Aphaenogaster senilis) colony. The genotype of every ant is represented in binary form as the variables. These binary variables are used to locally search for optimum solution. SDAA is developed using the concept of male ants performing nuptial flights to generate new superior colonies. The new colonies produce better male ants that repeat the nuptial flight cycle in following generation. New young queens are produced by the colony that migrates to establish new colonies after local optimum solution reached to start new local search. Nuptial flight and new young queens’ production aid in enhanced search exploitation and exploration respectively. This diversifies the search for global optimum. The classical benchmark problems and composite benchmark functions from Congress on Evolutionary Computation (CEC) 2005 special session is used for validate SDAA. Engineering optimization has become important in design problems to reduce error and faulty production as many constrained condition should be taken in to account before manufacturing. Also, data clustering has become popular in data mining in recent time due to data explosion. In this research, we applied SDAA to solve the constrained engineering problems and introduce an efficient data clustering algorithm which is hybrid of K-means and SDAA. The optimal results obtained for constrained engineering problems as well as data clustering are very promising in terms of quality of solutions and convergence speed of the algorithm. 2018-07 Thesis NonPeerReviewed application/pdf http://studentsrepo.um.edu.my/9377/1/Chang_Wen_Liang.jpg application/pdf http://studentsrepo.um.edu.my/9377/11/wen_liang.pdf Chang , Wen Liang (2018) Seed disperser ant algorithm for optimization / Chang Wen Liang. Masters thesis, Universiti Malaya. http://studentsrepo.um.edu.my/9377/
institution Universiti Malaya
building UM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Malaya
content_source UM Student Repository
url_provider http://studentsrepo.um.edu.my/
topic TA Engineering (General). Civil engineering (General)
spellingShingle TA Engineering (General). Civil engineering (General)
Chang , Wen Liang
Seed disperser ant algorithm for optimization / Chang Wen Liang
description The Seed Disperser Ant Algorithm (SDAA) is developed based on the evolution or expansion process of Seed Disperser Ant (Aphaenogaster senilis) colony. The genotype of every ant is represented in binary form as the variables. These binary variables are used to locally search for optimum solution. SDAA is developed using the concept of male ants performing nuptial flights to generate new superior colonies. The new colonies produce better male ants that repeat the nuptial flight cycle in following generation. New young queens are produced by the colony that migrates to establish new colonies after local optimum solution reached to start new local search. Nuptial flight and new young queens’ production aid in enhanced search exploitation and exploration respectively. This diversifies the search for global optimum. The classical benchmark problems and composite benchmark functions from Congress on Evolutionary Computation (CEC) 2005 special session is used for validate SDAA. Engineering optimization has become important in design problems to reduce error and faulty production as many constrained condition should be taken in to account before manufacturing. Also, data clustering has become popular in data mining in recent time due to data explosion. In this research, we applied SDAA to solve the constrained engineering problems and introduce an efficient data clustering algorithm which is hybrid of K-means and SDAA. The optimal results obtained for constrained engineering problems as well as data clustering are very promising in terms of quality of solutions and convergence speed of the algorithm.
format Thesis
author Chang , Wen Liang
author_facet Chang , Wen Liang
author_sort Chang , Wen Liang
title Seed disperser ant algorithm for optimization / Chang Wen Liang
title_short Seed disperser ant algorithm for optimization / Chang Wen Liang
title_full Seed disperser ant algorithm for optimization / Chang Wen Liang
title_fullStr Seed disperser ant algorithm for optimization / Chang Wen Liang
title_full_unstemmed Seed disperser ant algorithm for optimization / Chang Wen Liang
title_sort seed disperser ant algorithm for optimization / chang wen liang
publishDate 2018
url http://studentsrepo.um.edu.my/9377/1/Chang_Wen_Liang.jpg
http://studentsrepo.um.edu.my/9377/11/wen_liang.pdf
http://studentsrepo.um.edu.my/9377/
_version_ 1738506258069061632
score 13.211869

Similar Items