Dynamic multi-objective optimization algorithm based on decomposition and preference
| dc.cclicence | N/A | en |
| dc.contributor.author | Hu, Yaru | |
| dc.contributor.author | Zou, Juan | |
| dc.contributor.author | Zheng, Jinhua | |
| dc.contributor.author | Jiang, Shouyong | |
| dc.contributor.author | Yang, Shengxiang | |
| dc.date.acceptance | 2021-04-12 | |
| dc.date.accessioned | 2021-05-18T12:15:39Z | |
| dc.date.available | 2021-05-18T12:15:39Z | |
| dc.date.issued | 2021-04-20 | |
| dc.description | The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link. | en |
| dc.description.abstract | Most of the existing dynamic multi-objective evolutionary algorithms (DMOEAs) are effective, which focuses on searching for the approximation of Pareto-optimal front (POF) with well-distributed in handling dynamic multi-objective optimization problems (DMOPs). Nevertheless, in real-world scenarios, the decision maker (DM) may be only interested in a portion of the corresponding POF (i.e., the region of interest) for different instances, rather than the whole POF. Consequently, a novel DMOEA based decomposition and preference (DACP) is proposed, which incorporates the preference of DM into the dynamic search process and tracks a subset of Pareto-optimal set (POS) approximation with respect to the region of interest (ROI). Due to the presence of dynamics, the ROI, which is defined in which DM gives both the preference point and the neighborhood size, may be changing with time-varying DMOPs. Consequently, our algorithm moves the well-distributed reference points, which are located in the neighborhood range, to around the preference point to lead the evolution of the whole population. When a change occurs, a novel strategy is performed for responding to the current change. Particularly, the population will be reinitialized according to a promising direction obtained by letting a few solutions evolve independently for a short time. Comprehensive experiments show that this approach is very competitive compared with state-of-the-art methods. | en |
| dc.funder | Other external funder (please detail below) | en |
| dc.funder.other | National Natural Science Foundation of China | en |
| dc.identifier.citation | Hu, Y., Zou, J. Zheng, J., Jiang, S. and Yang, S. (2021) Dynamic multi-objective optimization algorithm based on decomposition and preference. Information Sciences, 571, pp. 175-190. | en |
| dc.identifier.doi | https://doi.org/10.1016/j.ins.2021.04.055 | |
| dc.identifier.issn | 0020-0255 | |
| dc.identifier.uri | https://dora.dmu.ac.uk/handle/2086/20858 | |
| dc.language.iso | en_US | en |
| dc.peerreviewed | Yes | en |
| dc.projectid | 61772178 and 61876164 | en |
| dc.publisher | Elsevier | en |
| dc.researchinstitute | Institute of Artificial Intelligence (IAI) | en |
| dc.subject | Dynamic multi-objective evolutionary algorithms | en |
| dc.subject | Region of interest | en |
| dc.subject | Reference points | en |
| dc.subject | Changing preference point | en |
| dc.title | Dynamic multi-objective optimization algorithm based on decomposition and preference | en |
| dc.type | Article | en |