A new Algorithm to Solve Multi-Objective Optimization Problem Based on Decomposition Property
Rajwan Hmood1, Iraq T.Abbas1 and H. A. AlSattar2
1Department of Mathematics College of Science University of Baghdad, Baghdad, Iraq
Department of Computing, FSKIK, Universiti Pendidikan Sultan Idris, Tanjong Malim, Malaysia2
*Corresponding author’s e-mail: Iraq.t@sc.uobaghdad.edu.iq
Original: 3 February 2020 Revised: 28 August 2020 Accepted: 26 September 2020 Published online: 20 December 2020
Doi Link:
Abstract
MOBATD is a multi-target bat calculation that fuses the strength idea with the decay approach is proposed as another calculation. While decay improves the multi-target issue (MOP) by changing it as a lot of Tchebycheff Approach, taking care of these issues all the while, inside the BAT structure, may prompt untimely assembly in light of the pioneer determination process which utilizes the Tchebycheff Approach as a model. Predominance assumes a significant job in building the pioneers document permitting the chose pioneers to cover less thick areas staying away from neighborhood optima and bringing about a progressively differing approximated Pareto front. Results from 12 standard MOPs show MOBATD outflanks two cutting edge decay based transformative techniques.
Key Words: Multi-objective problem, Multi-Objective Bat Algorithm, Decomposition Property, Performance Measure
References
[1] P. A. N. Bosman and D. Thierens. "The balance between proximity and diversity in multi- objective evolutionary algorithms". IEEE Transactions on Evolutionary Computation, Vol. 7m No. 2, pp. 174-188. (2003).
[2] M. Laumanns, E. Zitzler, and L. Thiele. "On the e_ects of archiving, elitism, and density based selection in evolutionary multi-objective optimization". In Evolutionary Multi-Criterion Optimization (EMO), pp. 181-196, (2001).
[3] R. C. Purshouse and P. J. Fleming. "On the evolutionary optimization of many connecting objectives". IEEE Transactions on Evolutionary Computation, Vol. 11, No. 6 ,770-784, (2007).
[4] M. Garza-Fabre, G. Toscano-Pulido, C. A. C. Coello, and E. Rodriguez-Tello. Elective ranking + speciation “Many-objective optimization”. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC), pp. 2115- 2122. (2011).
[5] S. F. Adra and P. J. Fleming. "Diversity management in evolutionary many objective optimization". IEEE Transactions on Evolutionary Computation, Vol. 15, No. 2, pp. 183-195. (2011).
[6] C. C. Aggarwal, A. Hinneburg, and D. A. Keim. "On the Surprising Behavior of Distance Metrics in High Dimensional Space". Springer, (2001).
[7] D. W. Corne and J. D. Knowles. "Techniques for highly multi-objective optimization: some non-dominated points are better than others". In Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation (GECCO), pp. 773-780. (2007).
[8] T. Wagner, N. Beume, and B. Naujoks. "Pareto-, aggregation-, and indicator based methods in many-objective optimization". In Evolutionary Multi-Criterion Optimization (EMO), pp. 742-756. (2007).
[9] H. Ishibuchi, N. Tsukamoto, and Y. Nojima. "Evolutionary many-objective optimization: A short review". In Proceedings of the IEEE Congress on Evolutionary Computation (CEC), pp 2419-2426. (2008).
[10] Prakash, R., Lokeshgupta, B., & Sivasubramani, S. "Multi-objective bat algorithm for optimal placement and sizing of DG". In 2018 20th National Power Systems Conference (NPSC). pp. 1-6. IEEE. (2018).
[11] Yang, X. S. "Bat algorithm for multi-objective optimization". arXiv preprint arXiv:1203.6571. (2012)
[12] Laudis, L. L., Shyam, S., Jemila, C., & Suresh, V. MOBA. "Multi Objective Bat Algorithm for Combinatorial Optimization in VLSI". Procedia Computer Science, Vol. 125, pp. 840 - 846. (2018).
[13] Remha, S., Chettih, S., & Arif, S. "A Novel Multi-Objective Bat Algorithm for Optimal Placement and Sizing of Distributed Generation in Radial Distributed systems". Advances in Electrical and Electronic Engineering, Vol. 15, No. 5, pp. 736-746. (2018).
[14] P. Hansen, Bicriterion path problems, in: G. Fandel, T. Gal (Eds.), "Multiple Criteria Decision Making Theory and Application, in: Lecture Notes in Economics and Mathematical Systems", Vol. 177, Springer Verlag, Berlin, pp. 109-127. (1979).
[15] Bhatia, H.L., Malhotra, R., Puri, M.C. "Bi-criteria assignment problem". Oper. Res. Vol. 19, No. 2, pp. 84–96. (1982).
[16] Przybylski A., Gandibleux, X., Ehrgott, M. "Two phase algorithm for the bi-objective Assignment problem". Eur. J. Oper. Res. Vol. 185, No. 2, pp. 509 – 533. (2008).
[17] Ulungu, E.L., Teghem, J. "The two phases method an efficient procedure to solve bi-objective combinatorial optimization problems". Found Computer decision Science Vol. 20, No. 2, pp. 149 – 165. (1994).
[18] Adiche, C., Aïder, M. "New variants of the simulated annealing for solving bi-objective assignment problem". RSTI- RIA. Vol. 22, No. 2, pp. 237– 255. (2008).
[19] Yang, X. S. "Bat algorithm for multi-objective optimization". International Journal of Bio-Inspired Computation, Vol. 3, No. 5, pp. 267-274. (2011).
[20] Thippa Reddy, G., and Khare, N. "FFBAT-optimized rule based fuzzy logic Classifier". (2016).
[21] Reddy, G. T., and Khare, N. "An efficient system for heart disease prediction using hybrid OFBAT with rule-based fuzzy logic model". Journal for diabetes. Paper presented at the International Journal of Engineering Research in Africa. (2017).
[22] Yang X-S. "A new meta-heuristic bat-inspired algorithm. In: Nature inspired cooperative strategies for optimization". Studies in Computational Intelligence. Vol. 284. Springer, Berlin, pp. 65–74. (2010).
[23] Ramli MR, Abas ZA, Desa MI, Abidin, ZZ, Alazzam MB. "Enhanced convergence of Bat Algorithm based on dimensional and inertia weight factor". J. King Saud Univ. Computer Inf. Sci. https://doi.org/10.1016/j.jksuci.2018.03.010. (2018).
[24] Karimi-Nasab M, Ghomi SMTF. "Multi-objective production scheduling with controllable processing times and sequencedependent setups for deteriorating items". Int J Prod Res Vol. 50, No. 24, pp. 7378–7400. (2012).
[25] Ramli MR, Abas ZA, Desa MI, Abidin, ZZ, Alazzam MB. "Enhanced convergence of Bat Algorithm based on dimensional and inertia weight factor". J. King Saud Univ Comput Inf Sci. https://doi.org/10.1016/j.jksuci.2018.03.010 (2018).
[26] H. W. Kuhn and A. W. Tucker. "Nonlinear programming". In the Second Berkeley Symposium on Mathematical Statistics and Probability, pp.481-492. Berkeley, CA, University of California Press., (1951).
[27] Q. Zhang and H. Li. "MOEA/D. A multi-objective evolutionary algorithm based on decomposition". IEEE Transactions on Evolutionary Computation, Vol. 11, No. 6, pp. 712-731, (2007).
[28] E. J. Hughes. "Many-objective directed evolutionary line search". In Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation (GECCO), pp. 761-768. (2011).
[29] K. Deb and H. Jain. "An evolutionary many-objective optimization algorithm using reference-point-based non-dominated sorting approach, part I: Solving problems with box constraints". IEEE Transactions on Evolutionary Computation, Vol. 18, No. 4, pp. 577- 601. (2014).
[30] E. J. Hughes. "Multiple single objective Pareto sampling". In IEEE Congress on Evolutionary Computation (CEC), Vol. 4, pp. 2678-2684. (2003).
[31] E. J. dw. "MSOPS-II: A general-purpose many-objective optimizer". In IEEE Congress on Evolutionary Computation (CEC), pp. 3944-3951. (2007).
[32] I. Giagkiozis, R. C. Purshouse, and P. J. Fleming. "Generalized decomposition and cross entropy methods for many-objective optimization". Information Sciences, Vol. 282, pp. 363-387. (2014).
[33] Q. Zhang, A. Zhou, and Y. Jin. "RM-MEDA: A regularity model-based multi-objective estimation of distribution algorithm". IEEE Transactions on Evolutionary Computation, Vol. 12, No. 1, pp. 41- 63. (2008).
[34] K. Miettinen, "Nonlinear Multi-objective Optimization". Norwell, MA: Kluwer, (1999).
[35] I. Das and J. E. Dennis, "Normal-boundary intersection: A new method for generating Pareto optimal points in multi-criteria optimization problems". SIAM J. Optim., Vol. 8, No. 3, pp. 631–657, (1998).
[36] A. Messac, A. Ismail-Yahaya, and C. Mattson, "The normalized normal constraint method for generating the Pareto frontier", Struct Multidisc. Optim., Vol. 25, pp. 86–98, (2003).
[37] X.-S. Yang, "A new meta-heuristic bat-inspired algorithm, in: Nature Inspired Cooperative Strategies for Optimization" (NISCO 2010), Springer, pp.65–74. 92010).
[38$ Qi, Y., Ma, X., Liu, F., Jiao, L., Sun, J., & Wu, J. "MOEA/D with adaptive weight adjustment". Evolutionary computation, Vol. 22, No. 2, pp. 231-264. (2014).
[39] Coello, C. C., & Lechuga, M. S. "MOPSO: A proposal for multiple objective particle swarm optimization". In Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No. 02TH8600) (Vol. 2, pp. 1051-1056). IEEE. . (2002, May).
[40] Peng G. "Multi-objective particle optimization algorithm based on sharing learning and dynamic crowding distance". Opt Int. J Light Electron Opt. Vol. 127m No. 12, pp. 5013–5020. (2016).
[41] Q. Zhang, A. Zhou, S. Zhao, P. N. Suganthan, W. Liu, and S. Tiwari. "Multi-objective optimization test instances for the CEC 2009 special session and competition". Working Report CES-487, School of CS & EE, University of Essex, (2009).
[42] Erfani T. and Utyuzhnikov S. "Directed search domain: a method for even generation of Pareto frontier in multi-objective optimization". Engineering Optimizatio. Vol. 43, No. 5. (2011).