The Library
A benchmark test problem toolkit for multi-objective path optimization
Tools
Tools
Tools
Hu, Xiao-Bing, Zhang, Hai-Lin, Zhang, Chi, Zhang, Ming-Kong, Li, Hang and Leeson, Mark S. (2019) A benchmark test problem toolkit for multi-objective path optimization. Swarm and Evolutionary Computation, 44 . pp. 18-30. doi:10.1016/j.swevo.2018.11.009 ISSN 2210-6502.
|
PDF
WRAP-benchmark-test-problem-toolkit-multi-objective-path-optimization-Leeson-2019.pdf - Accepted Version - Requires a PDF viewer. Available under License Creative Commons Attribution Non-commercial No Derivatives 4.0. Download (1170Kb) | Preview |
Official URL: http://dx.doi.org/10.1016/j.swevo.2018.11.009
Abstract
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.
| Item Type: | Journal Article | ||||||||
|---|---|---|---|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||||||
| Divisions: | Faculty of Science, Engineering and Medicine > Engineering > Engineering | ||||||||
| Library of Congress Subject Headings (LCSH): | Combinatorial optimization | ||||||||
| Journal or Publication Title: | Swarm and Evolutionary Computation | ||||||||
| Publisher: | Elsevier BV | ||||||||
| ISSN: | 2210-6502 | ||||||||
| Official Date: | February 2019 | ||||||||
| Dates: |
|
||||||||
| Volume: | 44 | ||||||||
| Page Range: | pp. 18-30 | ||||||||
| DOI: | 10.1016/j.swevo.2018.11.009 | ||||||||
| Status: | Peer Reviewed | ||||||||
| Publication Status: | Published | ||||||||
| Access rights to Published version: | Open Access (Creative Commons) | ||||||||
| Date of first compliant deposit: | 15 February 2019 | ||||||||
| Date of first compliant Open Access: | 15 February 2019 | ||||||||
| RIOXX Funder/Project Grant: |
|
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
Downloads
Downloads per month over past year
