Local search with weighting schemes for the CG:SHOP 2022 competition - Université Clermont Auvergne Access content directly
Conference Papers Year :

Local search with weighting schemes for the CG:SHOP 2022 competition

Abstract

This paper describes the heuristics used by the LASAOFOOFUBESTINNRRALLDECA 1 team for the CG:SHOP 2022 challenge. We introduce a new greedy algorithm that exploits information about the challenge instances, and hybridize two classical local-search schemes with weighting schemes. We found 211/225 best-known solutions. Hence, with the algorithms presented in this article, our team was able to reach the 3rd place of the challenge, among 40 participating teams.
Fichier principal
Vignette du fichier
FLLM2022-CG-SHOP.pdf (427.8 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03832850 , version 1 (28-10-2022)

Licence

Attribution

Identifiers

Cite

Florian Fontan, Pascal Lafourcade, Luc Libralesso, Benjamin Momège. Local search with weighting schemes for the CG:SHOP 2022 competition. 38th International Symposium on Computational Geometry, SoCG, Jun 2022, Berlin, Germany. ⟨10.4230/LIPIcs.SoCG.2022.73⟩. ⟨hal-03832850⟩
25 View
15 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More