Abstract
Multi-objective optimization is one of the most important problem in the mathematical optimization. Some researchers have already proposed several multi-objective fireworks algorithms, of which S-metric based multi-objective fireworks algorithm (S-MOFWA) is the most representative work. S-MOFWA takes the hypervolume as the evaluation criterion of external archive updating, which is easy to implement but ignores the landscape information of the population. In this paper, a novel multi-objective fireworks algorithm named non-dominated sorting based fireworks algorithm (NSFWA) is proposed. The proposed algorithm updates the external archive with the selection operator based on the fast non-dominated sorting approach, which is specially designed for the spark generation characteristic of FWA to improve the diversity. A multi-objective guided mutation operator is also designed to enhance the efficiency of population information utilization and improve the search capability of the algorithm. Experimental results on the benchmarks demonstrate that NSFWA outperforms other multi-objective swarm intelligence algorithms of S-MOFWA, NSGA-II and SPEA2.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Beume, N., Naujoks, B., Emmerich, M.: SMS-EMOA: multiobjective selection based on dominated hypervolume. Eur. J. Oper. Res. 181(3), 1653–1669 (2007)
Chen, M., Tan, Y.: Exponentially decaying explosion in fireworks algorithm. In: 2021 IEEE Congress on Evolutionary Computation (CEC), pp. 1406–1413 (2021). https://doi.org/10.1109/CEC45853.2021.9504974
Cheng, R., **, Y., Olhofer, M., Sendhoff, B.: A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Trans. Evolut. Computat. 20(5), 773–791 (2016)
Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In: Schoenauer, M., et al. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849–858. Springer, Heidelberg (2000). https://doi.org/10.1007/3-540-45356-3_83
Jazzbin, e.: geatpy: The genetic and evolutionary algorithm toolbox with high performance in python (2020)
Kern, S., Müller, S.D., Hansen, N., Büche, D., Ocenasek, J., Koumoutsakos, P.: Learning probability distributions in continuous evolutionary algorithms - a comparative review. Nat. Comput. 3(3), 355–356 (2004)
Li, J., Tan, Y.: Loser-out tournament-based fireworks algorithm for multimodal function optimization. IEEE Trans. Evol. Comput. 22(5), 679–691 (2018)
Li, J., Zheng, S., Tan, Y.: Adaptive fireworks algorithm. In: 2014 IEEE Congress on evolutionary computation (CEC), pp. 3214–3221. IEEE (2014)
Li, J., Zheng, S., Tan, Y.: The effect of information utilization: introducing a novel guiding spark in the fireworks algorithm. IEEE Trans. Evol. Comput. 21(1), 153–166 (2017)
Li, Y., Tan, Y.: Multi-scale collaborative fireworks algorithm. In: 2020 IEEE Congress on Evolutionary Computation (CEC), pp. 1–8. IEEE (2020)
Li, Y., Tan, Y.: Enhancing fireworks algorithm in local adaptation and global collaboration. In: Tan, Y., Shi, Y. (eds.) ICSI 2021. LNCS, vol. 12689, pp. 451–465. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-78743-1_41
Liu, L., Zheng, S., Tan, Y.: S-metric based multi-objective fireworks algorithm. In: 2015 IEEE Congress on Evolutionary Computation (CEC), pp. 1257–1264 (2015)
Schumer, M., Steiglitz, K.: Adaptive step size random search. IEEE Trans. Autom. Control 13(3), 270–276 (1968). https://doi.org/10.1109/TAC.1968.1098903
Tan, Y., Zhu, Y.: Fireworks algorithm for optimization. In: Tan, Y., Shi, Y., Tan, K.C. (eds.) ICSI 2010. LNCS, vol. 6145, pp. 355–364. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-13495-1_44
Van Veldhuizen, D.A., Lamont, G.B., et al.: Evolutionary computation and convergence to a pareto front. In: Late Breaking Papers at the Genetic Programming 1998 Conference, pp. 221–228. Citeseer (1998)
Van Veldhuizen, D.A.: Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. Air Force Institute of Technology (1999)
Zheng, S., Janecek, A., Li, J., Tan, Y.: Dynamic search in fireworks algorithm. In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2014, Bei**g, China, 6–11 July 2014, pp. 3222–3229. IEEE (2014). https://doi.org/10.1109/CEC.2014.6900485, https://doi.org/10.1109/CEC.2014.6900485
Zheng, S., Janecek, A., Tan, Y.: Enhanced fireworks algorithm. In: 2013 IEEE Congress on Evolutionary Computation, pp. 2069–2077. IEEE (2013)
Zitzler, E., Deb, K., Thiele, L.: Comparison of multiobjective evolutionary algorithms: empirical results. Evol. Comput. 8(2), 173–195 (2000)
Zitzler, E., Laumanns, M., Thiele, L.: SPEA 2: improving the strength pareto evolutionary algorithm. TIK-report 103 (2001)
Acknowledgments
This work is supported by the National Natural Science Foundation of China (Grant No. 62076010), and partially supported by Science and Technology Innovation 2030 - “New Generation Artificial Intelligence” Major Project (Grant Nos.: 2018AAA0102301 and 2018AAA0100302).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Li, M., Tan, Y. (2022). Non-dominated Sorting Based Fireworks Algorithm for Multi-objective Optimization. In: Tan, Y., Shi, Y., Niu, B. (eds) Advances in Swarm Intelligence. ICSI 2022. Lecture Notes in Computer Science, vol 13344. Springer, Cham. https://doi.org/10.1007/978-3-031-09677-8_38
Download citation
DOI: https://doi.org/10.1007/978-3-031-09677-8_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-09676-1
Online ISBN: 978-3-031-09677-8
eBook Packages: Computer ScienceComputer Science (R0)