References
- AkayB., & KarabogaD. (2012). A modified Artificial Bee Colony algorithm for real-parameter optimization. Information Sciences, 192, 120–142. doi:10.1016/j.ins.2010.07.015.
- AliM., KhompatrapornC., & ZabinskyZ. (2005). A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. Journal of Global Optimization, 31, 635–672. doi:10.1007/s10898-004-9972-2.
- BanharnsakunA., AchalakulT., & SirinaovakulB. (2011). The best-so-far selection in Artificial Bee Colony algorithm. Applied Soft Computing, 11, 2888–2901. doi:10.1016/j.asoc.2010.11.025.
- BansalJ. C., SharmaH., AryaK., & NagarA. (2013). Memetic search in artificial bee colony algorithm. Soft Computing, 17, 1911–1928. doi:10.1007/s00500-013-1032-8.
- BansalJ. C., SharmaH., & JadonS. S. (2013). Artificial bee colony algorithm: A survey. International Journal of Advanced Intelligence Paradigms, 5, 123–159. doi:10.1504/IJAIP.2013.054681.
- BansalJ. C., SharmaH., JadonS. S., & ClercM. (2014). Spider monkey optimization algorithm for numerical optimization. Memetic Computing, 6, 31–47. doi:10.1007/s12293-013-0128-0.
- BishopJ. M. (2007). Stochastic diffusion search. Scholarpedia, 2, 3101. doi:10.4249/scholarpedia.3101.
- DeepK., & ThakurM. (2007). A new crossover operator for real coded genetic algorithms. Applied Mathematics and Computation, 188, 895–911. doi:10.1016/j.amc.2006.10.047.
- DiwoldK., AderholdA., ScheidlerA., & MiddendorfM. (2011). Performance evaluation of artificial bee colony optimization and new selection schemes. Memetic Computing, 3, 149–162. doi:10.1007/s12293-011-0065-8.
- DorigoM., & Di CaroG. (1999). Ant colony optimization: A new meta-heuristic. Proceedings of the 1999 congress on evolutionary computation-CEC99 (Cat. No. 99TH8406). 10.1109/cec.1999.782657.
- El-AbdM. (2012). Performance assessment of foraging algorithms vs. evolutionary algorithms. Information Sciences, 182, 243–263. doi:10.1016/j.ins.2011.09.005.
- GardeuxV., ChelouahR., SiarryP., & GloverF. (2009). Unidimensional search for solving continuous high-dimensional optimization problems. 2009 Ninth International Conference on Intelligent Systems Design and Applications. 10.1109/isda.2009.191.
- HookeR., & JeevesT. (1961). ‘ Direct search’ solution of numerical and statistical problems. Journal of the ACM (JACM), 8, 212–229. doi:10.1145/321062.321069.
- KangF., LiJ., MaZ., & LiH. (2011). Artificial Bee Colony Algorithm with Local Search for Numerical Optimization. Journal of Software, 6, 490–497. doi:10.4304/jsw.6.3.490-497.
- KarabogaD. (2005). An idea based on honey bee swarm for numerical optimization. Technical Report TR06 . Erciyes: Erciyes University Press.
- KarabogaD., & AkayB. (2009). A comparative study of artificial bee colony algorithm. Applied Mathematics and Computation, 214, 108–132. doi:10.1016/j.amc.2009.03.090.
- KarabogaD., & AkayB. (2011). A modified artificial bee colony (ABC) algorithm for constrained optimization problems. Applied Soft Computing, 11, 3021–3031. 10.1016/j.asoc.2010.12.001.
- KennedyJ., & EberhartR. (1995). Particle swarm optimization. Proceedings of ICNN'95 – International Conference on Neural Networks. 10.1109/icnn.1995.488968.
- Mezura-MontesE., & Velez-KoeppelR. (2010). Elitist artificial bee colony for constrained real-parameter optimization. In Congress on Evolutionary Computation (CEC’2010) (pp. 2068–2075). Barcelona: IEEE Service Center.
- NeriF., & TirronenV. (2009). Scale factor local search in differential evolution. Memetic Computing, 1, 153–171. doi:10.1007/s12293-009-0008-9.
- OmranM. G. H., & SalmanA. (2012). Probabilistic stochastic diffusion search. Lecture Notes in Computer Science, 300–307. 10.1007/978-3-642-32650-9_31.
- PassinoK. (2002). Biomimicry of bacterial foraging for distributed optimization and control. Control Systems Magazine, 22, 52–67. doi:10.1109/MCS.2002.1004010.
- PriceK., StornR., & LampinenJ. (2005). Differential evolution: A practical approach to global optimization. Springer Verlag.
- SharmaH., JadonS. S., BansalJ. C., & AryaK. V. (2013). Lèvy flight based local search in differential evolution. Swarm, Evolutionary, and Memetic Computing, 248–259.10.1007/978-3-319-03753-0_23.
- SuganthanP., HansenN., LiangJ., DebK., ChenY., AugerA., & TiwariS. (2005). Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. KanGAL Report 2005005.
- VesterstromJ., & ThomsenR. (2004). A comparative study of differential evolution, particle swarm optimization, and evolutionary algorithms on numerical benchmark problems. In Evolutionary Computation, 2004. CEC, 2004. Congress on IEEE (Vol. 2, pp. 1980–1987)
- WangH., WangD., & YangS. (2009). A memetic algorithm with adaptive hill climbing strategy for dynamic optimization problems. Soft Computing – A Fusion of Foundations, Methodologies and Applications, 13, 763–780.
- WilliamsonD., ParkerR., & KendrickJ. (1989). The box plot: A simple visual method to interpret data. Annals of Internal Medicine, 110, 916. doi:10.7326/0003-4819-110-11-916.
- YangX. (2010). Firefly algorithm, Levy flights and global optimization. Research and Development in Intelligent Systems, XXVI, 209–218.
- YangX. (2011). Nature-inspired metaheuristic algorithms. Luniver Press.
- ZhuG., & KwongS. (2010). Gbest-guided artificial bee colony algorithm for numerical function optimization. Applied Mathematics and Computation, 217, 3166–3173. doi:10.1016/j.amc.2010.08.049.