Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2506.20172 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915358264262656 |
|---|---|
| author | Christiansen, Jeffrey Smith-Miles, Kate |
| author_facet | Christiansen, Jeffrey Smith-Miles, Kate |
| contents | For any optimisation problem where diverse algorithmic approaches are available, the task of predicting algorithm performance and selecting the algorithm most likely to perform well on a given instance holds great practical interest. However, if our test instances do not adequately represent the potential problem space, we may be misled about the strengths and weaknesses of an algorithm. In this paper we consider algorithm prediction and selection for the Quadratic Assignment Problem (QAP). We identify and eliminate superficial differences between QAP instances which do not affect problem difficulty and propose several new features for quantifying the characteristics of a particular instance. We then apply Instance Space Analysis to compare the performance of evolutionary and ant colony-based algorithms. Using this analysis, we identify limitations of the existing instance libraries and generators which obscure the true performance profile of these algorithms. Finally, we propose new instance classes which expand the instance space and support new insights into the properties of the problem and algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_20172 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Instance Space Analysis for the Quadratic Assignment Problem Christiansen, Jeffrey Smith-Miles, Kate Optimization and Control For any optimisation problem where diverse algorithmic approaches are available, the task of predicting algorithm performance and selecting the algorithm most likely to perform well on a given instance holds great practical interest. However, if our test instances do not adequately represent the potential problem space, we may be misled about the strengths and weaknesses of an algorithm. In this paper we consider algorithm prediction and selection for the Quadratic Assignment Problem (QAP). We identify and eliminate superficial differences between QAP instances which do not affect problem difficulty and propose several new features for quantifying the characteristics of a particular instance. We then apply Instance Space Analysis to compare the performance of evolutionary and ant colony-based algorithms. Using this analysis, we identify limitations of the existing instance libraries and generators which obscure the true performance profile of these algorithms. Finally, we propose new instance classes which expand the instance space and support new insights into the properties of the problem and algorithms. |
| title | Instance Space Analysis for the Quadratic Assignment Problem |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2506.20172 |