A new ABC-based multiobjective optimization algorithm with an improvement approach (IBMO: improved bee colony algorithm for multiobjective optimization)

A new ABC-based multiobjective optimization algorithm with an improvement approach (IBMO: improved bee colony algorithm for multiobjective optimization)

This paper presents a new metaheuristic algorithm based on the artificial bee colony (ABC) algorithm for multiobjective optimization problems. The proposed hybrid algorithm, an improved bee colony algorithm for multiobjective optimization called IBMO, combines the main ideas of the simple ABC with nondominated sorting strategy corresponding to the principal framework of multiobjective optimization such as Pareto-dominance and crowding distance. A fixed-sized external archive to store the nondominated solutions and an improvement procedure to promote the convergence to true Pareto front are used. The presented approach, IBMO, is compared with four representatives of the state-of-the-art algorithms: NSGA2, SPEA2, OMOPSO, and AbYSS. IBMO and the selected algorithms from specialized literature are applied to several multiobjective benchmark functions by considering the number of function evaluations. Then four quality indicators are employed for performance evaluations: general distance, spread, maximum spread, and hypervolume. The results show that the IBMO is superior to the other methods.

___

  • [1] Osyczka A. Evolutionary Algorithms for Single and Multicriteria Design Optimization. New York, NY, USA: Physica Verlag, 2002.
  • [2] Deb K. Multi-Objective Optimization Using Evolutionary Algorithms: An Introduction. KanGAL Report Number 2011003, 2011.
  • [3] Sa˘g T, C¸ unka¸s M. A tool for multiobjective evolutionary algorithms. Adv Eng Softw 2009; 40: 902-912.
  • [4] Yahia H, Liouane N, Dhifaoui R. Multiobjective differential evolution-based performance optimization for switched reluctance motor drives. Turk J Elec Eng & Comp Sci 2013; 21: 1061-1076.
  • [5] Koodalsamy C, Simon S. Fuzzified artificial bee colony algorithm for nonsmooth and nonconvex multiobjective economic dispatch problem. Turk J Elec Eng & Comp Sci 2013; 21: 1995-2014.
  • [6] Schaffer JD. Multiple objective optimization with vector evaluated genetic algorithms. In: 1st International Conference on Genetic Algorithms 1985; pp. 93-100.
  • [7] Zhoua A, Qub B, Lic H, Zhaob S, Suganthanb PN, Zhangd Q. Multiobjective evolutionary algorithms: a survey of the state of the art. Swarm and Evolutionary Computation 2011; 1: 32-49.
  • [8] Coello Coello CA, Lamont GB (eds). Applications of Multi-Objective Evolutionary Algorithms. Singapore: World Scientific, 2004.
  • [9] Horn J, Nafpliotis N, Goldberg DE. A niched Pareto genetic algorithm for multiobjective optimization. In: Proc 1. IEEE Conf Evol Comp, 1994; vol. 1, pp. 82-87.
  • [10] Srinivas N, Deb K. Multiobjective function optimization using nondominated sorting genetic algorithms. IEEE T Evolut Comput 1995; 2: 221-248.
  • [11] Deb K, Agrawal S, Pratap A, Meyarivan T. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE T Evolut Comput 2002; 6: 182-197.
  • [12] Knowles JD, Corne DW. Approximating the nondominated front using the Pareto archived evolution strategy. IEEE T Evolut Comput 2000; 8: 149-172.
  • [13] Zitzler E, Thiele L. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE T Evolut Comput 1999; 3: 257-271.
  • [14] Zitzler E, Laumanns M, Thiele L. SPEA2: improving the strength Pareto evolutionary algorithm. Comput Eng Networks Lab, Swiss Fed Inst Technol, Zurich, Switzerland, Tech Rep 103, 2001.
  • [15] Kennedy J, Eberhart R. Particle swarm optimization. In: Fourth IEEE International Conference on Neural Networks 1995; pp: 1942-1948.
  • [16] Dorigo M, St¨utzle T. Ant Colony Optimization. Cambridge, MA, USA: MIT Press, 2004.
  • [17] Karaboga D. An idea based on honey bee swarm for numerical optimization, Erciyes University, Engineering Faculty, Computer Eng Department, Technical Report, 2005.
  • [18] Angus D. Crowding population-based ant colony optimization for the multi-objective travelling salesman problem. In: IEEE Symposium on Computational Intelligence in Multicriteria Decision Making, MCDM 2007, 2007, pp. 333-340.
  • [19] Chitty DM, Hernandez ML. A hybrid ant colony optimization technique for dynamic vehicle routing. In: Conference on Genetic and Evolutionary Computation, GECCO 2004. In: LNCS, vol. 3102, 2004, pp. 48-59.
  • [20] Pasia JM, Hartl RF, Doerner KF. Solving a bi-objective flowshop scheduling problem by Pareto-ant colony optimization. In: 5th International Workshop on Ant Colony Optimization and Swarm Intelligence, ANTS 2006, 2006, pp. 294-305.
  • [21] Doerner K, Gutjahr WJ, Hartl RF, Strauss C, Stummer C. Pareto ant colony optimization: a metaheuristic approach to multiobjective portfolio selection. Ann Oper Res 2004; 31: 77-79.
  • [22] Reyes MS, Coello C. Multi-objective particle swarm optimizers: a survey of the state-of-the-art. Int J Comput Int Res 2006; 2: 287-308.
  • [23] Moore J, Chapman R. Application of particle swarm to multiobjective optimization. Technical report, Department of Computer Science and Software Engineering, Auburn University, 1999.
  • [24] Li X. A non-dominated sorting particle swarm optimizer for multiobjective optimization. Lect Notes Comput Sc 2003; 2723: 37-48.
  • [25] Sierra MS, Coello CA. Improving PSO-Based Multi-objective Optimization Using Crowding, Mutation and oDominance. In: Evolutionary Multi-Criterion Optimization (EMO 2005); LNCS 3410, pp: 505-519.
  • [26] Durillo JJ, Nieto JG, Nebro AJ, Coello CA, Luna F, Alba E. Multi-objective particle swarm optimizers: an experimental comparison. In: 5th International Conference on Evolutionary Multi-Criterion Optimization 2009; vol: 5467, pp. 495-509.
  • [27] Nebro AJ, Durillo JJ, Nieto G, Coello CC, Luna F, Alba E. SMPSO: a new PSO-based metaheuristic for multiobjective optimization. In: IEEE Symposium on Computational Intelligence in Multicriteria Decision-Making 2009; 1: 66-73.
  • [28] Molina J, Laguna M, Mart´ı R, Caballero R. SSPMO: A scatter tabu search procedure for non-linear multiobjective optimization. Informs J Comp 2007; 19: 91-100.
  • [29] Nebro AJ, Luna F, Alba E, Dorronsoro B, Durillo JJ, Beham A. AbYSS: adapting scatter search to multiobjective optimization. IEEE T Evol Comput 2008; 12: 439-457.
  • [30] Tang L, Wang X. A hybrid multiobjective evolutionary algorithm for multiobjective optimization problems. IEEE T Evolut Comput 2013; 17: 20-45.
  • [31] Basturk B, Karaboga D. An Artificial Bee Colony (ABC) algorithm for numeric function optimization. In: IEEE International Conference on Neural Networks. IEEE Swarm Intelligence Symposium May 2006; Indianapolis, Indiana, USA.
  • [32] Karaboga D, Basturk B. A powerful and efficient algorithm for numerical function optimization: artificial bee colony algorithm. J Global Optim 2007; 39: 459-471.
  • [33] Omkar SN, Senthilnath J, Khandelwal R, Narayana NG, Gopalakrishnan S. Artificial Bee Colony (ABC) for multiobjective design optimization of composite structures. Appl Soft Comput 2011; 11: 489-499.
  • [34] Hedayatzadeh R, Hasanizadeh B, Akbari R, Ziarati K. A multi-objective artificial bee colony for optimizing multiobjective problems. In: 3rd International Conference on Advanced Computer Theory and Engineering (ICACTE) Aug 2010; Chengdu, China, pp. 277-281.
  • [35] Zou W, Zhu Y, Chen H, Zhang B. Solving multiobjective optimization problems using artificial bee colony algorithm. Discrete Dyn Nat Soc 2011; 1-37.
  • [36] Zhang H, Zhu Y, Yan X. Multi-hive artificial bee colony algorithm for constrained multi-objective optimization. In: IEEE Congress on Evolutionary Computation 2012; pp: 1-8.
  • [37] Largo RA, Gonzalez-Alvarez DL, Vega-Rodriguez MA, Gomez-Pulido JA, Sanchez-Perez JM. In: CINTI2012 13th IEEE International Symposium on Computational Intelligence and Informatics; 20– 22 November 2012, Budapest, Hungary.
  • [38] R´ıos MA, Vega-Rodr´ıguez MA, Castrillo FP. Meta-schedulers for grid computing based on multi-objective swarm algorithms. Appl Soft Comp 2013; 13: 1567-1582.
  • [39] Glover F, Laguna M, Mart´ı R. Scatter search. In: Ghosh A, Tsutsui S, editors. Advances in Evolutionary Computing: Theory and Applications. Berlin, Germany: Springer-Verlag, 2003; pp. 519-537.
  • [40] Fonseca C, Flemming P. Multiobjective optimization and multiple constraint handling with evolutionary algorithms - part II: Application example. IEEE T Syst Man Cyb 1998; 28: 38-47.
  • [41] Kursawe F. A variant of evolution strategies for vector optimization. In: Schwefel H, Manner R, editors. Parallel Problem Solving for Nature, Berlin, Germany: Springer-Verlag, 1990; pp. 193-197.
  • [42] Zitzler E, Deb K, Thiele L. Comparison of multiobjective evolutionary algorithms: empirical results. IEEE T Evolut Comput 2000; 8: 173-195.
  • [43] Osyczka A, Kundo S. A new method to solve generalized multicriteria optimization problems using a simple genetic algorithm. Struct Optimization 1995; 10: 94-99.
  • [44] Kurpati A, Azarm S, Wu J. Constraint handling improvements for multi-objective genetic algorithms. Struct Multidiscip O 2002; 23: 204-213.
  • [45] Tanaka M, Watanabe H, Furukawa Y, Tanino T. GA-based decision support system for multicriteria optimization. In: IEEE International Conference on Systems, Man, and Cybernetics 1995; vol. 2, pp. 1556-1561.
  • [46] Binh TT, Ulrich K. Multiobjective evolution strategy with linear and nonlinear constraints. In: 15th IMACS World Congr Sci Comp Modeling Appl Math, 1997, pp. 357-362.
  • [47] Deb K, Thiele L, Laumanns M, Zitzler E. Scalable Test Problems for Evolutionary Multi-Objective Optimization. Kanpur, India: Kanpur Genetic Algorithms Lab. (KanGAL), Indian Inst Technol 2001; KanGAL Report 2 001 001. [48] Viennet R, Fontiex C, Marc I. Multicriteria optimization using a genetic algorithm for determining a Pareto set. J Syst Sci 1996; 27: 255-260.
  • [49] Tamaki H, Kita H, Kobayashi S. Multiobjective optimization by genetic algorithms: A review. In: 3rd IEEE Conf Evol Comput May 1996; pp. 517-522.
  • [50] Zitzler E, Thiele L, Laumanns M, Fonseca CM, Fonseca VG. Performance assessment of multiobjective optimizers: an analysis and review. IEEE T Evolut Comput 2003; 7: 117-132.
  • [51] Rendon MV, Uresti-charre E. A non-generational genetic algorithm for multiobjective optimization. In: Seventh International Conference on Genetic Algorithms 1997; pp. 658-665.
  • [52] Tsou CS, Fang HH, Chang HH, Kao CH. An improved particle swarm Pareto optimizer with local search and clustering. In: SEAL: 6th Int Conf Simul Evol Learning, 2006; vol. LNCS 4247, pp. 400-407.
  • [53] Zitzler E, Thiele L. Multiobjective optimization using evolutionary algorithms—a comparative case study. In: the 5th International Conference on Parallel Problem Solving from Nature –PPSN V, vol: 1498 of Lecture Notes in Computer Science 1998; pp: 292-301. Springer, Berlin.
Turkish Journal of Electrical Engineering and Computer Sciences-Cover
  • ISSN: 1300-0632
  • Yayın Aralığı: Yılda 6 Sayı
  • Yayıncı: TÜBİTAK