Skip to content
2000
  1. Home
  2. A-Z Publications
  3. The Chinese Journal of Artificial Intelligence
  4. Volume 1, Issue 1
  5. Article
Volume 1, Issue 1
  • ISSN: 2666-7827
  • E-ISSN: 2666-7835

Abstract

The main goal of this paper is to address the issues of low-quality offspring solutions generated by traditional evolutionary operators, as well as the evolutionary algorithm's inability to solve multi-objective optimization problems (MOPs) with complicated Pareto fronts (PFs).

For some complicated multi-objective optimization problems, the effect of the multi-objective evolutionary algorithm based on decomposition (MOEA/D) is poor. For specific complicated problems, there is less research on how to improve the performance of the algorithm by setting and adjusting the direction vector in the decomposition-based evolutionary algorithm. Considering that in the existing algorithms, the optimal solutions are selected according to the selection strategy in the selection stage, without considering whether it could produce the better solutions in the stage of individual generation to achieve the optimization effect faster. As a result, a multi-objective evolutionary algorithm based on two reference points decomposition and historical information prediction is proposed.

In order to verify the feasibility of the proposed strategy, the F-series test function with complicated PFs is used as the test function to simulate the proposed strategy.

Firstly, the evolutionary operator based on historical information prediction (EHIP) is used to generate better offspring solutions to improve the convergence of the algorithm; secondly, the decomposition strategy based on ideal point and nadir point is used to select solutions to solve the MOPs with complicated PFs, and the decomposition method with augmentation term is used to improve the population diversity when selecting solutions according to the nadir point. Finally, the proposed algorithm is compared to several popular algorithms by the F-series test function, and the comparison is made according to the corresponding performance metrics.

The performance of the algorithm is improved obviously compared with the popular algorithms after using the EHIP. When the decomposition method with augmentation term is added, the performance of the proposed algorithm is better than the algorithm with only the EHIP on the whole, but the overall performance is better than the popular algorithms.

The experimental results show that the overall performance of the proposed algorithm is superior to the popular algorithms. The EHIP can produce better quality offspring solutions, and the decomposition strategy based on two reference points can well solve the MOPs with complicated PFs. This paper mainly demonstrates the theory without testing the practical problems. The following research mainly focuses on the application of the proposed algorithm to practical problems such as robot path planning.

© 2022 Bentham Science Publishers
Loading

Article metrics loading...

/content/journals/cjai/10.2174/2666782701666210806100730
2022-04-01
2024-11-22

  • From This Site

    /content/journals/cjai/10.2174/2666782701666210806100730
    dcterms_title,dcterms_subject,pub_keyword
    -contentType:Contributor -contentType:Concept -contentType:Institution
    10
    5
Loading full text...

Full text loading...

References

  1. ZhangQ. LiH. MOEA/D: A multi-objective evolutionary algorithm based on decomposition.IEEE Trans. Evol. Comput.200711671273110.1109/TEVC.2007.892759
     [Google Scholar]
  2. ColletteY. SiarryP. Multi-objective optimization.Springer Berlin Heidelberg2004273316
     [Google Scholar]
  3. JiangS. YangS. An improved multi-objective optimization evolutionary algorithm based on decomposition for complex pareto fronts.IEEE Trans. Cybern.201646242143710.1109/TCYB.2015.240313125781972
     [Google Scholar]
  4. MaX. YuY. LiX. QiY. ZhuZ. A survey of weight vector adjustment methods for decomposition based multi-objective evolutionary algorithms.IEEE Trans. Evol. Comput.2020244634649
     [Google Scholar]
  5. CaiX. MeiZ. FanZ. A decomposition-based many-objective evolutionary algorithm with two types of adjustments for direction vectors.IEEE Trans. Cybern.20184882335234810.1109/TCYB.2017.273755428858821
     [Google Scholar]
  6. QiY. MaX. LiuF. JiaoL. SunJ. WuJ. MOEA/D with adaptive weight adjustment.Evol. Comput.201422223126410.1162/EVCO_a_0010923777254
     [Google Scholar]
  7. WangZ. ZhangQ. LiH. IshibuchiH. JiaoL. On the use of two reference points in decomposition based multi-objective evolutionary algorithms.Swarm Evol. Comput.2017348910210.1016/j.swevo.2017.01.002
     [Google Scholar]
  8. Ho-HuuV. HartjesS. VisserH.G. An improved MOEA/D algorithm for bi-objective optimization problems with complex Pareto fronts and its application to structural optimization.Exp. Sys. App.201892543044610.1016/j.eswa.2017.09.051
     [Google Scholar]
  9. JainH. DebK. An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, Part II: Handling constraints and extending to an adaptive approach.IEEE Trans. Evol. Comput.201418460262210.1109/TEVC.2013.2281534
     [Google Scholar]
  10. BiX. WangC. An improved NSGA-III algorithm based on elimination operator for many-objective optimization.Memetic Comp.20179436138310.1007/s12293‑017‑0240‑7
     [Google Scholar]
  11. WuM. LiK. KwongS. Evolutionary many-objective optimization based on adversarial decomposition.IEEE Trans. Cybern.2020502753764
     [Google Scholar]
  12. LiangZ. HuK. MaX. A many-objective evolutionary algorithm based on a two-round selection strategy.IEEE Trans. Cybern.20215131417142910.1109/TCYB.2019.2918087
     [Google Scholar]
  13. ZhangQ. YangS. JiangS. Novel prediction strategies for dynamic multi-objective optimization.IEEE Trans. Evol. Comput.202024226027410.1109/TEVC.2019.2922834
     [Google Scholar]
  14. WangC. YenG.G. JiangM. A grey prediction-based evolutionary algorithm for dynamic multi-objective optimization.Swarm Evol. Comput.20205610069510.1016/j.swevo.2020.100695
     [Google Scholar]
  15. RongM. GongD. PedryczW. WangL. A multimodel prediction method for dynamic multiobjective evolutionary optimization.IEEE Trans. Evol. Comput.2020242290304
     [Google Scholar]
  16. JiaZ.H. GaoL.Y. ZhangX.Y. A new history-guided multi-objective evolutionary algorithm based on decomposition for batching scheduling.Exp. Sys. App.2020141112920.1-112920.17.10.1016/j.eswa.2019.112920
     [Google Scholar]
  17. LiC.Z. LiW.M. Evolutionary many objective optimization based on bidirectional decomposition.J. Syst. Eng. Electron.201930231932610.21629/JSEE.2019.02.11
     [Google Scholar]
  18. ChengR. JinY.C. Markus, Olhofer A reference vector guided evolutionary algorithm for many-objective optimization.IEEE Trans. Evol. Comput.2016205773791
     [Google Scholar]
  19. DebK. PratapA. AgarwalS. A fast and elitist multi-objective genetic algorithm: NSGA-II.IEEE Trans. Evol. Comput.20026218219710.1109/4235.996017
     [Google Scholar]
  20. GiagkiozisI. FlemingP.J. Methods for multi-objective optimization: An analysis.Inf. Sci.201529333835010.1016/j.ins.2014.08.071
     [Google Scholar]
  21. DasI. DennisJ.E. Normal-Boundary Intersection: A new method for generating the Pareto surface in nonlinear multi-criteria optimization problems.SIAM J. Optim.19988363165710.1137/S1052623496307510
     [Google Scholar]
  22. DingJ.L. YangC. ChenL.P. Dynamic multi-objective optimization algorithm based on reference point prediction.Acta Automatica Sinica2017432313320
     [Google Scholar]
  23. Quintero SantanV.L. Coello CoelloA.C. An algorithm based on differential evolution for multi-objective problems.Intern. J. Computat. Intell. Res.200515415116910.5019/j.ijcir.2005.32
     [Google Scholar]
  24. LiuH.L. GuF. ZhangQ. Decomposition of a multi-objective optimization problem into a number of simple multi-objective subproblems.IEEE Trans. Evol. Comput.201418345045510.1109/TEVC.2013.2281533
     [Google Scholar]
  25. YuanY. Multi-objective evolutionary algorithm based on decomposition and its application.BeijingTsinghua University20153061
     [Google Scholar]
  26. GuF. LiuL.H. TanC.K. A multi-objective evolutionary algorithm using dynamic weight design method.Intern. J. Innov. Comput. Inform. Control Ijicic201285B36773688
     [Google Scholar]
  27. LI H.; Zhang, Q. Multi-objective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II.IEEE Trans. Evol. Comput.200913228430210.1109/TEVC.2008.925798
     [Google Scholar]
  28. LiE. LiK. Decomposition multi-objective evolutionary algorithm based on minimum distance and aggregation strategy.Jisuanji Yingyong202141012228
     [Google Scholar]
  29. VeldhuizenD.A.V. LamontG.B. In: On Measuring Multi- Objective Evolutionary Algorithm Performance, Proceedings of the 2000 Congress on Evolutionary Computation, La Jolla: CA, USA July 16-19, 2000; IEEE, 2002; pp. 204-211.10.1109/CEC.2000.870296
  30. DebK. JainS. Running performance metrics for evolutionary multi-objective optimization.KanGAL Report20022002004
     [Google Scholar]
  31. BosmanP A N. ThierensD. The balance between proximity and diversity in multi-objective evolutionary algorithms.IEEE Trans. Evol. Comput.20037217418810.1109/TEVC.2003.810761
     [Google Scholar]
  32. ZitzlerE. ThieleL. Multi-objective evolutionary algorithms: A comparative case study and the strength Pareto approach.IEEE Trans. Evol. Comput.19993425727110.1109/4235.797969
     [Google Scholar]
/content/journals/cjai/10.2174/2666782701666210806100730
Loading
Multi-objective Evolutionary Algorithm based on Two Reference Points Decomposition and Historical Information Prediction
Chin J Arti Intel 1, E060821195348 (2022); https://doi.org/10.2174/2666782701666210806100730
/content/journals/cjai/10.2174/2666782701666210806100730
/content/journals/cjai/10.2174/2666782701666210806100730
Loading

Data & Media loading...


  • Article Type:     Research Article
Keyword(s): complicated Pareto front; decomposition; evolutionary algorithm; Multi-objective optimization; prediction; two reference points

Most Cited Most Cited RSS feed

This is a required field
Please enter a valid email address
Approval was a Success
Invalid data
An Error Occurred
Approval was partially successful, following selected items could not be processed due to error
Please enter a valid_number test