The aim of this paper is to produce a new hybrid algorithm to solve minimax problems by combining the bat algorithm with direct search methods. The proposed algorithm is called hybrid bat direct search algorithm (HBATDS). In HBATDS, the global exploration and the local exploitation process are balanced. The bat algorithm has a good ability to make exploration and exploitation search. The exploitation capability of the proposed algorithm is increased by invoking the pattern search method as a local search method instead of the random walk method in the standard bat algorithm. In the final stage of the algorithm, the Nelder-Mead method is applied in order to refine the best found solution from the bat and pattern search method instead of running the algorithm more iterations without any improvements in the fitness function value. The performance of the HBATDS algorithm is investigated by applying it on 10 minimax problems and comparing it against 8 benchmark algorithms. The experimental results indicate that HBATDS is a promising algorithm and outperforms the other algorithms in most cases.
AliA.F. and TawhidM.A., Hybrid-simulated annealing and pattern search method for solving minimax and integer programming problems, Pacific Journal of Optimization12(1) (2016), 151–184.
2.
AliA.F. and TawhidM.A., A hybrid particle swarm optimization and genetic algorithm with population partitioning for large scale optimization problems, Ain Shams Engineering Journal (2016).
3.
AliA.F. and TawhidM.A., Direct gravitational search algorithm for global optimisation problems, East Asian Journal on Applied Mathematics6(3) (2016), 290–313.
4.
AliA.F. and TawhidM.A., A hybrid cuckoo search algorithm with Nelder Mead method for solving global optimization problems, Springer Plus5(1) (2016), 1–22.
5.
BandlerJ.W. and CharalambousC., Nonlinear programming using minimax techniques, Journal of Optimization Theory and Applications13 (1974), 607–619.
6.
Bernabe-LorancaM.B.Ruiz-VanoyeJ.VelazquezR.G.AnalcoM.E.López AnalcoA.S.ZezzatiA.O.GuzmanG.M. and DiazM.B., An approximation method for the P-median problem: A bioinspired tabu search and variable neighborhood search partitioning approach, International Journal of Hybrid Intelligent Systems13(2) (2016), 87–98.
7.
ChuS.A.TsaiP.-W. and PanJ.-S., Cat swarm optimization, Lecture Notes in Computer Science (including sub-series Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 4099 LNAI (2006), 854–858.
8.
DorigoM., Optimization, Learning and Natural Algorithms, Ph.D. Thesis, Politecnico di Milano, Italy, 1992.
9.
HarfouchiF. and HabbiH., A cooperative learning artificial bee colony algorithm with multiple search mechanisms, International Journal of Hybrid Intelligent Systems13(2) (2016), 113–124.
10.
HillierF.S. and LiebermanG.J., Introduction to Operations Research, MCGraw-Hill, 1995.
11.
HollandJ.H., Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, MI, 1975.
12.
HookeR. and JeevesT.A., Direct search solution of numerical and statistical problems, J Assoc Comput Mach (1961), 212–229.
13.
IsabelA.C.P.SantoE. and FernandesE., Heuristics pattern search for bound constrained minimax problems, Computational Science and its Applications, ICCSA6784 (2011), 174–184.
14.
KarabogaD. and BasturkB., A powerful and efficient algorithm for numerical function optimization: Artificial bee colony (ABC) algorithm, Journal of Global Optimization39(3) (2007), 459–471.
15.
KennedyJ. and EberhartR.C., Particle swarm optimization, Proceedings of the IEEE International Conference on Neural Networks4 (1995), 1942–1948.
16.
KomarasamyG. and WahiA., An optimized K-means clustering technique using bat algorithm, European J Scientific Research84(2) (2012), 263–273.
17.
LiX.L.ShaoZ.J. and QianJ.X., Optimizing method based on autonomous animats: Fish-swarm algorithm, System Engineering Theory and Practice22(11) (2002), 32.
18.
LiuzziG.LucidiS. and SciandroneM., A derivative-free algorithm for linearly constrained finite minimax problems, SIAM Journal on Optimization16 (2006), 1054–1075.
19.
LinJ.H.ChouC.W.YangC.H. and TsaiH.L., A chaotic Levy flight bat algorithm for parameter estimation in nonlinear dynamic biological systems, J Computer and Information Technology2(2) (2012), 56–63.
20.
LukanL. and VlcekJ., Test problems for nonsmooth unconstrained and linearly constrained optimization, Technical Report 798, Institute of Computer Science, Academy of Sciences of the Czech Republic, Prague, Czech Republic, 2000.
21.
MirjaliliS.MirjaliliS.M. and LewisA., Grey Wolf Optimizer, Advances in Engineering Software69 (2014), 46–61.
22.
NakamuraR.Y.M.PereiraL.A.M.CostaK.A.RodriguesD.PapaJ.P. and YangX.S., BBA: A binary bat algorithm for feature selection, 25th SIBGRAPI Conference on Graphics, Patterns and Images (SIBGRAPI), IEEE Publication (2012), 291–297.
23.
NelderJ.A. and MeadR., A simplex method for function minimization, Computer Journal7 (1965), 308–313.
24.
ParsopoulosK.E. and VrahatisM.N., Unified particle swarm optimization for tackling operations research problems, In Proceeding of IEEE 2005 Swarm Intelligence Symposium, Pasadena, USA (2005), 53–59.
25.
PassinoM.K., Biomimicry of bacterial foraging for distributed optimization and control, Control Systems, IEEE22(3) (2002), 52–67.
26.
PetalasY.G.ParsopoulosK.E. and VrahatisM.N., Memetic particle swarm optimization, Ann Oper Res156 (2007), 99–127.
27.
PolakE.RoysetJ.O. and WomersleyR.S., Algorithms with adaptive smoothing for finite minimax problems, Journal of Optimization Theory and Applications119 (2003), 459–484.
28.
SchwefelH.P., Evolution and Optimum Seeking, New York, Wiley, 1995.
29.
SopovE., A selection hyper-heuristic with online learning for control of genetic algorithm ensemble, International Journal of Hybrid Intelligent Systems13(2) (2016), 125–135.
30.
TakahamaT. and SakaiS., Improving an adaptive differential evolution using hill-valley detection, International Journal of Hybrid Intelligent Systems13(1) (2016), 1–13.
31.
TangR.FongS.YangX.S. and DebS., Wolf search algorithm with ephemeral memory, In Digital Information Management (ICDIM), 2012 Seventh International Conference on Digital Information Management (2012), 165–172.
32.
TawhidM.A. and AliA.F., Direct Search Firefly Algorithm for Solving Global Optimization Problems, Applied Mathematics & Information Sciences (2016), 841-860.
33.
TawhidM.A. and AliA.F., Simplex particle swarm optimization with arithmetical crossover for solving global optimization problems, OPSEARCH (2016), 1–36.
34.
TawhidM.A. and AliA.F., A simplex social spider algorithm for solving integer programming and minimax problems, Memetic Computing Feb (2016).
35.
TeodorovicD. and DellOrcoM., Bee colony optimization a cooperative learning approach to complex transportation problems, In Advanced OR and AI Methods in Transportation, Proceedings of 16th Mini EURO Conference and 10th Meeting of EWGT (13-16 September 2005). Poznan: Publishing House of the Polish Operational and System Research (2005), 51–60.
36.
WangG. and GuoL., A novel hybrid bat algorithm with harmony search for global numerical optimization, Journal of Applied Mathematics2013 (2013).
37.
XieJ.ZhouY.Q. and ChenH., A novel bat algorithm based on differential operator and Levy flights trajectory, Computational Intelligence and Neuroscience2013 (2013).
38.
XuS., Smoothing method for minimax problems, Computational Optimization and Applications20 (2001), 267–279.
39.
YangX.S., Firefly algorithm, stochastic test functions and design optimization, International Journal of Bio-Inspired Computation2(2) (2010), 78–84.
40.
YangX.S. and DebS., Cuckoo search via Lévy fights, Proc of World Congress on Nature & Biologically Inspired Computing (NaBIC 2009), December 2009, India? IEEE Publications, USA (2009), 210–214.
41.
YangX.S., A new metaheuristic bat-inspired algorithm, Nature Inspired Cooperative Strategies for Optimization (NICSO 2010) (2010), 65–74.
42.
YangX.S., Bat algorithm for multi-objective optimization, Int J BioInspired Computation3(5) (2011), 267–274.
43.
ZhangJ.W. and WangG.G., Image matching using a bat algorithm with mutation, Applied Mechanics and Materials (Edited by DuZ.Y. and LiuB.) 203(1) (2012), 88–93.
