{"type":"ScholarlyArticle","title":"A Swap Relaxation-Based Local Search for the Latin Square Completion Problem","authors":[{"name":"Zhenxuan Xie","slug":"zhenxuan-xie","given":"Zhenxuan","family":"Xie","affiliation":"School of Computer Science and Technology , Huazhong University of Science and Technology , China"},{"name":"Zhipeng Lü","slug":"zhipeng-lu","given":"Zhipeng","family":"Lü","affiliation":""},{"name":"Zhouxing Su","slug":"zhouxing-su","given":"Zhouxing","family":"Su","affiliation":"School of Computer Science and Technology , Huazhong University of Science and Technology , China"},{"name":"Chu-Min Li","slug":"chu-min-li","given":"Chu-Min","family":"Li","affiliation":"MIS , Universite de Picardie Jules Verne , France"},{"name":"Junwen Ding","slug":"junwen-ding","given":"Junwen","family":"Ding","affiliation":"School of Computer Science and Technology , Huazhong University of Science and Technology , China"},{"name":"Yuxuan Wang","slug":"yuxuan-wang","given":"Yuxuan","family":"Wang","affiliation":"School of Computer Science and Technology , Huazhong University of Science and Technology , China"}],"abstract":"The Latin square completion (LSC) problem aims to assign n symbols to the empty cells of a partially filled Latin square such that in each row and each column, each symbol appears exactly once. In this paper, we propose a swap relaxation-based fast local search algorithm called SRLS for solving the LSC problem. First, it introduces a novel search space definition, which forbids row conflicts based on which a swap-based neighborhood is defined. Second, a color domain relaxation technique is employed in the swap-based neighborhood by temporarily accepting the violation of some constraints to connect high-quality solutions. Third, two effective scoring functions are adopted to select neighborhood moves minimizing the number of conflicting edges as well as the number of color domain violations. Finally, SRLS employs an adaptive restart mechanism to balance the exploitation and exploration of the search. 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.","doi":"10.24963/ijcai.2024/779","url":"https://ijcai.org/proceedings/2024/779","pdf":"https://ijcai.org/proceedings/2024/0779.pdf","markdown":"https://ijcai.org/proceedings/2024/779.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/779","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Search","track":"Main Track","number":779,"pages":{"first":7047,"last":7055},"keywords":["Search: S: Heuristic search","Search: S: Meta-reasoning and meta-heuristics","Search: S: Local search","Search: S: Combinatorial search and optimisation"],"videos":[],"references":[{"position":1,"raw":"[Ansótegui et al., 2004] Carlos Ansótegui, Alvaro del Val, Iván Dotú, Cesar Fernández, and Felip Manya. Modeling choices in quasigroup completion: SAT vs. CSP. In Pro- ceedings of the Nineteenth AAAI Conference on Artificial Intelligence, AAAI, pages 137-142, 2004.","title":"Modeling choices in quasigroup completion: SAT vs. CSP","authors":"Carlos Ansótegui, Alvaro Del Val, Iván Dotú, Cesar Fernández, Felip Manya","year":"2004","venue":"Proceedings of the Nineteenth AAAI Conference on Artificial Intelligence, AAAI","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Barry and Humblet, 1993] Richard Barry and Pierre Hum- blet. Latin routers, design and implementation. Journal of Lightwave Technology, 11(5/6):891-899, May 1993.","title":"Richard Barry and Pierre Humblet. Latin routers, design and implementation","authors":"Humblet Barry","year":"1993","venue":"Journal of Lightwave Technology","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Biró et al., 1992] Miklós Biró, Mihály Hujter, and Zs Tuza. Precoloring extension. I. Interval graphs. Discrete Mathe- matics, 100(1-3):267-279, 1992.","title":"Precoloring extension. I. Interval graphs","authors":"Miklós Biró, Mihály Hujter, Zs Tuza","year":"1992","venue":"Discrete Mathematics","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Chen et al., 2021] Jiejiang Chen, Shaowei Cai, Shiwei Pan, Yiyuan Wang, Qingwei Lin, Mengyu Zhao, and Minghao Yin. Nuqclq: an effective local search algorithm for max- imum quasi-clique problem. In Proceedings of the Thirty- Third AAAI Conference on Artificial Intelligence, AAAI, pages 12258-12266, 2021.","title":"Nuqclq: an effective local search algorithm for maximum quasi-clique problem","authors":"Jiejiang Chen, Shaowei Cai, Shiwei Pan, Yiyuan Wang, Qingwei Lin, Mengyu Zhao, Minghao Yin","year":"2021","venue":"Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Colbourn et al., 2004] Charles Colbourn, Torleiv Klove, and Alan Ling. Permutation arrays for powerline com- munication and mutually orthogonal latin squares. IEEE Transactions on Information Theory, 50(6):1289-1291, 2004.","title":"Permutation arrays for powerline communication and mutually orthogonal latin squares","authors":"Charles Colbourn, Torleiv Klove, Alan Ling","year":"2004","venue":"IEEE Transactions on Information Theory","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Colbourn, 1984] Charles Colbourn. The complexity of completing partial latin squares. Discrete Applied Math- ematics, 8(1):25-30, April 1984.","title":"The complexity of completing partial latin squares","authors":"Charles Colbourn","year":"1984","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Colbourne and Dinitz, 2007] Charles Colbourne and Jeffrey Dinitz. Handbook of Combinatorial Designs. CRC press Boca Raton, FL, 2007.","title":"Handbook of Combinatorial Designs","authors":"Dinitz Colbourne, Charles Colbourne, Jeffrey Dinitz","year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Galinier and Hao, 1999] Philippe Galinier and Jin-Kao Hao. Hybrid evolutionary algorithms for graph color- ing. Journal of Combinatorial Optimization, 3(4):379- 397, 1999.","title":"Hybrid evolutionary algorithms for graph coloring","authors":"Hao Galinier, Philippe Galinier, Jin-Kao Hao","year":"1999","venue":"Journal of Combinatorial Optimization","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Garey and Johnson, 1979] Michael R Garey and David S Johnson. Computers and intractability. A Guide to the Theory of NP-completeness, 1979.","title":"Computers and intractability. A Guide to the Theory of NP-completeness","authors":"R Michael, David S Garey, Johnson","year":"1979","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Glover and Laguna, 1998] Fred Glover and Manuel La- guna. Tabu search. In Handbook of Combinatorial Op- timization, pages 2093-2229. Springer, 1998.","title":"Fred Glover and Manuel Laguna. Tabu search","authors":"Laguna Glover","year":"1998","venue":"Handbook of Combinatorial Optimization","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Gomes and Shmoys, 2002] Carla Gomes and David Shmoys. Completing quasigroups or latin squares: A structured graph coloring problem. In Proceedings of the Computational Symposium on Graph Coloring and Generalizations, pages 22-39, 2002.","title":"Completing quasigroups or latin squares: A structured graph coloring problem","authors":"Carla Gomes, David Shmoys","year":"2002","venue":"Proceedings of the Computational Symposium on Graph Coloring and Generalizations","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Hall, 1948] Marshall Hall. Distinct representatives of sub- sets. Bulletin of the American Mathematical Society, 54(10):922-926, 1948.","title":"Distinct representatives of subsets","authors":"Marshall Hall","year":"1948","venue":"Bulletin of the American Mathematical Society","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Haraguchi, 2016] Kazuya Haraguchi. Iterated local search with trellis-neighborhood for the partial latin square ex- tension problem. Journal of Heuristics, 22(5):727-757, October 2016.","title":"Iterated local search with trellis-neighborhood for the partial latin square extension problem","authors":"Kazuya Haraguchi, Haraguchi","year":"2016","venue":"Journal of Heuristics","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Hnich et al., 2004] Brahim Hnich, Barbara Smith, and Toby Walsh. Dual modelling of permutation and injection prob- lems. Journal of Artificial Intelligence Research, 21:357- 391, 2004.","title":"Dual modelling of permutation and injection problems","authors":"Brahim Hnich, Barbara Smith, Toby Walsh","year":"2004","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Jin and Hao, 2019] Yan Jin and Jin-Kao Hao. Solving the latin square completion problem by memetic graph col- oring. IEEE Transactions on Evolutionary Computation, 23(6):1015-1028, 2019.","title":"Solving the latin square completion problem by memetic graph coloring","authors":"Yan Jin, Jin-Kao Hao","year":"2019","venue":"IEEE Transactions on Evolutionary Computation","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Kautz et al., 2001] Henry Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla Gomes, Bart Selman, and Mark Stickel. Balance and filtering in structured satisfiable problems. In Proceedings of the Seventeenth International Joint Con- ference on Artificial Intelligence, IJCAI, pages 351-358, 2001.","title":"Balance and filtering in structured satisfiable problems","authors":"Henry Kautz, Yongshao Ruan, Dimitris Achlioptas, Carla Gomes, Bart Selman, Mark Stickel","year":"2001","venue":"Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2001/50"},{"position":17,"raw":"[Kumar et al., 1999] Ravi Kumar, Alexander Russell, and Ravi Sundaram. Approximating latin square extensions. Algorithmica, 24(2):128-138, 1999.","title":"Approximating latin square extensions","authors":"Ravi Kumar, Alexander Russell, Ravi Sundaram","year":"1999","venue":"Algorithmica","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Li et al., 2020] Bohan Li, Xindi Zhang, Shaowei Cai, Jinkun Lin, Yiyuan Wang, and Christian Blum. Nucds: an efficient local search algorithm for minimum con- nected dominating set. In Proceedings of the Twenty- NinthInternational Joint Conference on Artificial Intelli- gence, IJCAI, pages 1503-1510, 2020.","title":"Nucds: an efficient local search algorithm for minimum connected dominating set","authors":"Bohan Li, Xindi Zhang, Shaowei Cai, Jinkun Lin, Yiyuan Wang, Christian Blum","year":"2020","venue":"Proceedings of the Twenty-NinthInternational Joint Conference on Artificial Intelligence, IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2020/209"},{"position":19,"raw":"[López-Ibáñez et al., 2016] Manuel López-Ibáñez, Jérémie Dubois-Lacoste, Leslie Pérez Cáceres, Mauro Birattari, and Thomas Stützle. The irace package: iterated racing for automatic algorithm configuration. Operations Research Perspectives, 3:43-58, 2016.","title":"The irace package: iterated racing for automatic algorithm configuration","authors":"Manuel López-Ibáñez, Jérémie Dubois-Lacoste, Leslie Pérez Cáceres, Mauro Birattari, Thomas Stützle","year":"2016","venue":"Operations Research Perspectives","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Lovász et al., 2003] László Lovász, József Pelikán, and Katalin Vesztergombi. Discrete Mathematics: Elementary and Beyond. Springer Science & Business Media, 2003.","title":"Discrete Mathematics: Elementary and Beyond","authors":"Lovász","year":"2003","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Lü and Hao, 2012] Zhipeng Lü and Jin-Kao Hao. Adaptive neighborhood search for nurse rostering. European Jour- nal of Operational Research, 218(3):865-876, 2012.","title":"Adaptive neighborhood search for nurse rostering","authors":"Hao ; ] Zhipeng Lü, Jin-Kao Lü, Hao","year":"2012","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Pan et al., 2022] Shiwei Pan, Yiyuan Wang, and Minghao Yin. A fast local search algorithm for the latin square com- pletion problem. In Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, AAAI, pages 10327- 10335, 2022.","title":"A fast local search algorithm for the latin square completion problem","authors":"Pan","year":"2022","venue":"Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Prud'homme et al., 2019] Charles Prud'homme, Jean- Guillaume Fages, and Xavier Lorca. Choco solver. Website, March, 2019.","title":"Charles Prud'homme","authors":"Prud'homme","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Ryser, 1951] Herbert John Ryser. A combinatorial theorem with an application to latin rectangles. Proceedings of the American Mathematical Society, 2(4):550-552, 1951.","title":"A combinatorial theorem with an application to latin rectangles","authors":"Herbert John, Ryser","year":"1951","venue":"Proceedings of the American Mathematical Society","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Walsh, 2001] Toby Walsh. Permutation problems and chan- nelling constraints. In International Conference on Logic for Programming Artificial Intelligence and Reasoning, pages 377-391. Springer, 2001.","title":"Permutation problems and channelling constraints","authors":"Toby Walsh","year":"2001","venue":"International Conference on Logic for Programming Artificial Intelligence and Reasoning","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Wu and Hao, 2013] Qinghua Wu and Jin-Kao Hao. An adaptive multistart tabu search approach to solve the maxi- mum clique problem. Journal of Combinatorial Optimiza- tion, 26:86-108, 2013.","title":"An adaptive multistart tabu search approach to solve the maximum clique problem","authors":"Hao ; ] Qinghua Wu, Jin-Kao Wu, Hao","year":"2013","venue":"Journal of Combinatorial Optimization","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Zhang et al., 2022] Qingyun Zhang, Zhouxing Su, Zhipeng Lü, and Lingxiao Yang. A weighting-based tabu search algorithm for the p-next center problem. In Proceedings of the Thirty-First Joint Conference on Artificial Intelligence, IJCAI, pages 4828-4834, 2022.","title":"A weighting-based tabu search algorithm for the p-next center problem","authors":"Qingyun Zhang, Zhouxing Su, Zhipeng Lü, Lingxiao Yang","year":"2022","venue":"Proceedings of the Thirty-First Joint Conference on Artificial Intelligence, IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2022/669"}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}