Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article

A Steady-State and Generational Evolutionary Algorithm for Dynamic Multiobjective Optimization

Published: 01 February 2017 Publication History

Abstract

This paper presents a new algorithm, called steady-state and generational evolutionary algorithm, which combines the fast and steadily tracking ability of steady-state algorithms and good diversity preservation of generational algorithms, for handling dynamic multiobjective optimization. Unlike most existing approaches for dynamic multiobjective optimization, the proposed algorithm detects environmental changes and responds to them in a steady-state manner. If a change is detected, it reuses a portion of outdated solutions with good distribution and relocates a number of solutions close to the new Pareto front based on the information collected from previous environments and the new environment. This way, the algorithm can quickly adapt to changing environments and thus is expected to provide a good tracking ability. The proposed algorithm is tested on a number of bi- and three-objective benchmark problems with different dynamic characteristics and difficulties. Experimental results show that the proposed algorithm is very competitive for dynamic multiobjective optimization in comparison with state-of-the-art methods.

References

[1]
V. Aragón, S. Esquivel, and C. A. Coello Coello, “Evolutionary multiobjective optimization in non-stationary environments,” J. Comput. Sci. Technol., vol. Volume 5, no. Issue 3, pp. 133–143, 2005.
[2]
C. R. B. Azevedo and A. F. R. Araújo, “Generalized immigration schemes for dynamic evolutionary multiobjective optimization,” in Proc. IEEE Congr. Evol. Comput. (CEC), New Orleans, LA, USA, 2011, pp. 2033–2040.
[3]
S. Biswas, D. Bose, S. Das, and S. Kundu, “Decomposition-based evolutionary multi-objective optimization approach to the design of concentric circular antenna arrays,” Prog. Electromagn. Res. B, vol. Volume 52, pp. 185–205, 2013.
[4]
S. Biswas, S. Das, P. N. Suganthan, and C. A. Coello Coello, “Evolutionary multiobjective optimization in dynamic environments: A set of novel benchmark functions,” in Proc. IEEE Congr. Evol. Comput. (CEC), Beijing, China, 2014, pp. 3192–3199.
[5]
S. Biswas, S. Kundu, and S. Das, “Inducing niching behavior in differential evolution through local information sharing,” IEEE Trans. Evol. Comput., vol. Volume 19, no. Issue 2, pp. 246–263, 2015.
[6]
S. Biswas, S. Das, S. Kundu, and G. R. Patra, “Utilizing time-linkage property in DOPs: An information sharing based artificial bee colony algorithm for tracking multiple optima in uncertain environments,” Soft Comput., vol. Volume 18, no. Issue 6, pp. 1199–1212, 2014.
[7]
J. Branke, “Memory enhanced evolutionary algorithms for changing optimization problems,” in Proc. IEEE Congr. Evol. Comput. (CEC), vol. Volume 3 . Washington, DC, USA, 1999, pp. 1875–1882.
[8]
L. T. Bui, Z. Michalewicz, E. Parkinson, and M. B. Abello, “Adaptation in dynamic environments: A case study in mission planning,” IEEE Trans. Evol. Comput., vol. Volume 16, no. Issue 2, pp. 190–209, 2012.
[9]
M. Cámara, J. Ortega, and F. de Toro, “A single front genetic algorithm for parallel multi-objective optimization in dynamic environments,” Neurocomputing, vol. Volume 72, nos. Issue 16</issue>–<issue>18, pp. 3570–3579, 2009.
[10]
B. Chen, W. Zeng, Y. Lin, and D. Zhang, “A new local search-based multiobjective optimization algorithm,” IEEE Trans. Evol. Comput., vol. Volume 19, no. Issue 1, pp. 50–73, 2015.
[11]
C. Chen and L.-Y. Tseng, “An improved version of the multiple trajectory search for real value multi-objective optimization problems,” Eng. Optim., vol. Volume 46, no. Issue 10, pp. 1430–1445, 2014.
[12]
K. Deb, N. U. B. Rao, and S. Karthik, “Dynamic multi-objective optimization and decision-making using modified NSGA-II: A case study on hydro-thermal power scheduling,” in Proc. 4th Int. Conf. Evol. Multi Criterion Optim., vol. Volume 3 . 2007, pp. 803–817.
[13]
K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: NSGA-II,” IEEE Trans. Evol. Comput., vol. Volume 6, no. Issue 2, pp. 182–197, 2002.
[14]
E. U. Ergul and I. Eminoglu, “DOPGA: A new fitness assignment scheme for multi-objective evolutionary algorithms,” Int. J. Syst. Sci., vol. Volume 45, no. Issue 3, pp. 407–426, 2014.
[15]
M. Farina, K. Deb, and P. Amato, “Dynamic multiobjective optimization problems: Test cases, approximations, and applications,” IEEE Trans. Evol. Comput., vol. Volume 8, no. Issue 5, pp. 425–442, 2004.
[16]
H. Fu, B. Sendhoff, K. Tang, and X. Yao, “<chapter-title>Finding robust solutions to dynamic optimization problems</chapter-title>,” in Applications of Evolutionary Computation (LNCS 7835). Heidelberg, Berlin, Germany: Springer, 2013, pp. 616–625.
[17]
C. K. Goh and K. C. Tan, “An investigation on noisy environments in evolutionary multiobjective optimization,” IEEE Trans. Evol. Comput., vol. Volume 11, no. Issue 3, pp. 354–381, 2007.
[18]
C.-K. Goh and K. C. Tan, “A competitive-cooperative coevolutionary paradigm for dynamic multiobjective optimization,” IEEE Trans. Evol. Comput., vol. Volume 13, no. Issue 1, pp. 103–127, 2009.
[19]
M. Helbig and A. P. Engelbrecht, “Performance measures for dynamic multi-objective optimisation algorithms,” Inf. Sci., vol. Volume 250, pp. 61–81, 2013.
[20]
M. Helbig and A. P. Engelbrecht, “Benchmarks for dynamic multi-objective optimisation algorithms,” ACM Comput. Surveys, vol. Volume 46, no. Issue 3, 2014, Art. no. .
[21]
M. Helbig and A. P. Engelbrecht, “Population-based metaheuristics for continuous boundary-constrained dynamic multi-objective optimisation problems,” Swarm Evol. Comput., vol. Volume 14, pp. 31–47, 2014.
[22]
I. Hatzakis and D. Wallace, “Dynamic multiobjective optimization with evolutionary algorithms: A forward-looking approach,” in Proc. 8th Annu. Conf. Genet. Evol. Comput. (GECCO), Seattle, WA, USA, 2006, pp. 1201–1208.
[23]
S. Jiang and S. Yang, “A benchmark generator for dynamic multi-objective optimization problems,” in Proc. U.K. Workshop Comput. Intell. (UKCI), Bradford, U. K., 2014, pp. 1–8.
[24]
S. Jiang and S. Yang, “A framework of scalable dynamic test problems for dynamic multi-objective optimization,” in Proc. IEEE Symp. Comput. Intell. Dyn. Uncertain Environ. (CIDUE), Orlando, FL, USA, 2014, pp. 32–39.
[25]
S. Jiang and S. Yang, “Evolutionary dynamic multi-objective optimization: Benchmarks and algorithm comparisons,” IEEE Trans. Cybern., to be published. pub-id-type=doi>10.1109/TCYB.2015.2510698</object-id>.
[26]
Y. Jin and B. Sendhoff, “<chapter-title>Constructing dynamic optimization test problems using the multi-objective optimization concept</chapter-title>,” in Applications of Evolutionary Computing (LNCS 3005). Heidelberg, Berlin, Germany: Springer, 2004, pp. 525–536.
[27]
Y. Jin, K. Tang, X. Yu, B. Sendhoff, and X. Yao, “A framework for finding robust optimal solutions over time,” Memetic Comput., vol. Volume 5, no. Issue 1, pp. 3–18, 2013.
[28]
W. T. Koo, C. K. Goh, and K. C. Tan, “A predictive gradient strategy for multiobjective evolutionary algorithms in a fast changing environment,” Memetic Comput., vol. Volume 2, no. Issue 2, pp. 87–110, 2010.
[29]
S. Kundu, S. Biswas, S. Das, and P. N. Suganthan, “Crowding-based local differential evolution with speciation-based memory archive for dynamic multimodal optimization,” in Proc. 15th Annu. Conf. Genet. Evol. Comput. (GECCO), Amsterdam, The Netherlands, 2013, pp. 33–40.
[30]
M. Laumanns, E. Zitzler, and L. Thiele, “A unified model for multi-objective evolutionary algorithms with elitism,” in Proc. IEEE Congr. Evol. Comput. (CEC), 2000, pp. 46–53.
[31]
H. Li and Q. Zhang, “Multiobjective optimization problems with complicated Pareto sets, MOEA/D and NSGA-II,” IEEE Trans. Evol. Comput., vol. Volume 13, no. Issue 2, pp. 284–302, 2009.
[32]
R. Liu, J. Fan, and L. Jiao, “Integration of improved predictive model and adaptive differential evolution based dynamic multi-objective evolutionary optimization algorithm,” Appl. Intell., vol. Volume 43, no. Issue 1, pp. 192–207, 2015.
[33]
R. Liu, Y. Chen, W. Ma, C. Mu, and L. Jiao, “A novel cooperative coevolutionary dynamic multi-objective optimization algorithm using a new predictive model,” Soft Comput., vol. Volume 18, no. Issue 10, pp. 1913–1929, 2014.
[34]
H. Lu and G. G. Yen, “Rank-density-based multiobjective genetic algorithm and benchmark test function study,” IEEE Trans. Evol. Comput., vol. Volume 7, no. Issue 4, pp. 325–343, 2003.
[35]
S. Nguyen, M. Zhang, M. Johnston, and K. C. Tan, “Automatic design of scheduling policies for dynamic multi-objective job shop scheduling via cooperative coevolution genetic programming,” IEEE Trans. Evol. Comput., vol. Volume 18, no. Issue 2, pp. 193–208, 2014.
[36]
Z. Peng, J. Zheng, J. Zou, and M. Liu, “Novel prediction and memory strategies for dynamic multiobjective optimization,” Soft Comput., vol. Volume 19, no. Issue 9, pp. 2633–2653, 2014.
[37]
H. Richter, “Detecting change in dynamic fitness landscapes,” in Proc. IEEE Congr. Evol. Comput. (CEC), Trondheim, Norway, 2009, pp. 1613–1620.
[38]
S. Salomon, R. C. Purshouse, G. Avigad, and P. J. Fleming, “<chapter-title>An evolutionary approach to active robust multiobjective optimisation</chapter-title>,” in Evolutionary Multi-Criterion Optimization (LNCS 9019) . Cham, Switzerland: Springer, 2015, pp. 141–155.
[39]
J. R. Schott, “Fault tolerant design using single and multicriteria genetic algorithm optimization,” M.S. thesis, <institution content-type=department>Dept. Aeronaut. Astronaut</institution>., <institution content-type=institution>Massachusetts Inst. Technol</institution>., Cambridge, MA, USA, 1995.
[40]
R. Shang, L. Jiao, Y. Ren, L. Li, and L. Wang, “Quantum immune clonal coevolutionary algorithm for dynamic multiobjective optimization,” Soft Comput., vol. Volume 18, no. Issue 4, pp. 743–756, 2014.
[41]
E. Tantar, A.-A. Tantar, and P. Bouvry, “On dynamic multi-objective optimization, classification and performance measures,” in Proc. IEEE Congr. Evol. Comput. (CEC), New Orleans, LA, USA, 2011, pp. 2759–2766.
[42]
A. Trivedi, D. Srinivasan, S. Biswas, and T. Reindl, “Hybridizing genetic algorithm with differential evolution for solving the unit commitment scheduling problem,” Swarm Evol. Comput., vol. Volume 23, pp. 50–64, 2015.
[43]
L.-Y. Tseng and C. Chen, “Multiple trajectory search for unconstrained/constrained multi-objective optimization,” in Proc. IEEE Congr. Evol. Comput. (CEC), Trondheim, Norway, 2009, pp. 1951–1958.
[44]
S. Tiwari, G. Fadel, and K. Deb, “AMGA2: Improving the performance of the archive-based micro-genetic algorithm for multi-objective optimization,” Eng. Optim., vol. Volume 43, no. Issue 4, pp. 377–401, 2011.
[45]
R. Wang, R. C. Purshouse, and P. J. Fleming, “Preference-inspired coevolutionary algorithms for many-objective optimization,” IEEE Trans. Evol. Comput., vol. Volume 17, no. Issue 4, pp. 474–494, 2013.
[46]
F. Wilcoxon, “Individual comparisons by ranking methods,” Biometrics Bull., vol. Volume 1, no. Issue 6, pp. 80–83, 1945.
[47]
Y. Wu, Y. Jin, and X. Liu, “A directed search strategy for evolutionary dynamic multiobjective optimization,” Soft Comput., vol. Volume 19, no. Issue 11, pp. 3221–3235, 2015.
[48]
F. Vavak and T. C. Fogarty, “Comparison of steady state and generational genetic algorithms for use in nonstationary environments,” in Proc. IEEE Int. Conf. Evol. Comput., Nagoya, Japan, 1996, pp. 192–195.
[49]
Y. Yuan, H. Xu, B. Wang, B. Zhang, and X. Yao, “Balancing convergence and diversity in decomposition-based many-objective optimizers,” IEEE Trans. Evol. Comput., vol. Volume 19, no. Issue 5, pp. 694–716, 2015.
[50]
Z. Zhang, “Multiobjective optimization immune algorithm in dynamic environments and its application to greenhouse control,” Appl. Soft Comput., vol. Volume 8, no. Issue 2, pp. 959–971, 2008.
[51]
Q. Zhang and H. Li, “MOEA/D: A multiobjective evolutionary algorithm based on decomposition,” IEEE Trans. Evol. Comput., vol. Volume 11, no. Issue 6, pp. 712–731, 2007.
[52]
Z. Zhang and S. Qian, “Artificial immune system in dynamic environments solving time-varying non-linear constrained multi-objective problems,” Soft Comput., vol. Volume 15, no. Issue 7, pp. 1333–1349, 2011.
[53]
Q. Zhang, A. Zhou, and Y. Jin, “RM-MEDA: A regularity model-based multiobjective estimation of distribution algorithm,” IEEE Trans. Evol. Comput., vol. Volume 12, no. Issue 1, pp. 41–63, 2008.
[54]
A. Zhou, Y. Jin, and Q. Zhang, “A population prediction strategy for evolutionary dynamic multiobjective optimization,” IEEE Trans. Cybern., vol. Volume 44, no. Issue 1, pp. 40–53, 2014.
[55]
A. Zhou, Y. Jin, Q. Zhang, B. Sendhoff, and E. Tsang, “Prediction-based population re-initialization for evolutionary dynamic multi-objective optimization,” in Proc. 4th Int. Conf. Evol. Multi Criterion Optim., Matsushima, Japan, 2007, pp. 832–846.
[56]
E. Zitzler, M. Laumanns, and L. Thiele, “SPEA2: Improving the strength Pareto evolutionary algorithm for multiobjective optimization,” in Proc. EUROGEN Evol. Methods Design Optim. Control Appl. Ind. Prob., Athens, Greece, 2002, pp. 95–100.
[57]
E. Zitzler and L. Thiele, “Multiobjective evolutionary algorithms: A comparative case study and the strength Pareto approach,” IEEE Trans. Evol. Comput., vol. Volume 3, no. Issue 4, pp. 257–271, 1999.

Cited By

View all
  • (2025)A dynamic multi-objective optimization algorithm based on probability-driven prediction and correlation-guided individual transferThe Journal of Supercomputing10.1007/s11227-024-06832-081:1Online publication date: 1-Jan-2025
  • (2024)A Micro Dynamic Multi-objective Evolutionary Algorithm for Small-scale Smart Greenhouse with Low-power MicroprocessorProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3638530.3654276(687-690)Online publication date: 14-Jul-2024
  • (2024)Evolutionary Algorithm with Cross-Generation Environmental Selection for Traveling Salesman ProblemProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3638530.3654166(635-638)Online publication date: 14-Jul-2024
  • Show More Cited By
  1. A Steady-State and Generational Evolutionary Algorithm for Dynamic Multiobjective Optimization

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image IEEE Transactions on Evolutionary Computation
      IEEE Transactions on Evolutionary Computation  Volume 21, Issue 1
      February 2017
      166 pages

      Publisher

      IEEE Press

      Publication History

      Published: 01 February 2017

      Qualifiers

      • Research-article

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)0
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 06 Jan 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2025)A dynamic multi-objective optimization algorithm based on probability-driven prediction and correlation-guided individual transferThe Journal of Supercomputing10.1007/s11227-024-06832-081:1Online publication date: 1-Jan-2025
      • (2024)A Micro Dynamic Multi-objective Evolutionary Algorithm for Small-scale Smart Greenhouse with Low-power MicroprocessorProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3638530.3654276(687-690)Online publication date: 14-Jul-2024
      • (2024)Evolutionary Algorithm with Cross-Generation Environmental Selection for Traveling Salesman ProblemProceedings of the Genetic and Evolutionary Computation Conference Companion10.1145/3638530.3654166(635-638)Online publication date: 14-Jul-2024
      • (2024)Evolutionary Dynamic Constrained Multiobjective Optimization: Test Suite and AlgorithmIEEE Transactions on Evolutionary Computation10.1109/TEVC.2023.331368928:5(1381-1395)Online publication date: 1-Oct-2024
      • (2024)A Mahalanobis Distance-Based Approach for Dynamic Multiobjective Optimization With Stochastic ChangesIEEE Transactions on Evolutionary Computation10.1109/TEVC.2023.325385028:1(238-251)Online publication date: 1-Feb-2024
      • (2024)A fuzzy-guided adaptive algorithm with hierarchy mechanism for solving dynamic multi-objective optimization problemsKnowledge-Based Systems10.1016/j.knosys.2023.111227284:COnline publication date: 25-Jan-2024
      • (2024)A dynamic multi-objective evolutionary algorithm based on Mahalanobis distance and intra-cluster individual correlation rectificationInformation Sciences: an International Journal10.1016/j.ins.2024.120922678:COnline publication date: 1-Sep-2024
      • (2024)Dynamic adaptive multi-objective optimization algorithm based on type detectionInformation Sciences: an International Journal10.1016/j.ins.2023.119867654:COnline publication date: 1-Jan-2024
      • (2024)A dynamic multi-objective evolutionary algorithm with variable stepsize and dual prediction strategiesFuture Generation Computer Systems10.1016/j.future.2024.07.028161:C(390-403)Online publication date: 1-Dec-2024
      • (2024)DpEAExpert Systems with Applications: An International Journal10.1016/j.eswa.2024.124441255:PAOnline publication date: 1-Dec-2024
      • Show More Cited By

      View Options

      View options

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media