Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/24262
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Skackauskas, J | - |
dc.contributor.author | Kalganova, T | - |
dc.date.accessioned | 2022-03-15T15:59:29Z | - |
dc.date.available | 2022-03-15T15:59:29Z | - |
dc.date.issued | 2022-05-27 | - |
dc.identifier | 200041 | - |
dc.identifier.citation | Skackauskas, J. and Kalganova, T. (2022) 'Dynamic Multidimensional Knapsack Problem benchmark datasets', Systems and Soft Computing, 4, 200041, pp. 1-15. doi: 10.1016/j.sasc.2022.200041. | en_US |
dc.identifier.uri | https://bura.brunel.ac.uk/handle/2438/24262 | - |
dc.description | Journal formerly known as: Soft Computing Letters (eISSN: 2666-2221). | en_US |
dc.description.abstract | Copyright © 2022 The Authors. With increasing research on solving Dynamic Optimization Problems (DOPs), many metaheuristic algorithms and their adaptations have been proposed to solve them. However, from currently existing research results, it is hard to evaluate the algorithm performance in a repeatable way for combinatorial DOPs due to the fact that each research work has created its own version of a dynamic problem dataset using stochastic methods. Up to date, there are no combinatorial DOP benchmarks with replicable qualities. This work introduces a non-stochastic consistent Dynamic Multidimensional Knapsack Problem (Dynamic MKP) dataset generation method that is also extensible to solve the research replicability problem. Using this method, generated and published 1405 Dynamic MKP benchmark datasets using existing famous static MKP benchmark instances as the initial state. Then the datasets are quantitatively and qualitatively analyzed. Furthermore, 445 datasets have the optimal result found of each state using a linear solver. The optimal results and result scores are included with published datasets. | - |
dc.format.extent | 1 - 15 | - |
dc.format.medium | Electronic | - |
dc.language.iso | en_US | en_US |
dc.rights | Copyright © 2022 The Authors. Published by Elsevier B.V. This is an open access article under the CC BY license (https://creativecommons.org/licenses/by/4.0/). | - |
dc.rights.uri | https://creativecommons.org/licenses/by/4.0/ | - |
dc.subject | dynamic MKP | en_US |
dc.subject | benchmark datasets | en_US |
dc.subject | discrete dynamic optimization | en_US |
dc.subject | non-stochastic dataset generation | en_US |
dc.title | Dynamic Multidimensional Knapsack Problem benchmark datasets | en_US |
dc.type | Article | en_US |
dc.contributor.sponsor | Intel Corporation (Autonomous Digital Supply Chain). | - |
dc.identifier.doi | https://doi.org/10.1016/j.sasc.2022.200041 | - |
dc.relation.isPartOf | Systems and Soft Computing | - |
pubs.publication-status | Published | - |
pubs.volume | 4 | - |
dc.identifier.eissn | 2772-9419 | - |
Appears in Collections: | Dept of Electronic and Electrical Engineering Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
FullText.pdf | 3.37 MB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License