A benchmark generator for online dynamic single-objective and multi-objective optimization problems

Xiang，Xiaoshu1; Tian，Ye1; Cheng，Ran2; Zhang，Xingyi3; Yang，Shengxiang4; Jin，Yaochu5

2022-10-01

10.1016/j.ins.2022.09.049

INFORMATION SCIENCES   影响因子和分区

0020-0255

1872-6291

In the past years, a number of benchmarks have been developed to characterize dynamic optimization problems (DOPs) consisting of a series of static problems over time. The solutions found for a static problem in a previous environment are required to be completely implemented so that the static problems in future environments are independent of the implementation of the solutions in the previous environment. Nevertheless, there is a wide range of real-world DOPs in which the problems in future environments are considerably influenced by the components of the solutions that are not implemented in previous environments, since the optimization for the problem in each environment continuously proceeds while the solutions are continuously implemented until the end of a working day or makespan. This type of DOPs can be termed as an online DOP (OL-DOP). To compensate for the lack of a systematical OL-DOP test suite, in this study we propose a benchmark generator for online dynamic single-objective and multi-objective optimization problems. Specifically, different types of influences of the solutions found in each environment on the problems in the next environment can be adjusted by different types of functions, and the dynamism degree can be tuned by a set of predefined parameters in these functions. Based on the proposed generator, we suggest a test suite consisting of ten continuous OL-DOPs and two discrete OL-DOPs. The empirical results demonstrate that the suggested OL-DOP test suite is characterized by time-deception in comparison with existing DOP benchmark test suites, and is able to analyze the ability of dynamic optimization algorithms in tackling the influence of the solutions found in each environment on the problem in the succeeding environment.

Benchmark generator Dynamic vehicle routing problems Online dynamic optimization

SCI

英语

其他

National Key Research and Development Project, Ministry of Science and Tech-nology, China[2018AAA0101302] ; National Natural Science Foundation of China["71802068","U1804262","2208085QF194","2108085QF272"] ; Leading Talent Team of Anhui Province[2019-16] ; State Key Laboratory of Synthetical Automation for Process Industries[PALN201805] ; Anhui Provincial Natural Science Foundation["1808085J06","1908085MF219"] ; [U21A20512] ; [61822301]

Computer Science

Computer Science, Information Systems

WOS:000893011300012

ELSEVIER SCIENCE INC

COMPUTER SCIENCE

2-s2.0-85138764688

Scopus

1.Key Lab of Intelligent Computing and Signal Processing of Ministry of Education,Institute of Physical Science and Information Technology,Anhui University,Hefei,230601,China
2.Shenzhen Key Laboratory of Computational Intelligence,University Key Laboratory of Evolving Intelligent Systems of Guangdong Province,Department of Computer Science and Engineering,Southern University of Science and Technology,Shenzhen,518055,China
3.Key Lab of Intelligent Computing and Signal Processing of Ministry of Education,School of Artificial Intelligence,Anhui University,Hefei,230601,China
4.Centre for Computational Intelligence (CCI),School of Computer Science and Informatics,De Montfort University,Leicester,LE1 9BH,United Kingdom
5.Chair of Nature Inspired Computing and Engineering,Faculty of Technology,Bielefeld University,Bielefeld,33619,Germany

Xiang，Xiaoshu,Tian，Ye,Cheng，Ran,et al. A benchmark generator for online dynamic single-objective and multi-objective optimization problems[J]. INFORMATION SCIENCES,2022,613:591-608.

Xiang，Xiaoshu,Tian，Ye,Cheng，Ran,Zhang，Xingyi,Yang，Shengxiang,&Jin，Yaochu.(2022).A benchmark generator for online dynamic single-objective and multi-objective optimization problems.INFORMATION SCIENCES,613,591-608.

Xiang，Xiaoshu,et al."A benchmark generator for online dynamic single-objective and multi-objective optimization problems".INFORMATION SCIENCES 613(2022):591-608.