.png){kind=icon}
.png){kind=icon}
Return
A benchmark test problem toolkit for multi-objective path optimization
.png){kind=icon}
OA
AI
DOI：10.1016/j.swevo.2018.11.009.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Due to the complexity of multi-objective optimization problems (MOOPs) in general, it is crucial to test MOOP methods on some benchmark test problems. Many benchmark test problem toolkits have been developed for continuous parameter/numerical optimization, but fewer toolkits reported for discrete combinational optimization. This paper reports a benchmark test problem toolkit especially for multi-objective path optimization problem (MOPOP), which is a typical category of discrete combinational optimization. With the reported toolkit, the complete Pareto front of a generated test problem of MOPOP can be deduced and found out manually, and the problem scale and complexity are controllable and adjustable. Many methods for discrete combinational MOOPs often only output a partial or approximated Pareto front. With the reported benchmark test problem toolkit for MOPOP, we can now precisely tell how many true Pareto points are missed by a partial Pareto front, or how large the gap is between an approximated Pareto front and the complete one.
Keywords:
Multi-objective optimization
Discrete combinational optimization
Benchmark test problem toolkit
Path optimization
Complete pareto front
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.5
Papers:
2.1K
Citations:
1.0W
Organization
View more organizations