Skip to content
Free planNo credit card requiredStart writing

article · Journal of Physics Conference Series · 2019

An improved evolutionary multi-objective optimization algorithm based on decomposition

Jiaxin Han, Manman He, Ying Cuan

Cited by 0Open access

Abstract

Abstract Multi-objective optimization (MOP) is a hot and difficult problem in the field of industrial production and scientific research, involving simultaneous optimization of multiple objectives. In this paper, an improved decomposition-based multi-objective evolutionary algorithm is proposed to solve MOP. Firstly, the Latin hypercube sampling method is used to generate the initial population in order to improve the diversity of the initial population and the probability of convergence to the global optimal solution. Secondly, the adaptive differential crossover operator is used to adjust the parameter settings adaptively for different problems, including the differential proportionality factor and crossover probability, so as to improve the performance of the algorithm. Finally, the reference point is set to coordinate origin, which can pull the population back to the real front faster and accelerate the convergence speed of the population. In a group of benchmark problems, ZDT and DTLZ test problems, the algorithm is widely compared with four most advanced algorithms. The experimental results show that the algorithm has better ability to solve MOP problems.

Cite this paper

APA 7

Han, J., He, M., & Cuan, Y. (2019). An improved evolutionary multi-objective optimization algorithm based on decomposition. Journal of Physics Conference Series, 1325(1), 012158. https://doi.org/10.1088/1742-6596/1325/1/012158

MLA 9

Han, Jiaxin, et al. “An improved evolutionary multi-objective optimization algorithm based on decomposition.” Journal of Physics Conference Series, vol. 1325, no. 1, 2019, p. 012158, https://doi.org/10.1088/1742-6596/1325/1/012158.

Chicago

Han, Jiaxin, Manman He, and Ying Cuan. 2019. “An improved evolutionary multi-objective optimization algorithm based on decomposition.” Journal of Physics Conference Series 1325 (1): 012158. https://doi.org/10.1088/1742-6596/1325/1/012158.

Harvard

Han, J., He, M. and Cuan, Y. (2019) ‘An improved evolutionary multi-objective optimization algorithm based on decomposition’, Journal of Physics Conference Series, 1325(1), p. 012158. Available at: https://doi.org/10.1088/1742-6596/1325/1/012158.

BibTeX
@article{han2019improved,
  title = {{An improved evolutionary multi-objective optimization algorithm based on decomposition}},
  author = {Han, Jiaxin and He, Manman and Cuan, Ying},
  journal = {Journal of Physics Conference Series},
  volume = {1325},
  number = {1},
  pages = {012158},
  year = {2019},
  doi = {10.1088/1742-6596/1325/1/012158}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.