Dynamic multi-objective optimization algorithm based on ecological strategy

被引:0
|
作者
Zhang, Shiwen [1 ]
Li, Zhiyong [1 ]
Chen, Shaomiao [1 ]
Li, Renfa [1 ]
机构
[1] College of Information Science and Engineering, Hunan University
来源
Li, Z. (zhiyong.li@hnu.edu.cn) | 1600年 / Science Press卷 / 51期
关键词
Co-evolution; Dynamic multi-objective optimization; Ecological strategy; Evolutionary algorithm; Pareto front;
D O I
10.7544/issn1000-1239.2014.20120757
中图分类号
学科分类号
摘要
Dynamic multi-objective optimization problems (DMOP) are some problems whose objective functions, constraints, or parameters change dynamically. DMOP are important and challenging tasks in the real-world optimization domain. Generally, it is difficult to track the Pareto front of DMOP by the traditional evolutionary algorithm. Aimed at the characteristic of dynamic multi-objective problems, a novel co-evolutionary algorithm for DMOP (dynamic multi-objective optimization algorithm based on ecological strategy, ESDMO) is proposed based on ecological strategies and a new self-detecting environmental change operator. The ecological strategies are very important for individuals to fit to the changing environment and get higher competition ability. The proposed method adopts an evolutionary computing model that combines co-evolution mechanism and reinforcement learning strategy, which is inspired from ecological strategy between predator populations and prey populations. A self-detecting environmental change operator is defined and used to measure the changing environment in the algorithm. Hereby different populations take different ecological strategies to cope with environmental change. Several typical dynamic multi-objective problems are tested. The experimental results show that the proposed algorithm can get better diversity, uniformity and convergence performance. It demonstrates that the proposed algorithm is effective for solving DMOP.
引用
收藏
页码:1313 / 1330
页数:17
相关论文
共 36 条
  • [1] Jin Y., Branke J., Evolutionary optimization in uncertain environments: A survey, IEEE Trans on Evolutionary Computation, 9, 3, pp. 134-137, (2005)
  • [2] Cobb H.G., An Investigation into the Use of Hypermutation as an Adaptive Operator in Genetic Algorithms Having Continuous, Time-dependent Nonstationary Environments, NRL-MR-6760, (1990)
  • [3] Branke J., Kauber T., Schmidt C., Et al., A multi-population approach to dynamic optimization problems, Proc of the 4th Adaptive Computing in Design and Manufacturing, pp. 299-308, (2000)
  • [4] Farina M., Deb K., Amato P., Dynamic multiobjective optimization problems: test cases, approximations, and applications, IEEE Trans on Evolutionary Computation, 8, 5, pp. 425-442, (2004)
  • [5] Deb K., Karthik S., Dynamic multi-objective optimization and decision-making using modified NSGA-II: A case study on hydro-thermal power scheduling, Proc of the 4th Int Conf on Evolutionary Multi-Criterion Optimization (EMO'2007), pp. 803-817, (2007)
  • [6] Deb K., Pratap A., Agarwal S., Et al., A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Trans on Evolutionary Computation, 6, 2, pp. 182-197, (2002)
  • [7] Li X., Branke J., Kirley M., On performance metrics and particle swarm methods for dynamic multiobjective optimization problems, Proc of the 9th IEEE Congress on Evolutionary Computation, (2007)
  • [8] Zitzler E., Lanmanns M., Thiele L., SPEA2: Improving the Strength Pareto Evolutionary Algorithm, 103, pp. 95-100, (2001)
  • [9] Zeng S., Yao S., Kang L., Et al., An efficient multi-objective evolutionary algorithm: OMOEA2II, Proc of the 3rd Int Conf on Evolutionary Multi-Criterion Optimization (EMO'2005), pp. 108-119, (2005)
  • [10] Iason H., David W., Dynamic multi-objective optimization with evolutionary algorithms: A forward looking approach, Proc of the 8th Annual Conf on Genetic and Evolutionary Computation, pp. 1201-1208, (2006)