Department of Computer Science, Federal University of Uberlandia, Uberlandia, Brazil"/>
Search
  • All Journals
Advanced Search
Search articles by Title, Author, Keywords, DOI
Submit Manuscript
7.7CiteScore
2.0Impact Factor
Advanced Search
MAP  >  The Knowledge Engineering Review
2024 Volume 39
Article Contents
Next Previous
RESEARCH ARTICLE   Open Access    

D-MEANDS-MD: an improved evolutionary algorithm with memory and diversity strategies applied to a discrete, dynamic, and many-objective optimization problem

  • Department of Computer Science, Federal University of Uberlandia, Uberlandia, Brazil

More Information
  • Corresponding author: Corresponding author: Thiago fialho de Queiroz Lafetá; Email: fialhot@gmail.com 
  • Abstract: Several real-world optimization problems are dynamic and involve a number of objectives. Different researches using evolutionary algorithms focus on these characteristics, but few works investigate problems that are both dynamic and many-objective. Although widely investigated in formulations with multiple objectives, the evolutionary approaches are still challenged by the dynamic multiobjective optimization problems defining a relevant research topic. Some models have been proposed specifically to attack them as the well-known DNSGA-II and MS-MOEA algorithms, which have been extensively investigated on formulations with two or three objectives. Recently, the D-MEANDS algorithm was proposed for dynamic many-objective problems (DMaOPs). In a previous work, D-MEANDS was confronted to DNSGA-II and MS-MOEA solving dynamic many-objective scenarios of the knapsack problem: up to six objectives with five changes or four objectives with ten changes. In this work, we evaluate the behavior of such algorithms in instances up to eight objectives and twenty environmental changes. These enabled us to better understand D-MEANDS weak points which led us to the proposition of D-MEANDS-MD. The proposal offers a better balance between memory and diversity. We also included a more recent MOEA in this comparison: the DDIS-MOEA/D-DE. From the results obtained using 27 instances of the dynamic multiobjective knapsack problem, D-MEANDS-MD showed promise for solving discrete DMaOPs compared with the others.
  • 加载中
  • Aghdasi , H. S., Saeedvand , S. & Baltes , J. 2019. A multiobjective evolutionary hyper-heuristic algorithm for team-orienteering problem with time windows regarding rescue applications. The Knowledge Engineering Review 34, 19.

    Google Scholar

    Asafuddoula , M., Ray , T. & Sarker , R. 2013. A decomposition based evolutionary algorithm for many objective optimization with systematic sampling and adaptive epsilon control. In International Conference on Evolutionary Multi-Criterion Optimization, 413–427. Springer.

    Google Scholar

    Azzouz , R., Bechikh , S. & Ben Said , L. 2015. Multi-objective optimization with dynamic constraints and objectives: new challenges for evolutionary algorithms. In Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, 615–622. ACM.

    Google Scholar

    Azzouz , R., Bechikh , S. & Said , L. B. 2017. Dynamic multi-objective optimization using evolutionary algorithms: a survey. In Recent Advances in Evolutionary Multi-objective Optimization, 31–70. Springer.

    Google Scholar

    Bosman , P. A. & Thierens , D. 2003. The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Transactions on Evolutionary Computation 7(2), 174–188.

    Google Scholar

    Bradford , E., Schweidtmann , A. M. & Lapkin , A. 2018. Efficient multiobjective optimization employing Gaussian processes, spectral sampling and a genetic algorithm. Journal of Global Optimization 71(2), 407–438.

    Google Scholar

    Branke , J. 2001. Evolutionary optimization in dynamic environments. In Genetic Algorithms and Evolutionary Computation, 3. Kluwer Academic Publishers.

    Google Scholar

    Cámara , M., Ortega , J. & Toro , F. J. 2007. Parallel processing for multi-objective optimization in dynamic environments. In 2007 IEEE International Parallel and Distributed Processing Symposium, 1–8.

    Google Scholar

    Cao , L., Xu , L., Goodman , E. D. & Li , H. 2019. Decomposition-based evolutionary dynamic multiobjective optimization using a difference model. Applied Soft Computing 76, 473–490.

    Google Scholar

    Chen , H., Li , M. & Chen , X. 2009. Using diversity as an additional-objective in dynamic multi-objective optimization algorithms. In 2009 Second International Symposium on Electronic Commerce and Security, 1, 484–487.

    Google Scholar

    Cheng , R., Jin , Y., Olhofer , M. & Sendhoff , B. 2016. A reference vector guided evolutionary algorithm for many-objective optimization. IEEE Transactions on Evolutionary Computation 20(5), 773–791.

    Google Scholar

    Chong , J. K. & Qiu , X. 2016. An opposition-based self-adaptive differential evolution with decomposition for solving the multiobjective multiple salesman problem. In 2016 IEEE Congress on Evolutionary Computation (CEC), 4096–4103.

    Google Scholar

    Cobb , H. G. 1990. An investigation into the use of hypermutation as an adaptive operator in genetic algorithms having continuous, time-dependent nonstationary environments (No. NRL-MR-6760). Naval Research Lab Washington DC.

    Google Scholar

    Coello , C. C. 1999. An updated survey of evolutionary multiobjective optimization techniques: state of the art and future trends. In Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406), 1, 3–13.

    Google Scholar

    Deb , K. & Jain , S. 2002. Running Performance Metrics for Evolutionary Multi-objective Optimization. Technical report 2002004, KanGAL, Indian Institute of Technology, Kanpur 208016, India.

    Google Scholar

    Deb , K. & Jain , H. 2014. An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE Transactions on Evolutionary Computation 18(4), 577–601.

    Google Scholar

    Deb , K. & Karthik , S. 2007. Dynamic multi-objective optimization and decision-making using modified NSGA-II: a case study on hydro-thermal power scheduling. In International Conference on Evolutionary Multi-criterion Optimization, 803–817. Springer.

    Google Scholar

    Deb , K., Pratap , A., Agarwal , S. & Meyarivan , T. A. M. T. 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation 6(2), 182–197.

    Google Scholar

    Deb , K. & Saxena , D. 2006. Searching for Pareto-optimal solutions through dimensionality reduction for certain large-dimensional multi-objective optimization problems. In Proceedings of the World Congress on Computational Intelligence (WCCI-2006), 3352–3360.

    Google Scholar

    Elarbi , M., Bechikh , S., Gupta , A., Said , L. B. & Ong , Y. S. 2017. A new decomposition-based NSGA-II for many-objective optimization. IEEE Transactions on Systems, Man, and Cybernetics: Systems 48(7), 1191–1210.

    Google Scholar

    Elarbi , M., Bechikh , S., Said , L. B. & Hung , C. C. 2016. Solving many-objective problems using targeted search directions. In Proceedings of the 31st Annual ACM Symposium on Applied Computing, 89–96.

    Google Scholar

    Emmerich , M., Beume , N. & Naujoks , B. 2005. An EMO algorithm using the hypervolume measure as selection criterion. In International Conference on Evolutionary Multi-Criterion Optimization, 62–76. Springer.

    Google Scholar

    Farina , M., Deb , K. & Amato , P. 2004. Dynamic multiobjective optimization problems: test cases, approximations, and applications. IEEE Transactions on Evolutionary Computation 8(5), 425–442.

    Google Scholar

    Fonseca , C. M. & Fleming , P. J. 1993. Multiobjective genetic algorithms In IEE Colloquium on Genetic Algorithms for Control Systems Engineering.

    Google Scholar

    Franca , T. P., Martins , L. G. & Oliveira , G. M. 2018. Maco/nds: many-objective ant colony optimization based on non-dominated sets. In 2018 IEEE Congress on Evolutionary Computation (CEC), 1–8. IEEE.

    Google Scholar

    Garza-Fabre , M., Pulido , G. T. & Coello , C. A. C. 2009. Ranking methods for many-objective optimization. In Mexican International Conference on Artificial Intelligence, 633–645. Springer.

    Google Scholar

    Goh , C. K. & Tan , K. C. 2009. A competitive-cooperative coevolutionary paradigm for dynamic multiobjective optimization. IEEE Transactions on Evolutionary Computation 13(1), 103–127.

    Google Scholar

    Gómez , R. H. & Coello , C. A. C. 2013. MOMBI: a new metaheuristic for many-objective optimization based on the R2 indicator. In 2013 IEEE Congress on Evolutionary Computation, 2488–2495.

    Google Scholar

    Gu , F., Liu , H. L. & Tan , K. C. 2012. A multiobjective evolutionary algorithm using dynamic weight design method. International Journal of Innovative Computing, Information and Control 8(5(B)), 3677–3688.

    Google Scholar

    Guliashki , V., Toshev , H. & Korsemov , C. 2009. Survey of evolutionary algorithms used in multiobjective optimization. Problems of Engineering Cybernetics and Robotics 60(1), 42–54.

    Google Scholar

    Hatzakis , I. & Wallace , D. 2006. Dynamic multi-objective optimization with evolutionary algorithms: a forward-looking approach. In Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, 1201–1208.

    Google Scholar

    Helbig , M., Deb , K. & Engelbrecht , A. 2016. Key challenges and future directions of dynamic multi-objective optimization. In 2016 IEEE Congress on Evolutionary Computation (CEC), 1256–1261.

    Google Scholar

    Ho , N. B. & Tay , J. C. 2007. Using evolutionary computation and local search to solve multi-objective flexible job shop problems. In Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, 821–828.

    Google Scholar

    Horn , R.J., Nafpliotis , N. & Goldberg , D. E. 1993. Multiobjective Optimization Using the Niched Pareto Genetic Algorithm. IlliGAL report, 93005.

    Google Scholar

    Horn , R. J., Nafpliotis , N. & Goldberg , D. E. 1994. A niched Pareto genetic algorithm for multiobjective optimization. In Proceedings of the First IEEE Conference on Evolutionary Computation, IEEE World Congress on Computational Intelligence, 1, 82–87.

    Google Scholar

    Hu , Y., Zheng , J., Zou , J., Yang , S., Ou , J. & Wang , R. 2020. A dynamic multi-objective evolutionary algorithm based on intensity of environmental change. Information Sciences 523, 49–62.

    Google Scholar

    Ishibuchi , H., Akedo , N. & Nojima , Y. 2013. A study on the specification of a scalarizing function in MOEA/D for many-objective knapsack problems. In International Conference on Learning and Intelligent Optimization, 231–246. Springer.

    Google Scholar

    Ishibuchi , H., Tsukamoto , N. & Nojima , Y. 2008. Evolutionary many-objective optimization: a short review. In 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence), 2419–2426.

    Google Scholar

    Jain , H. & Deb , K. 2014. An evolutionary many-objective optimization algorithm using reference-point based nondominated sorting approach, part II: handling constraints and extending to an adaptive approach. IEEE Transactions on Evolutionary Computation 18(4), 602–622.

    Google Scholar

    Jin , Y. & Branke , J. 2005. Evolutionary optimization in uncertain environments-a survey. IEEE Transactions on Evolutionary Computation 9(3), 303–317.

    Google Scholar

    Kakde , M. R. O. 2004. Survey on multiobjective evolutionary and real coded genetic algorithms. In Proceedings of the 8th Asia Pacific Symposium on Intelligent and Evolutionary Systems, 150–161.

    Google Scholar

    Kellerer , H., Pferschy , U. & Pisinger , D. 2004. Multidimensional knapsack problems. In Knapsack Problems, 235–283. Springer.

    Google Scholar

    Knowles , J. & Corne , D. 1999. The pareto archived evolution strategy: a new baseline algorithm for pareto multiobjective optimisation. In Congress on Evolutionary Computation (CEC99), 1, 98–105.

    Google Scholar

    Knowles , J. 2006. ParEGO: a hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems. IEEE Transactions on Evolutionary Computation 10(1), 50–66.

    Google Scholar

    Koo , W. T., Goh , C. K. & Tan , K. C. 2010. A predictive gradient strategy for multiobjective evolutionary algorithms in a fast changing environment. Memetic Computing 2(2), 87–110.

    Google Scholar

    Lafeta , T. F. Q., Bueno , M. L., Brasil , C. & Oliveira , G. M. 2016. MEANDS: a many-objective evolutionary algorithm based on nondominated decomposed sets applied to multicast routing. Applied Soft Computing 62, 851–866.

    Google Scholar

    Lafeta , T. F. Q. & Oliveira , G. M. B. 2019. An improved version of a many-objective evolutionary algorithm based on nondominated decomposed sets (MEANDS-II). In 2019 IEEE International Conference on Systems, Man and Cybernetics (SMC), 3673–3678.

    Google Scholar

    Lafetá , T. F. Q. & Oliveira , G. M. B. 2020a. Applying dynamic evolutionary optimization to the multiobjective knapsack problem. In Brazilian Conference on Intelligent Systems, 49–63. Springer.

    Google Scholar

    Lafetá , T. F. Q. & Oliveira , G. M. B. 2020b. D-MEANDS: a novel evolutionary approach to dynamic many-objective optimization problems. In 2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC), 1129–1134.

    Google Scholar

    Lancichinetti , A., Fortunato , S. & Kertész , J. 2009. Detecting the overlapping and hierarchical community structure in complex networks. New Journal of Physics 11(3), 033015.

    Google Scholar

    Li , H., He , F., Liang , Y. & Quan , Q. 2020. A dividing-based many-objective evolutionary algorithm for large-scale feature selection. Soft Computing, 24(9), 6851–6870.

    Google Scholar

    Li , H. & Zhang , Q. 2008. Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II. IEEE Transactions on Evolutionary Computation 13(2), 284–302.

    Google Scholar

    Li , M., Wei , J., Song , A. & Liu , Y. 2019. Objective reduction using objective sampling and affinity propagation for many-objective optimization problems. IEEE Access 7, 68392–68403.

    Google Scholar

    Liu , R., Peng , L., Liu , J. & Liu , J. 2020. A diversity introduction strategy based on change intensity for evolutionary dynamic multiobjective optimization. Soft Computing 24(17), 12789–12799.

    Google Scholar

    Mao-Guo , G., Li-Cheng , J., Dong-Dong , Y. & Wen-Ping , M. 2009. Evolutionary multi-objective optimization algorithms.

    Google Scholar

    Mankiewicz , R. 2000. The Story of Mathematics. Cassell.

    Google Scholar

    Mannion , P., Devlin , S., Duggan , J. & Howley , E. 2018. Reward shaping for knowledge-based multi-objective multi-agent reinforcement learning. The Knowledge Engineering Review 33, e23.

    Google Scholar

    Martello , S. & Toth , P. 1990. Knapsack Problems: Algorithms and Computer Implementations. John Wiley and Sons, Inc.

    Google Scholar

    Mehnen , J., Trautmann , H. & Tiwari , A. 2007. Introducing user preference using desirability functions in multi-objective evolutionary optimisation of noisy processes. In 2007 IEEE Congress on Evolutionary Computation, 2687–2694.

    Google Scholar

    Muruganantham , A., Tan , K. C. & Vadakkepat , P. 2016. Solving the IEEE CEC 2015 dynamic benchmark problems using kalman Filter based dynamic multiobjective evolutionary algorithm. In Intelligent and Evolutionary Systems, 239–252. Springer.

    Google Scholar

    Pizzuti , C. 2011. A multiobjective genetic algorithm to find communities in complex networks. IEEE Transactions on Evolutionary Computation 16(3), 418–430.

    Google Scholar

    Radulescu , R., Mannion , P., Zhang , Y., Roijers , D. M. & Nowé , A. 2020. A utility-based analysis of equilibria in multi-objective normal form games. arXiv preprint arXiv:2001.08177.

    Google Scholar

    Richter , H. 2013. Dynamic fitness landscape analysis. In Evolutionary Computation for Dynamic Optimization Problems, 269–297.

    Google Scholar

    Roy , R. & Mehnen , J. 2008. Dynamic multi-objective optimisation for machining gradient materials. CIRP Annals 57(1), 429–432.

    Google Scholar

    Said , L. B., Bechikh , S. & Ghédira , K. 2010. The r-dominance: a new dominance relation for interactive evolutionary multicriteria decision making. IEEE Transactions on Evolutionary Computation 14(5), 801–818.

    Google Scholar

    Sato , H., Aguirre , H. E. & Tanaka , K. 2007. Controlling dominance area of solutions and its impact on the performance of MOEAs. In International Conference on Evolutionary Multi-criterion Optimization, 5–20. Springer.

    Google Scholar

    Shang , R., Jiao , L., Gong , M. & Lu , B. 2005. Clonal selection algorithm for dynamic multiobjective optimization. In International Conference on Computational and Information Science, 846–851. Springer.

    Google Scholar

    Shang , R., Jiao , L., Ren , Y., Li , L. & Wang , L. 2013. Quantum immune clonal coevolutionary algorithm for dynamic multiobjective optimization. Soft Computing 18(4), 743–756.

    Google Scholar

    Singh , H. K., Isaacs , A. & Ray , T. 2011. A Pareto corner search evolutionary algorithm and dimensionality reduction in many-objective optimization problems. IEEE Transactions on Evolutionary Computation 15(4), 539–556.

    Google Scholar

    Srinivas , N. & Deb , K. 1994. Muiltiobjective optimization using nondominated sorting in genetic algorithms. Evolutionary Computation 2(3), 221–248.

    Google Scholar

    Tasgetiren , M. F., Pan , Q. K., Kizilay , D. & Suer , G. 2015. A differential evolution algorithm with variable neighborhood search for multidimensional knapsack problem. In 2015 IEEE Congress on Evolutionary Computation (CEC), 2797–2804. IEEE.

    Google Scholar

    Thompson , W. R. 1933. On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika 25(3/4), 285–294.

    Google Scholar

    Wang , Y. & Li , B. 2009. Investigation of memory-based multi-objective optimization evolutionary algorithm in dynamic environment. In Proceedings of the IEEE Congress on Evolutionary Computation, 630–637.

    Google Scholar

    Wang , Y. & Li , B. 2010. Multi-strategy ensemble evolutionary algorithm for dynamic multi-objective optimization. Memetic Computing 2(1), 3–24.

    Google Scholar

    Wang , X., Gao , L., Zhang , C. & Shao , X. 2010. A multi-objective genetic algorithm based on immune and entropy principle for flexible job-shop scheduling problem. The International Journal of Advanced Manufacturing Technology 51(5), 757–767.

    Google Scholar

    Wang , L., Zheng , X.-l. & Wang, S.-y. 2013. A novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem. Knowledge-Based Systems, 48, 17–23.

    Google Scholar

    Wright , A. H. 1991. Genetic algorithms for real parameter optimization. In Foundations of Genetic Algorithms, 1, 205–218. Elsevier.

    Google Scholar

    Zai , L. C., DeMarco , C. L. & Lipo , T. A. 1992. An extended Kalman filter approach to rotor time constant measurement in PWM induction motor drives. IEEE Transactions on Industry Applications 28(1), 96–104.

    Google Scholar

    Zeng , S. Y., Chen , G., Zheng , L., Shi , H., de Garis , H., Ding , L. & Kang , L. 2006. A dynamic multi-objective evolutionary algorithm based on an orthogonal design. In 2006 IEEE International Conference on Evolutionary Computation, 573–580.

    Google Scholar

    Zheng , B. 2007. A new dynamic multi-objective optimization evolutionary algorithm. In Proceedings of the Third International Conference on Natural Computation, 565–570.

    Google Scholar

    Zitzler , E. & Thiele , L. 1998. Multiobjective optimization using evolutionary algorithms–a comparative case study. In International Conference on Parallel Problem Solving from Nature, 292–301. Springer.

    Google Scholar

    Zitzler , E. & Thiele , L. 1999. Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation 3(4), 257–271.

    Google Scholar

    Zitzler , E. (1999). Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications, 63. Shaker.

    Google Scholar

    Zitzler , E., Laumanns , M. & Thiele , L. (2001). SPEA2: Improving the Strength Pareto Evolutionary Algorithm. TIK-report, 103.

    Google Scholar

    Zhang , Q. & Li , H. 2007. MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Transactions on Evolutionary Computation 11(6), 712–731.

    Google Scholar

    Zhang , Z. & Qian , S. 2011. Artificial immune system in dynamic environments solving time-varying non-linear constrained multi-objective problems. Soft Computing 15(7), 1333–1349.

    Google Scholar

    Zhou , A., Jin , Y.C., Zhang , Q., Sendhoff , B. and Tsang , E. 2007. Prediction-based population reinitialization for evolutionary dynamic multi-objective optimization. In Proceedings of the 4th International Conference on Evolutionary Multi-Criterion Optimization, 832–846.

    Google Scholar

    Zhou , A., Jin , Y. & Zhang , Q. 2014. A population prediction strategy for evolutionary dynamic multiobjective optimization. IEEE Transactions on Cybernetics 44(1), 40–53.

    Google Scholar

    Zou , J., Li , Q., Yang , S., Zheng , J., Peng , Z. & Pei , T. 2019. A dynamic multiobjective evolutionary algorithm based on a dynamic evolutionary environment model. Swarm and Evolutionary Computation 44, 247–259.

    Google Scholar

  • Cite this article

    Thiago Fialho de Queiroz Lafetá, Luiz G. A. Martins, Gina M. B. Oliveira. 2024. D-MEANDS-MD: an improved evolutionary algorithm with memory and diversity strategies applied to a discrete, dynamic, and many-objective optimization problem. The Knowledge Engineering Review 39(1), doi: 10.1017/S0269888924000079
    Thiago Fialho de Queiroz Lafetá, Luiz G. A. Martins, Gina M. B. Oliveira. 2024. D-MEANDS-MD: an improved evolutionary algorithm with memory and diversity strategies applied to a discrete, dynamic, and many-objective optimization problem. The Knowledge Engineering Review 39(1), doi: 10.1017/S0269888924000079
    shu
Download PDF

Article Metrics

Article views(91) PDF downloads(170)

Other Articles By Authors

RESEARCH ARTICLE   Open Access    

D-MEANDS-MD: an improved evolutionary algorithm with memory and diversity strategies applied to a discrete, dynamic, and many-objective optimization problem

  • Department of Computer Science, Federal University of Uberlandia, Uberlandia, Brazil

  • Corresponding author: Corresponding author: Thiago fialho de Queiroz Lafetá; Email: fialhot@gmail.com 
  • Received: 04 April 2021
  • Revised: 14 November 2023
  • Accepted: 15 November 2023
  • Published online: 02 December 2024
The Knowledge Engineering Review  39,  2024, 39(1)  |  Cite this article

Abstract: Abstract: Several real-world optimization problems are dynamic and involve a number of objectives. Different researches using evolutionary algorithms focus on these characteristics, but few works investigate problems that are both dynamic and many-objective. Although widely investigated in formulations with multiple objectives, the evolutionary approaches are still challenged by the dynamic multiobjective optimization problems defining a relevant research topic. Some models have been proposed specifically to attack them as the well-known DNSGA-II and MS-MOEA algorithms, which have been extensively investigated on formulations with two or three objectives. Recently, the D-MEANDS algorithm was proposed for dynamic many-objective problems (DMaOPs). In a previous work, D-MEANDS was confronted to DNSGA-II and MS-MOEA solving dynamic many-objective scenarios of the knapsack problem: up to six objectives with five changes or four objectives with ten changes. In this work, we evaluate the behavior of such algorithms in instances up to eight objectives and twenty environmental changes. These enabled us to better understand D-MEANDS weak points which led us to the proposition of D-MEANDS-MD. The proposal offers a better balance between memory and diversity. We also included a more recent MOEA in this comparison: the DDIS-MOEA/D-DE. From the results obtained using 27 instances of the dynamic multiobjective knapsack problem, D-MEANDS-MD showed promise for solving discrete DMaOPs compared with the others.

    HTML

    Acknowledgments

    • The authors thank FAPEMIG, CAPES, and CNPq.

    Rights and permissions
    • This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (https://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.
References (89)
  • About this article
    Cite this article
    Thiago Fialho de Queiroz Lafetá, Luiz G. A. Martins, Gina M. B. Oliveira. 2024. D-MEANDS-MD: an improved evolutionary algorithm with memory and diversity strategies applied to a discrete, dynamic, and many-objective optimization problem. The Knowledge Engineering Review 39(1), doi: 10.1017/S0269888924000079
    Thiago Fialho de Queiroz Lafetá, Luiz G. A. Martins, Gina M. B. Oliveira. 2024. D-MEANDS-MD: an improved evolutionary algorithm with memory and diversity strategies applied to a discrete, dynamic, and many-objective optimization problem. The Knowledge Engineering Review 39(1), doi: 10.1017/S0269888924000079
    shu

    • Catalog

      /

      DownLoad:  Full-Size Img  PowerPoint
      Return
      Return