Abstract
In this paper, an evolutionary algorithm based on bi-goal is proposed for many-objective optimization. We first provide a new proximity estimation, ensuring the convergence of algorithm. Afterwards, a new sharing function with a novel discriminator is employed to improve the diversity. The dominance-based environmental selection is applied in bi-goal space, which is expected to archive a good balance between convergence and diversity. The experimental results show that the proposed method can work well on most instances considered in this study, demonstrating that it is very competitive for solving many-objective optimization problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Asafuddoula, M., Ray, T., Sarker, R.: A decomposition based evolutionary algorithm for many objective optimization. IEEE Trans. Evol. Comput. PP(99), 1 (2014). https://doi.org/10.1109/TEVC.2014.2339823
Bader, J., Zitzler, E.: HypE: an algorithm for fast hypervolume-based many-objective optimization. Evol. Comput. 19(1), 45–76 (2011)
Cai, L., Qu, S., Cheng, G.: Two-archive method for aggregation-based many-objective optimization. Inf. Sci. 422, 305–317 (2018). https://doi.org/10.1016/j.ins.2017.08.078
Cai, L., Qu, S., Yuan, Y., Yao, X.: A clustering-ranking method for many-objective optimization. Appl. Soft Comput. 35, 681–694 (2015). https://doi.org/10.1016/j.asoc.2015.06.020
Das, I., Dennis, J.E.: Normal-boundary intersection: a new method for generating the pareto surface in nonlinear multicriteria optimization problems. SIAM J. Optim. 8(3), 631–657 (1998)
Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part i: solving problems with box constraints. IEEE Trans. Evol. Comput. 18(4), 577–601 (2014). https://doi.org/10.1109/TEVC.2013.2281535
Deb, K., Mohan, M., Mishra, S.: Evaluating the \(\varepsilon \)-domination based multi-objective evolutionary algorithm for a quick computation of pareto-optimal solutions. Evol. Comput. 13(4), 501–525 (2005)
Huband, S., Hingston, P., Barone, L., While, L.: A review of multiobjective test problems and a scalable test problem toolkit. IEEE Trans. Evol. Comput. 10(5), 477–506 (2006). https://doi.org/10.1109/TEVC.2005.861417
Li, M., Yang, S., Liu, X.: Bi-goal evolution for many-objective optimization problems. Artif. Intell. 228, 45–65 (2015). https://doi.org/10.1016/j.artint.2015.06.007
Praditwong, K., Harman, M., Yao, X.: Software module clustering as a multi-objective search problem. IEEE Trans. Softw. Eng. 37(2), 264–282 (2011). https://doi.org/10.1109/TSE.2010.26
While, L., Bradstreet, L., Barone, L.: A fast way of calculating exact hypervolumes. IEEE Trans. Evol. Comput. 16(1), 86–95 (2012)
Yang, S., Li, M., Liu, X., Zheng, J.: A grid-based evolutionary algorithm for many-objective optimization. IEEE Trans. Evol. Comput. 17(5), 721–736 (2013). https://doi.org/10.1109/TEVC.2012.2227145
Yuan, Y., Xu, H.: Multiobjective flexible job shop scheduling using memetic algorithms. IEEE Trans. Autom. Sci. Eng. 12(1), 336–353 (2015). https://doi.org/10.1109/TASE.2013.2274517
Zhang, Q., Li, H.: MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evol. Comput. 11(6), 712–731 (2007). https://doi.org/10.1109/TEVC.2007.892759
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Pan, H., Cai, L. (2019). An Improved Bi-goal Algorithm for Many-Objective Optimization. In: El Rhalibi, A., Pan, Z., Jin, H., Ding, D., Navarro-Newball, A., Wang, Y. (eds) E-Learning and Games. Edutainment 2018. Lecture Notes in Computer Science(), vol 11462. Springer, Cham. https://doi.org/10.1007/978-3-030-23712-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-030-23712-7_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-23711-0
Online ISBN: 978-3-030-23712-7
eBook Packages: Computer ScienceComputer Science (R0)