A Swap Relaxation-Based Local Search for the Latin Square Completion Problem
Authors: Zhenxuan Xie, Zhipeng Lü, Zhouxing Su, Chu-Min Li, Junwen Ding, Yuxuan Wang
IJCAI 2024 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Extensive experiments on 1819 public benchmark instances demonstrate that SRLS outperforms the state-of-the-art algorithms in the literature in terms of both success rate and computational efficiency. |
| Researcher Affiliation | Academia | Zhenxuan Xie1 , Zhipeng L u1 , Zhouxing Su1 , Chu-Min Li2 , Junwen Ding1 , Yuxuan Wang1 1School of Computer Science and Technology, Huazhong University of Science and Technology, China 2MIS, Universite de Picardie Jules Verne, France |
| Pseudocode | Yes | Algorithm 1 The main framework of the SRLS algorithm; Algorithm 2 Initialization; Algorithm 3 Adaptive Restart |
| Open Source Code | Yes | The executable code of SRLS algorithm is online available at https://github.com/cardal1/SRLS. |
| Open Datasets | Yes | To assess the performance of the proposed SRLS algorithm, we conduct comprehensive experiments on totally 1819 public benchmark instances. ... The first set consists of 1800 random LSC benchmark instances2 which are classified into 18 types... 2https://github.com/Yan JINFR/Latin-Square-Completion. The second set consists of 19 traditional benchmark instances from the COLOR03 competition3. 3http://mat.gsia.cmu.edu/COLOR03/ |
| Dataset Splits | No | The paper mentions selecting '300 instances as the training set' for parameter tuning (irace), but it does not provide specific train/validation/test splits (percentages, sample counts, or predefined splits) for the main experimental evaluation of the Latin Square Completion problem solver. |
| Hardware Specification | Yes | All experiments are carried out on Intel Xeon E5-2698v3 @ 2.30GHz CPU with 192GB RAM under Windows Server 2012 x64 and only a single thread is used per run. |
| Software Dependencies | Yes | Our proposed SRLS algorithm1 is implemented in C++ and compiled by Visual Studio 2017. ... We compare the results of our algorithm with two exact solvers, Gurobi 11.0.0 and CP-SAT solver in OR-tools 9.7.2996 |
| Experiment Setup | Yes | The parameters of SRLS are tuned using the automatic configuration tool, irace [L opez-Ib a nez et al., 2016]. ... The final parameter values obtained by irace are shown in Table 1. (Table 1 lists: α 0.4, rt0 10, rtub 15, accuub 1000) |