An improvement in fruit fly optimization algorithm by using sign parameters
- 296 Downloads
The fruit fly optimization algorithm (FOA) has been developed by inspiring osphresis and vision behaviors of the fruit flies to solve continuous optimization problems. As many researchers know that FOA has some shortcomings, this study presents an improved version of FOA to remove with these shortcomings in order to improve its optimization performance. According to the basic version of FOA, the candidate solutions could not take values those are negative as well as stated in many studies in the literature. In this study, two sign parameters are added into the original FOA to consider not only the positive side of the search space, but also the whole. To experimentally validate the proposed approach, namely signed FOA, SFOA for short, 21 well-known benchmark problems are considered. In order to demonstrate the effectiveness and success of the proposed method, the results of the proposed approach are compared with the results of the original FOA, results of the two different state-of-art versions of particle swarm optimization algorithm, results of the cuckoo search optimization algorithm and results of the firefly optimization algorithm. By analyzing experimental results, it can be said that the proposed approach achieves more successful results on many benchmark problems than the compared methods, and SFOA is presented as more equal and fairer in terms of screening the solution space.
KeywordsSwarm intelligence Continuous optimization Signed fruit fly optimization algorithm Benchmark function
The authors wish to thank the Scientific Project Coordinatorship at Selcuk University and the Scientific and Technological Research Council of Turkey for their institutional supports
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
Informed consent was obtained from all authors included in the study. This manuscript does not contain any studies with human participants or animals performed by any of the authors.
- Andziulis A, Dzemydiene D, Steponavicius R, Jakovlev S (2011) Comparison of two heuristic approaches for solving the production scheduling problem. Inf Technol Control 40(2):118–122Google Scholar
- Karaboğa D (2005) An idea based on honey bee swarm for numerical optimization. Technical Report-TR06. http://mf.erciyes.edu.tr/abc/pub/tr06_2005.pdf. Accessed 10 Jul 2016
- Kennedy J, Eberhart R (1995) Particle swarm optimization. In: 1995 IEEE international conference on neural networks proceedings, vol 1–6, pp 1942–1948. doi: 10.1109/Icnn.1995.488968
- Marinakis Y, Marinaki M, Migdalas A (2016) A hybrid discrete artificial bee colony algorithm for the multicast routing problem. In: Squillero G, Burelli P (eds) Applications of evolutionary computation: 19th European conference, EvoApplications 2016, Porto, Portugal, March 30–April 1, 2016, Proceedings, Part I. Springer, Cham, pp 203–218CrossRefGoogle Scholar
- Omran M (2007) SPSO 2007 Matlab. Retrieved from http://www.particleswarm.info/Programs.html
- Palit S, Sinha SN, Molla MA, Khanra A, Kule M (2011). A cryptanalytic attack on the knapsack cryptosystem using binary Firefly algorithm. Paper presented at the 2011 2nd international conference on computer and communication technology (ICCCT-2011)Google Scholar
- Vastrakar NK, Padhy PK (2013) Simplified PSO PI-PD controller for unstable processes. In: Fourth international conference on intelligent systems, modelling and simulation (ISMS 2013), pp 350-354. doi: 10.1109/Isms.2013.133
- Yang XS, Deb S (2009) Cuckoo search via Levey flights. In: 2009 World congress on nature and biologically inspired computing (NaBIC 2009), pp 210–214. doi: 10.1109/Nabic.2009.5393690