{"type":"ScholarlyArticle","title":"ParaILP: A Parallel Local Search Framework for Integer Linear Programming with Cooperative Evolution Mechanism","authors":[{"name":"Peng Lin","slug":"peng-lin","given":"Peng","family":"Lin","affiliation":"Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science , Institute of Software , Chinese Academy of Sciences , Beijing , China; School of Computer Science and Technology , University of Chinese Academy of Sciences , Beijing , China"},{"name":"Mengchuan Zou","slug":"mengchuan-zou","given":"Mengchuan","family":"Zou","affiliation":"Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science , Institute of Software , Chinese Academy of Sciences , Beijing , China"},{"name":"Zhihan Chen","slug":"zhihan-chen","given":"Zhihan","family":"Chen","affiliation":"Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science , Institute of Software , Chinese Academy of Sciences , Beijing , China; School of Computer Science and Technology , University of Chinese Academy of Sciences , Beijing , China"},{"name":"Shaowei Cai","slug":"shaowei-cai","given":"Shaowei","family":"Cai","affiliation":"Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science , Institute of Software , Chinese Academy of Sciences , Beijing , China; School of Computer Science and Technology , University of Chinese Academy of Sciences , Beijing , China"}],"abstract":"The integer linear programming (ILP) problem is a fundamental research topic in operations research, and the local search method is an important class of algorithms for quickly solving many combinatorial optimization problems. With rapidly increasing computing power, parallelism turns out to be a promising approach to enhancing the efficiency of problem-solving. However, rare studies investigate parallel local search algorithms for solving the general ILP problem. We propose the first parallel local search framework (ParaILP) for solving the general ILP problem, based on two novel ideas: a new initialization method named polarity initialization to construct different initial solutions for local search threads and a cooperative evolution mechanism for managing and generating high-quality solutions using information shared by different threads. Extensive experiments demonstrate that ParaILP is significantly better than the state-of-the-art academic parallel solvers FiberSCIP and HiGHS, and is competitive with the state-of-the-art commercial parallel solver Gurobi. Experiments are also conducted to analyze the parallelization scalability and the effectiveness of our techniques.","doi":"10.24963/ijcai.2024/768","url":"https://ijcai.org/proceedings/2024/768","pdf":"https://ijcai.org/proceedings/2024/0768.pdf","markdown":"https://ijcai.org/proceedings/2024/768.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/768","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":768,"pages":{"first":6949,"last":6957},"keywords":["Search: S: Local search","Search: S: Evolutionary computation"],"videos":[],"references":[{"position":1,"raw":"[Achterberg et al., 2006] Tobias Achterberg, Thorsten Koch, and Alexander Martin. MIPLIB 2003. Oper. Res. Lett., 34(4):361-372, 2006.","title":"MIPLIB 2003","authors":"Achterberg","year":"2006","venue":"Oper. Res. Lett","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Berthold, 2013] Timo Berthold. Measuring the impact of primal heuristics. Oper. Res. Lett., 41(6):611-614, 2013.","title":"Measuring the impact of primal heuristics","authors":"Timo Berthold","year":"2013","venue":"Oper. Res. Lett","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bixby et al., 1995] Robert E Bixby, William Cook, A Cox, and Eva K Lee. Parallel mixed integer programming. Rice University Center for Research on Parallel Computation Research Monograph CRPC-TR95554, 1995.","title":"Parallel mixed integer programming","authors":"William Robert E Bixby, Cook, Eva K Cox, Lee","year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Dantzig et al., 1954] George B. Dantzig, D. Ray Fulker- son, and Selmer M. Johnson. Solution of a large-scale traveling-salesman problem. Oper. Res., 2(4):393-410, 1954.","title":"Solution of a large-scale traveling-salesman problem","authors":"George B Dantzig, D Ray Fulkerson, Selmer M Johnson","year":"1954","venue":"Oper. Res","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Dorne and Hao, 1998] Raphaël Dorne and Jin-Kao Hao. A new genetic local search algorithm for graph coloring. In A. E. Eiben, Thomas Bäck, Marc Schoenauer, and Hans- Paul Schwefel, editors, Parallel Problem Solving from Na- ture -PPSN V, 5th International Conference, Amsterdam, The Netherlands, September 27-30, 1998, Proceedings, volume 1498 of Lecture Notes in Computer Science, pages 745-754. Springer, 1998.","title":"A new genetic local search algorithm for graph coloring","authors":"Hao Dorne, Raphaël Dorne, Jin-Kao Hao","year":"1998","venue":"Parallel Problem Solving from Nature -PPSN V, 5th International Conference","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Genova and Guliashki, 2011] Krasimira Genova and Vas- sil Guliashki. Linear integer programming methods and approaches-a survey. Journal of Cybernetics and Infor- mation Technologies, 11(1), 2011.","title":"Krasimira Genova and Vassil Guliashki. Linear integer programming methods and approaches-a survey","authors":"Guliashki Genova","year":"2011","venue":"Journal of Cybernetics and Information Technologies","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Gleixner et al., 2021] Ambros M. Gleixner, Gregor Hendel, Gerald Gamrath, Tobias Achterberg, Michael Bastubbe, Timo Berthold, Philipp Christophel, Kati Jarck, Thorsten Koch, Jeff T. Linderoth, Marco E. Lübbecke, Hans D. Mittelmann, Derya B. Özyurt, Ted K. Ralphs, Domenico Salvagnin, and Yuji Shinano. MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput., 13(3):443-490, 2021.","title":"MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library","authors":"Ambros M Gleixner, Gregor Hendel, Gerald Gamrath, Tobias Achterberg, Michael Bastubbe, Timo Berthold, Philipp Christophel, Kati Jarck, Thorsten Koch, Jeff T Linderoth, Marco E Lübbecke, Hans D Mittelmann, B Derya, Ted K Özyurt, Domenico Ralphs, Yuji Salvagnin, Shinano","year":"2021","venue":"Math. Program. Comput","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Gurobi Optimization, 2022] LLC Gurobi Optimization. Gurobi optimizer ref. manual. https://www.gurobi.com, 2022. Accessed: 2023-10-28.","title":"LLC Gurobi Optimization. Gurobi optimizer ref","authors":null,"year":"2022","venue":null,"doi":null,"url":"https://www.gurobi.com,2022","internal_url":null},{"position":9,"raw":"[Huangfu and Hall, 2018] Qi Huangfu and J. A. J. Hall. Par- allelizing the dual revised simplex method. Math. Pro- gram. Comput., 10(1):119-142, 2018.","title":"Parallelizing the dual revised simplex method","authors":"Hall ; ] Qi Huangfu, J A J Huangfu, Hall","year":"2018","venue":"Math. Program. Comput","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Jacobs and Brusco, 1995] Larry W Jacobs and Michael J Brusco. Note: A local-search heuristic for large set- covering problems. Naval Research Logistics (NRL), 42(7):1129-1140, 1995.","title":"Note: A local-search heuristic for large setcovering problems","authors":"W Larry, Michael J Jacobs, Brusco","year":"1995","venue":"Naval Research Logistics (NRL)","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Kannan and Monma, 1978] Ravindran Kannan and Clyde L Monma. On the computational complexity of integer pro- gramming problems. In Optimization and Operations Re- search: Proceedings of a Workshop Held at the Univer- sity of Bonn, October 2-8, 1977, pages 161-172. Springer, 1978.","title":"On the computational complexity of integer programming problems","authors":"Ravindran Kannan, Clyde L Monma","year":"1977","venue":"Optimization and Operations Research: Proceedings of a Workshop Held at the University of Bonn","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Koch et al., 2011] Thorsten Koch, Tobias Achterberg, Er- ling Andersen, Oliver Bastert, Timo Berthold, Robert E. Bixby, Emilie Danna, Gerald Gamrath, Ambros M. Gleixner, Stefan Heinz, Andrea Lodi, Hans D. Mittel- mann, Ted K. Ralphs, Domenico Salvagnin, Daniel E. Steffy, and Kati Wolter. MIPLIB 2010. Math. Program. Comput., 3(2):103-163, 2011.","title":"MIPLIB 2010","authors":"Koch","year":"2011","venue":"Math. Program. Comput","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"Ailsa H. Land and Alison G. Doig. An automatic method for solving discrete programming problems. In Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pul- leyblank, Gerhard Reinelt, Giovanni Rinaldi, and Lau- rence A. Wolsey, editors, 50 Years of Integer Programming 1958-2008 -From the Early Years to the State-of-the-Art, pages 105-132. Springer, 2010.","title":"An automatic method for solving discrete programming problems","authors":"H Ailsa, Alison G Land, Doig","year":"2010","venue":"50 Years of Integer Programming 1958-2008 -From the Early Years to the State-of-the-Art","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Lawler and Wood, 1966] Eugene L. Lawler and D. E. Wood. Branch-and-bound methods: A survey. Oper. Res., 14(4):699-719, 1966.","title":"Branch-and-bound methods: A survey","authors":"Eugene L Lawler, D E Wood","year":"1966","venue":"Oper. Res","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Lin et al., 2023] Peng Lin, Shaowei Cai, Mengchuan Zou, and Jinkun Lin. New characterizations and efficient lo- cal search for general integer linear programming. arXiv preprint arXiv:2305.00188, 2023.","title":"New characterizations and efficient local search for general integer linear programming","authors":"Peng Lin, Shaowei Cai, Mengchuan Zou, Jinkun Lin","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"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":17,"raw":"[Merz and Freisleben, 1997] Peter Merz and Bernd Freisleben. Genetic local search for the tsp: New results. In Proceedings of 1997 Ieee International Con- ference on Evolutionary Computation (Icec'97), pages 159-164. IEEE, 1997.","title":"Genetic local search for the tsp: New results","authors":"Freisleben Merz, Peter Merz, Bernd Freisleben","year":"1997","venue":"Proceedings of 1997 Ieee International Conference on Evolutionary Computation (Icec'97)","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Roshanaei et al., 2013] V Roshanaei, Ahmed Azab, and H ElMaraghy. Mathematical modelling and a meta- heuristic for flexible job shop scheduling. International Journal of Production Research, 51(20):6247-6274, 2013.","title":"Mathematical modelling and a metaheuristic for flexible job shop scheduling","authors":"Ahmed Roshanaei, H Azab, Elmaraghy","year":"2013","venue":"International Journal of Production Research","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Shinano et al., 2018] Yuji Shinano, Stefan Heinz, Stefan Vigerske, and Michael Winkler. Fiberscip -A shared memory parallelization of SCIP. INFORMS J. Comput., 30(1):11-30, 2018.","title":"Fiberscip -A shared memory parallelization of SCIP","authors":"Yuji Shinano, Stefan Heinz, Stefan Vigerske, Michael Winkler","year":"2018","venue":"INFORMS J. Comput","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Stützle, 2006] Thomas Stützle. Iterated local search for the quadratic assignment problem. Eur. J. Oper. Res., 174(3):1519-1539, 2006.","title":"Iterated local search for the quadratic assignment problem","authors":"Thomas Stützle","year":"2006","venue":"Eur. J. Oper. Res","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Vaessens et al., 1996] Rob J. M. Vaessens, Emile H. L. Aarts, and Jan Karel Lenstra. Job shop scheduling by local search. INFORMS J. Comput., 8(3):302-317, 1996.","title":"Job shop scheduling by local search","authors":"J M Rob, Emile H L Vaessens, Jan Aarts, Lenstra Karel","year":"1996","venue":"INFORMS J. Comput","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Verachi and Prestwich, 2008] Stefania Verachi and Steven Prestwich. Constructive vs perturbative local search for general integer linear programming. In Proceedings of the Fifth International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS), 2008.","title":"Constructive vs perturbative local search for general integer linear programming","authors":"Stefania Verachi, Steven Prestwich","year":"2008","venue":"Proceedings of the Fifth International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS)","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Wolsey, 2020] Laurence A Wolsey. Integer programming. John Wiley & Sons, 2020.","title":"Integer programming","authors":"Laurence A Wolsey","year":"2020","venue":null,"doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Xu et al., 2009] Y. Xu, Ted K. Ralphs, Laszlo Ladányi, and Matthew J. Saltzman. Computational experience with a","title":"Computational experience with a","authors":"Y Xu, Ted K Ralphs, Laszlo Ladányi, Matthew J Saltzman","year":null,"venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}