Applying instance space analysis for metaheuristic selection to the 0–1 multidemand multidimensional knapsack problem

The empirical testing of metaheuristic solution methods for optimization applications should consider the effect of the underlying structure of the optimization problem test instances employed. This paper presents a methodology for analyzing the performance of metaheuristics applied to the 0–1 multi...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & operations research Ročník 170; s. 106747
Hlavní autori:	Scherer, Matthew E., Hill, Raymond R., Lunday, Brian J., Cox, Bruce A., White, Edward D.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.10.2024
Predmet:	Algorithm selection problem Instance space analysis Metaheuristics Multidemand multidimensional knapsack problem Metaheuristics Instance space analysis Algorithm selection problem Multidemand multidimensional knapsack problem
ISSN:	0305-0548
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	The empirical testing of metaheuristic solution methods for optimization applications should consider the effect of the underlying structure of the optimization problem test instances employed. This paper presents a methodology for analyzing the performance of metaheuristics applied to the 0–1 multidemand multidimensional knapsack problem (MDMKP) specifically considering problem structure. This research leverages instance space analysis (ISA) to graphically depict both the multidimensional problem structure and metaheuristic performance. A new instance generation method augments the existing set of test instances; in doing so, it introduces correlation structure into the problem and helps ensure MDMKP instance feasibility. Testing compares four metaheuristics from the literature and trains an interpretable machine learning model to select a metaheuristic for a given instance based on that problem’s meta-features. The results show that the correlation structure meta-features are significant factors affecting metaheuristic performance and that a decision tree model can provide interpretable insights into the algorithm selection problem. This work demonstrates the usefulness of ISA for rigorous empirical testing to enhance understanding the performance of metaheuristics applied to the MDMKP. •Metaheuristic Selection with Instance Space Analysis.•Propose interpretable Machine Learning method for Algorithm Selection Problem.•Apply Algorithm Selection Problem to Multidemand Multidimensional Knapsack Problem.
ISSN:	0305-0548
DOI:	10.1016/j.cor.2024.106747