Advanced search
1 file | 1.57 MB Add to list

Per-instance algorithm configuration in homogeneous instance spaces : a use case in reconfigurable assembly systems

Daniel Guzman Vargas (UGent) , Sidharta Gautama (UGent) , Mehmet Uzunosmanoğlu (UGent) , Birger Raa (UGent) and Veronique Limère (UGent)
Author
Organization
Project
Abstract
The physical capabilities of a reconfigurable assembly system (RAS) increase the agility and responsiveness of the system in highly volatile market conditions. However, achieving optimal RAS utilization entails solving complex optimization problems effectively and efficiently. These optimizations often define homogenous sets of problem instances. While algorithm configuration in such homogeneous contexts traditionally adopts a "one-size-fits-all" approach, recent studies have shown the potential of per-instance algorithm configuration (PIAC) methods in these settings. In this work, we evaluate and compare the performance of different PIAC methods in this context, namely Hydra-a state-of-the-art PIAC method-and a simpler case-based reasoning (CBR) approach. We evaluate the impact of the tuning time budget and/or the number of unique problem instances used for training on each of the method's performance and robustness. Our experiments show that whilst Hydra fails to improve upon the default algorithm configuration, the CBR method can lead to 16% performance increase using as few as 100 training instances. Following these findings, we evaluate Hydra's methodology when applied to homogenous instance spaces. This analysis shows the limitations of Hydra's inference mechanisms in these settings and showcases the advantages of distance-based approaches used in CBR.
Keywords
per-instance algorithm configuration, reconfigurable assembly systems, homogeneous instance spaces, integer quadratic programming, NORMALITY

Downloads

  • publisher version.pdf
    • full text (Published version)
    • |
    • open access
    • |
    • PDF
    • |
    • 1.57 MB

Citation

Please use this url to cite or link to this publication:

MLA
Guzman Vargas, Daniel, et al. “Per-Instance Algorithm Configuration in Homogeneous Instance Spaces : A Use Case in Reconfigurable Assembly Systems.” APPLIED SCIENCES-BASEL, vol. 14, no. 14, 2024, doi:10.3390/app14146035.
APA
Guzman Vargas, D., Gautama, S., Uzunosmanoğlu, M., Raa, B., & Limère, V. (2024). Per-instance algorithm configuration in homogeneous instance spaces : a use case in reconfigurable assembly systems. APPLIED SCIENCES-BASEL, 14(14). https://doi.org/10.3390/app14146035
Chicago author-date
Guzman Vargas, Daniel, Sidharta Gautama, Mehmet Uzunosmanoğlu, Birger Raa, and Veronique Limère. 2024. “Per-Instance Algorithm Configuration in Homogeneous Instance Spaces : A Use Case in Reconfigurable Assembly Systems.” APPLIED SCIENCES-BASEL 14 (14). https://doi.org/10.3390/app14146035.
Chicago author-date (all authors)
Guzman Vargas, Daniel, Sidharta Gautama, Mehmet Uzunosmanoğlu, Birger Raa, and Veronique Limère. 2024. “Per-Instance Algorithm Configuration in Homogeneous Instance Spaces : A Use Case in Reconfigurable Assembly Systems.” APPLIED SCIENCES-BASEL 14 (14). doi:10.3390/app14146035.
Vancouver
1.
Guzman Vargas D, Gautama S, Uzunosmanoğlu M, Raa B, Limère V. Per-instance algorithm configuration in homogeneous instance spaces : a use case in reconfigurable assembly systems. APPLIED SCIENCES-BASEL. 2024;14(14).
IEEE
[1]
D. Guzman Vargas, S. Gautama, M. Uzunosmanoğlu, B. Raa, and V. Limère, “Per-instance algorithm configuration in homogeneous instance spaces : a use case in reconfigurable assembly systems,” APPLIED SCIENCES-BASEL, vol. 14, no. 14, 2024.
@article{01J4KB37PN3W3RA9E84MG8ZTVN,
  abstract     = {{The physical capabilities of a reconfigurable assembly system (RAS) increase the agility and responsiveness of the system in highly volatile market conditions. However, achieving optimal RAS utilization entails solving complex optimization problems effectively and efficiently. These optimizations often define homogenous sets of problem instances. While algorithm configuration in such homogeneous contexts traditionally adopts a "one-size-fits-all" approach, recent studies have shown the potential of per-instance algorithm configuration (PIAC) methods in these settings. In this work, we evaluate and compare the performance of different PIAC methods in this context, namely Hydra-a state-of-the-art PIAC method-and a simpler case-based reasoning (CBR) approach. We evaluate the impact of the tuning time budget and/or the number of unique problem instances used for training on each of the method's performance and robustness. Our experiments show that whilst Hydra fails to improve upon the default algorithm configuration, the CBR method can lead to 16% performance increase using as few as 100 training instances. Following these findings, we evaluate Hydra's methodology when applied to homogenous instance spaces. This analysis shows the limitations of Hydra's inference mechanisms in these settings and showcases the advantages of distance-based approaches used in CBR.}},
  articleno    = {{6035}},
  author       = {{Guzman Vargas, Daniel and Gautama, Sidharta and Uzunosmanoğlu, Mehmet and Raa, Birger and Limère, Veronique}},
  issn         = {{2076-3417}},
  journal      = {{APPLIED SCIENCES-BASEL}},
  keywords     = {{per-instance algorithm configuration,reconfigurable assembly systems,homogeneous instance spaces,integer quadratic programming,NORMALITY}},
  language     = {{eng}},
  number       = {{14}},
  pages        = {{28}},
  title        = {{Per-instance algorithm configuration in homogeneous instance spaces : a use case in reconfigurable assembly systems}},
  url          = {{http://doi.org/10.3390/app14146035}},
  volume       = {{14}},
  year         = {{2024}},
}

Altmetric
View in Altmetric
Web of Science
Times cited: