A large population island framework for the unconstrained binary quadratic problem
The unconstrained binary quadratic problem is an NP-hard problem and has applications in many fields. Recently, the problem has attracted much interest in the field of quantum optimization, as it is directly related to the Ising problem in physics and the development of quantum computers. However, e...
Uložené v:
| Vydané v: | Computers & operations research Ročník 168; s. 106684 |
|---|---|
| Hlavní autori: | , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Elsevier Ltd
01.08.2024
Elsevier |
| Predmet: | |
| ISSN: | 0305-0548, 1873-765X |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | The unconstrained binary quadratic problem is an NP-hard problem and has applications in many fields. Recently, the problem has attracted much interest in the field of quantum optimization, as it is directly related to the Ising problem in physics and the development of quantum computers. However, effectively solving large instances of this problem remains a major challenge for existing solution methods. To advance the state of the art in solving the problem on a large scale, we propose an evolutionary algorithm with a very large population organized in different islands and integrating a new pairing and recombination method to produce promising offspring in each generation. Numerous experiments are conducted to evaluate the effects of different pairing strategies, crossovers, and migration topologies. This research has led to the discovery of new bounds for difficult instances of the maximum cut problem, which has been transformed using the binary quadratic formulation.
•The unconstrained binary quadratic problem has numerous applications.•We present a large population island framework for solving the problem.•We show an implementation of the framework using GPU-based parallel computing.•We report new best known results for 6 challenging maximum cut instances.•The approach can help to better solve related problems. |
|---|---|
| AbstractList | The unconstrained binary quadratic problem is an NP-hard problem and has applications in many fields. Recently, the problem has attracted much interest in the field of quantum optimization, as it is directly related to the Ising problem in physics and the development of quantum computers. However, effectively solving large instances of this problem remains a major challenge for existing solution methods. To advance the state of the art in solving the problem on a large scale, we propose an evolutionary algorithm with a very large population organized in different islands and integrating a new pairing and recombination method to produce promising offspring in each generation. Numerous experiments are conducted to evaluate the effects of different pairing strategies, crossovers, and migration topologies. This research has led to the discovery of new bounds for difficult instances of the maximum cut problem, which has been transformed using the binary quadratic formulation.
•The unconstrained binary quadratic problem has numerous applications.•We present a large population island framework for solving the problem.•We show an implementation of the framework using GPU-based parallel computing.•We report new best known results for 6 challenging maximum cut instances.•The approach can help to better solve related problems. The unconstrained binary quadratic problem is an NP-hard problem and has applications in many fields. Recently, the problem has attracted much interest in the field of quantum optimization, as it is directly related to the Ising problem in physics and the development of quantum computers. However, effectively solving large instances of this problem remains a major challenge for existing solution methods. To advance the state of the art in solving the problem on a large scale, we propose an evolutionary algorithm with a very large population organized in different islands and integrating a new pairing and recombination method to produce promising offspring in each generation. Numerous experiments are conducted to evaluate the effects of different pairing strategies, crossovers, and migration topologies. This research has led to the discovery of new bounds for difficult instances of the maximum cut problem, which has been transformed using the binary quadratic formulation. |
| ArticleNumber | 106684 |
| Author | Hao, Jin-Kao Goëffon, Adrien Goudet, Olivier |
| Author_xml | – sequence: 1 givenname: Olivier orcidid: 0000-0001-7040-5052 surname: Goudet fullname: Goudet, Olivier email: olivier.goudet@univ-angers.fr – sequence: 2 givenname: Adrien surname: Goëffon fullname: Goëffon, Adrien email: adrien.goeffon@univ-angers.fr – sequence: 3 givenname: Jin-Kao orcidid: 0000-0001-8813-4377 surname: Hao fullname: Hao, Jin-Kao email: jin-kao.hao@univ-angers.fr |
| BackLink | https://hal.science/hal-04997597$$DView record in HAL |
| BookMark | eNp9kE9LwzAYh4NMcJt-AG-5eujMn6Zp8DSGOmEgiIK3kCapy-ySmXYTv72pFQ8elsubvLzPyy_PBIx88BaAS4xmGOHiejPTIc4IInl6F0WZn4AxLjnNeMFeR2CMKGIZYnl5BiZtu0HpcILH4GkOGxXfLNyF3b5RnQseurZR3sA6qq39DPEd1iHCbm3h3uvg2y4q562BlfMqfsGPvTIxgRruYqgauz0Hp7VqWnvxW6fg5e72ebHMVo_3D4v5KtNUiC4zmClep7CqxFwrg4gtKooqxitCqRakYkRwUdaCEmx0rsv-LgSjhamwLegUXA1716qRu-i2KY0MysnlfCX7HsqF4EzwA06zeJjVMbRttPUfgJHsBcqNTAJlL1AOAhPD_zHadT-GegPNUfJmIG36_sHZKFvtrNfWuGh1J01wR-hvco6M1Q |
| CitedBy_id | crossref_primary_10_1016_j_cor_2025_107137 |
| Cites_doi | 10.1007/s10878-014-9734-0 10.1007/s10732-018-9403-z 10.1145/3514039 10.1016/j.parco.2010.04.002 10.1007/s10696-006-9011-3 10.1007/s10107-008-0235-8 10.1016/j.biosystems.2004.08.002 10.1023/B:ANOR.0000039522.58036.68 10.1007/BF01098364 10.1007/BF02115753 10.1088/0305-4470/15/10/028 10.1504/IJMHEUR.2010.034201 10.1504/IJMHEUR.2010.033120 10.1016/j.ejor.2012.07.012 10.1016/j.engappai.2012.09.001 10.1016/j.knosys.2022.109986 10.1007/s10898-011-9713-2 10.1007/s10878-005-1861-1 10.1007/BF02247879 10.1023/A:1017912624016 10.1007/s10479-016-2234-0 10.1016/j.ejor.2010.06.039 10.1007/s10559-015-9692-2 10.1002/1520-6750(199008)37:4<527::AID-NAV3220370407>3.0.CO;2-P 10.1007/s10559-010-9256-4 10.1016/j.cor.2011.12.006 10.1007/s10288-009-0115-y 10.1145/2725494.2725497 10.1080/00207729408928968 10.1007/s10479-005-3449-7 10.1016/j.cor.2010.01.015 10.1007/s10559-011-9368-5 10.1016/j.eswa.2022.118077 10.1016/S0377-2217(00)00242-3 10.1016/S0377-2217(97)00130-6 10.1007/s10732-011-9164-4 |
| ContentType | Journal Article |
| Copyright | 2024 The Author(s) Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2024 The Author(s) – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | 6I. AAFTH AAYXX CITATION 1XC |
| DOI | 10.1016/j.cor.2024.106684 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Hyper Article en Ligne (HAL) |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1873-765X |
| ExternalDocumentID | oai:HAL:hal-04997597v1 10_1016_j_cor_2024_106684 S0305054824001564 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6I. 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJOXV AKRWK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKYEP ANKPU APXCP CITATION EFKBS EFLBG ~HD 1XC |
| ID | FETCH-LOGICAL-c399t-d15a7f106a817cad02e6b30b57b233c92b529798f9321dc4c898f999536db1e63 |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001333528200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0548 |
| IngestDate | Tue Oct 14 20:31:32 EDT 2025 Sat Nov 29 03:23:47 EST 2025 Tue Nov 18 22:14:45 EST 2025 Tue Jun 18 08:52:24 EDT 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Unconstrained binary quadratic problem Evolutionary search Island model Heuristics Parallel search Combinatorial optimization Quadratic unconstrained binary optimization |
| Language | English |
| License | This is an open access article under the CC BY-NC license. Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c399t-d15a7f106a817cad02e6b30b57b233c92b529798f9321dc4c898f999536db1e63 |
| ORCID | 0000-0001-7040-5052 0000-0001-8813-4377 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.cor.2024.106684 |
| ParticipantIDs | hal_primary_oai_HAL_hal_04997597v1 crossref_primary_10_1016_j_cor_2024_106684 crossref_citationtrail_10_1016_j_cor_2024_106684 elsevier_sciencedirect_doi_10_1016_j_cor_2024_106684 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-08-01 |
| PublicationDateYYYYMMDD | 2024-08-01 |
| PublicationDate_xml | – month: 08 year: 2024 text: 2024-08-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2024 |
| Publisher | Elsevier Ltd Elsevier |
| Publisher_xml | – name: Elsevier Ltd – name: Elsevier |
| References | Kochenberger, Glover, Alidaee, Wang (b19) 2005; 10 Neven, Rose, Macready (b29) 2008 Shylo, Glover, Sergienko (b40) 2015; 51 Wang, Hao (b45) 2022 Wang, Lü, Glover, Hao (b49) 2013; 40 Samorani, Wang, Lv, Glover (b38) 2019; 25 Merz, Freisleben (b26) 1999; Vol. 1 Kochenberger, Hao, Glover, Lewis, Lü, Wang, Wang (b20) 2014; 28 Ma, Hao (b25) 2017; 248 Glover, Hao (b7) 2010; 1 Lodewijks (b22) 2019 Li, Sun, Liu (b21) 2012; 52 de Souza, Ritt (b6) 2018 Kochenberger, Glover, Alidaee, Rego (b18) 2005; 139 Lü, Glover, Hao (b24) 2011 Glover, Kochenberger, Hennig, Du (b10) 2022 Porumbel, Hao, Kuntz (b33) 2010; 37 Barahona (b3) 1982; 15 Gusmeroli, Hrga, Lužar, Povh, Siebenhofer, Wiegele (b15) 2022; 48 Glover, Hao (b8) 2010; 1 Alidaee, Kochenberger, Ahmadian (b1) 1994; 25 Merz, Freisleben (b27) 2002; 8 Whitley, Rana, Heckendorn (b50) 1999; 7 Zeng, Lü, Yu, Wu, Wang, Zhou (b51) 2022; 209 Katayama, Narihisa (b17) 2001; 134 Merz, Katayama (b28) 2004; 78 Benlic, Hao (b4) 2013; 26 Pardalos, Rodgers (b31) 1990; 45 Palubeckis (b30) 2004; 131 Shylo, Shylo (b42) 2011; 47 Boros, Hammer (b5) 1991; 33 Glover, Lü, Hao (b12) 2010; 8 Shi, Zhang, Derbel, Liefooghe (b39) 2017 Wang, Lü, Glover, Hao (b48) 2013; 19 Rendl, Rinaldi, Wiegele (b35) 2010; 121 Shylo, Shylo (b41) 2010; 46 Ronagh, Woods, Iranmanesh (b36) 2016; 16 Tinós, Renato, Whitley, Darrell, Chicano, Francisco, 2015. Partition crossover for pseudo-boolean optimization. In: Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII. pp. 137–149. Wang, Lü, Glover, Hao (b47) 2012; 223 Pardalos, Xue (b32) 1994; 4 Wang, Alidaee, Glover, Kochenberger (b44) 2006; 18 Punnen (b34) 2022 Alkhamis, Hasan, Ahmed (b2) 1998; 108 Wang, Lü, Glover, Hao (b46) 2011 Ruciński, Izzo, Biscani (b37) 2010; 36 Glover, Kochenberger, Du (b9) 2022 Kalantari, Bagchi (b16) 1990; 37 Lü, Glover, Hao (b23) 2010; 207 Goudet, Hao (b14) 2021 Goudet, Grelier, Hao (b13) 2022; 258 Glover, Laguna, Martí (b11) 2000; 29 Lodewijks (10.1016/j.cor.2024.106684_b22) 2019 Alkhamis (10.1016/j.cor.2024.106684_b2) 1998; 108 Porumbel (10.1016/j.cor.2024.106684_b33) 2010; 37 Barahona (10.1016/j.cor.2024.106684_b3) 1982; 15 Whitley (10.1016/j.cor.2024.106684_b50) 1999; 7 Zeng (10.1016/j.cor.2024.106684_b51) 2022; 209 Merz (10.1016/j.cor.2024.106684_b27) 2002; 8 Kalantari (10.1016/j.cor.2024.106684_b16) 1990; 37 10.1016/j.cor.2024.106684_b43 Wang (10.1016/j.cor.2024.106684_b46) 2011 Shylo (10.1016/j.cor.2024.106684_b42) 2011; 47 Samorani (10.1016/j.cor.2024.106684_b38) 2019; 25 Li (10.1016/j.cor.2024.106684_b21) 2012; 52 Glover (10.1016/j.cor.2024.106684_b7) 2010; 1 Lü (10.1016/j.cor.2024.106684_b23) 2010; 207 Merz (10.1016/j.cor.2024.106684_b26) 1999; Vol. 1 Kochenberger (10.1016/j.cor.2024.106684_b18) 2005; 139 Kochenberger (10.1016/j.cor.2024.106684_b19) 2005; 10 Glover (10.1016/j.cor.2024.106684_b9) 2022 Glover (10.1016/j.cor.2024.106684_b12) 2010; 8 Alidaee (10.1016/j.cor.2024.106684_b1) 1994; 25 Glover (10.1016/j.cor.2024.106684_b11) 2000; 29 Wang (10.1016/j.cor.2024.106684_b44) 2006; 18 Boros (10.1016/j.cor.2024.106684_b5) 1991; 33 Lü (10.1016/j.cor.2024.106684_b24) 2011 Merz (10.1016/j.cor.2024.106684_b28) 2004; 78 Pardalos (10.1016/j.cor.2024.106684_b31) 1990; 45 Glover (10.1016/j.cor.2024.106684_b8) 2010; 1 Shi (10.1016/j.cor.2024.106684_b39) 2017 Rendl (10.1016/j.cor.2024.106684_b35) 2010; 121 Glover (10.1016/j.cor.2024.106684_b10) 2022 Palubeckis (10.1016/j.cor.2024.106684_b30) 2004; 131 Shylo (10.1016/j.cor.2024.106684_b40) 2015; 51 Shylo (10.1016/j.cor.2024.106684_b41) 2010; 46 Neven (10.1016/j.cor.2024.106684_b29) 2008 Gusmeroli (10.1016/j.cor.2024.106684_b15) 2022; 48 Punnen (10.1016/j.cor.2024.106684_b34) 2022 Goudet (10.1016/j.cor.2024.106684_b13) 2022; 258 de Souza (10.1016/j.cor.2024.106684_b6) 2018 Kochenberger (10.1016/j.cor.2024.106684_b20) 2014; 28 Ruciński (10.1016/j.cor.2024.106684_b37) 2010; 36 Goudet (10.1016/j.cor.2024.106684_b14) 2021 Katayama (10.1016/j.cor.2024.106684_b17) 2001; 134 Wang (10.1016/j.cor.2024.106684_b45) 2022 Wang (10.1016/j.cor.2024.106684_b49) 2013; 40 Wang (10.1016/j.cor.2024.106684_b48) 2013; 19 Ronagh (10.1016/j.cor.2024.106684_b36) 2016; 16 Wang (10.1016/j.cor.2024.106684_b47) 2012; 223 Benlic (10.1016/j.cor.2024.106684_b4) 2013; 26 Ma (10.1016/j.cor.2024.106684_b25) 2017; 248 Pardalos (10.1016/j.cor.2024.106684_b32) 1994; 4 |
| References_xml | – volume: 48 start-page: 1 year: 2022 end-page: 31 ident: b15 article-title: BiqBin: a parallel branch-and-bound solver for binary quadratic problems with linear constraints publication-title: ACM Trans. Math. Softw. – volume: 25 start-page: 629 year: 2019 end-page: 642 ident: b38 article-title: Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem publication-title: J. Heuristics – volume: 4 start-page: 301 year: 1994 end-page: 328 ident: b32 article-title: The maximum clique problem publication-title: J. Global Optim. – volume: 19 start-page: 679 year: 2013 end-page: 695 ident: b48 article-title: Backbone guided tabu search for solving the UBQP problem publication-title: J. Heuristics – year: 2019 ident: b22 article-title: Mapping NP-hard and NP-complete optimisation problems to Quadratic Unconstrained Binary Optimisation problems – volume: 25 start-page: 401 year: 1994 end-page: 408 ident: b1 article-title: 0-1 quadratic programming approach for optimum solutions of two scheduling problems publication-title: Int. J. Syst. Sci. – volume: 1 start-page: 100 year: 2010 end-page: 107 ident: b8 article-title: Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems publication-title: Int. J. Metaheuristics – reference: Tinós, Renato, Whitley, Darrell, Chicano, Francisco, 2015. Partition crossover for pseudo-boolean optimization. In: Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII. pp. 137–149. – volume: 40 start-page: 3100 year: 2013 end-page: 3107 ident: b49 article-title: Probabilistic GRASP-tabu search algorithms for the UBQP problem publication-title: Comput. Oper. Res. – volume: 258 year: 2022 ident: b13 article-title: A deep learning guided memetic framework for graph coloring problems publication-title: Knowl.-Based Syst. – volume: 139 start-page: 229 year: 2005 end-page: 241 ident: b18 article-title: An unconstrained quadratic binary programming approach to the vertex coloring problem publication-title: Ann. Oper. Res. – volume: 51 start-page: 16 year: 2015 end-page: 24 ident: b40 article-title: Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel publication-title: Cybernet. Systems Anal. – volume: 223 start-page: 595 year: 2012 end-page: 604 ident: b47 article-title: Path relinking for unconstrained binary quadratic programming publication-title: European J. Oper. Res. – year: 2022 ident: b34 article-title: The Quadratic Unconstrained Binary Optimization Problem: Theory, Algorithms, and Applications – volume: 29 start-page: 653 year: 2000 end-page: 684 ident: b11 article-title: Fundamentals of scatter search and path relinking publication-title: Control Cybernet. – volume: 45 start-page: 131 year: 1990 end-page: 144 ident: b31 article-title: Computational aspects of a branch and bound algorithm for quadratic zero-one programming publication-title: Computing – volume: 15 start-page: 3241 year: 1982 ident: b3 article-title: On the computational complexity of Ising spin glass models publication-title: J. Phys. A: Math. Gen. – volume: 209 year: 2022 ident: b51 article-title: A memetic algorithm based on edge-state learning for max-cut publication-title: Expert Syst. Appl. – year: 2008 ident: b29 article-title: Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization – volume: 131 start-page: 259 year: 2004 end-page: 282 ident: b30 article-title: Multistart tabu search strategies for the unconstrained binary quadratic optimization problem publication-title: Ann. Oper. Res. – start-page: 39 year: 2022 end-page: 56 ident: b9 article-title: Applications and computational advances for solving the QUBO model publication-title: The Quadratic Unconstrained Binary Optimization Problem: Theory, Algorithms, and Applications – volume: 36 start-page: 555 year: 2010 end-page: 571 ident: b37 article-title: On the impact of the migration topology on the island model publication-title: Parallel Comput. – volume: 16 start-page: 1029 year: 2016 end-page: 1047 ident: b36 article-title: Solving constrained quadratic binary problems via quantum adiabatic evolution publication-title: Quantum Inf. Comput. – volume: 207 start-page: 1254 year: 2010 end-page: 1262 ident: b23 article-title: A hybrid metaheuristic approach to solving the UBQP problem publication-title: European J. Oper. Res. – volume: 121 start-page: 307 year: 2010 end-page: 335 ident: b35 article-title: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations publication-title: Math. Program. – start-page: 1 year: 2022 end-page: 43 ident: b10 article-title: Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models publication-title: Ann. Oper. Res. – start-page: 49 year: 2011 end-page: 61 ident: b24 article-title: Neighborhood combination for unconstrained binary quadratic problems publication-title: MIC Post-Conference Book – start-page: 557 year: 2017 end-page: 564 ident: b39 article-title: A parallel tabu search for the unconstrained binary quadratic programming problem publication-title: 2017 IEEE Congress on Evolutionary Computation – volume: 33 start-page: 151 year: 1991 end-page: 180 ident: b5 article-title: The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds publication-title: Ann. Oper. Res. – start-page: 72 year: 2011 end-page: 83 ident: b46 article-title: Effective variable fixing and scoring strategies for binary quadratic programming publication-title: Proceedings of the 11th European Conference Evolutionary Computation in Combinatorial Optimization, Torino, Italy, April 27-29, 2011 – volume: 8 start-page: 239 year: 2010 end-page: 253 ident: b12 article-title: Diversification-driven tabu search for unconstrained binary quadratic problems publication-title: 4OR – volume: 52 start-page: 797 year: 2012 end-page: 829 ident: b21 article-title: An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach publication-title: J. Global Optim. – volume: 248 start-page: 365 year: 2017 end-page: 403 ident: b25 article-title: A multiple search operator heuristic for the max-k-cut problem publication-title: Ann. Oper. Res. – volume: 46 start-page: 744 year: 2010 end-page: 754 ident: b41 article-title: Solving the maxcut problem by the global equilibrium search publication-title: Cybernet. Systems Anal. – volume: 47 start-page: 889 year: 2011 end-page: 897 ident: b42 article-title: Systems analysis; solving unconstrained binary quadratic programming problem by global equilibrium search publication-title: Cybernet. Systems Anal. – volume: 37 start-page: 527 year: 1990 end-page: 538 ident: b16 article-title: An algorithm for quadratic zero-one programs publication-title: Naval Res. Logist. – volume: 37 start-page: 1822 year: 2010 end-page: 1832 ident: b33 article-title: An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring publication-title: Comput. Oper. Res. – volume: 8 start-page: 197 year: 2002 end-page: 213 ident: b27 article-title: Greedy and local search heuristics for unconstrained binary quadratic programming publication-title: J. Heuristics – volume: 18 start-page: 77 year: 2006 end-page: 97 ident: b44 article-title: Solving group technology problems via clique partitioning publication-title: Int. J. Flexible Manuf. Syst. – volume: 28 start-page: 58 year: 2014 end-page: 81 ident: b20 article-title: The unconstrained binary quadratic programming problem: a survey publication-title: J. Comb. Optim. – volume: 10 start-page: 77 year: 2005 end-page: 92 ident: b19 article-title: Clustering of microarray data via clique partitioning publication-title: J. Comb. Optim. – volume: 78 start-page: 99 year: 2004 end-page: 118 ident: b28 article-title: Memetic algorithms for the unconstrained binary quadratic programming problem publication-title: BioSystems – volume: 134 start-page: 103 year: 2001 end-page: 119 ident: b17 article-title: Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem publication-title: European J. Oper. Res. – volume: 108 start-page: 641 year: 1998 end-page: 652 ident: b2 article-title: Simulated annealing for the unconstrained quadratic pseudo-Boolean function publication-title: European J. Oper. Res. – volume: 7 start-page: 33 year: 1999 end-page: 47 ident: b50 article-title: The island model genetic algorithm: On separability, population size and convergence publication-title: J. Comput. Inf. Technol. – volume: Vol. 1 start-page: 417 year: 1999 end-page: 424 ident: b26 article-title: Genetic algorithms for binary quadratic programming publication-title: Proceedings of the 1999 Genetic and Evolutionary Computation Conference – start-page: 241 year: 2022 end-page: 259 ident: b45 article-title: Metaheuristic algorithms publication-title: The Quadratic Unconstrained Binary Optimization Problem: Theory, Algorithms, and Applications – volume: 1 start-page: 3 year: 2010 end-page: 10 ident: b7 article-title: Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems publication-title: Int. J. Metaheuristics – start-page: 67 year: 2018 end-page: 84 ident: b6 article-title: Automatic grammar-based design of heuristic algorithms for unconstrained binary quadratic programming publication-title: Proceedings of 18th European Conference on Evolutionary Computation in Combinatorial Optimization, Parma, Italy, April 4–6, 2018 – volume: 26 start-page: 1162 year: 2013 end-page: 1173 ident: b4 article-title: Breakout local search for the max-cutproblem publication-title: Eng. Appl. Artif. Intell. – year: 2021 ident: b14 article-title: Massively parallel hybrid search for the partial Latin square extension problem – volume: 28 start-page: 58 issue: 1 year: 2014 ident: 10.1016/j.cor.2024.106684_b20 article-title: The unconstrained binary quadratic programming problem: a survey publication-title: J. Comb. Optim. doi: 10.1007/s10878-014-9734-0 – volume: 25 start-page: 629 issue: 4 year: 2019 ident: 10.1016/j.cor.2024.106684_b38 article-title: Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem publication-title: J. Heuristics doi: 10.1007/s10732-018-9403-z – volume: Vol. 1 start-page: 417 year: 1999 ident: 10.1016/j.cor.2024.106684_b26 article-title: Genetic algorithms for binary quadratic programming – volume: 16 start-page: 1029 issue: 11–12 year: 2016 ident: 10.1016/j.cor.2024.106684_b36 article-title: Solving constrained quadratic binary problems via quantum adiabatic evolution publication-title: Quantum Inf. Comput. – volume: 48 start-page: 1 issue: 2 year: 2022 ident: 10.1016/j.cor.2024.106684_b15 article-title: BiqBin: a parallel branch-and-bound solver for binary quadratic problems with linear constraints publication-title: ACM Trans. Math. Softw. doi: 10.1145/3514039 – volume: 36 start-page: 555 issue: 10–11 year: 2010 ident: 10.1016/j.cor.2024.106684_b37 article-title: On the impact of the migration topology on the island model publication-title: Parallel Comput. doi: 10.1016/j.parco.2010.04.002 – volume: 18 start-page: 77 issue: 2 year: 2006 ident: 10.1016/j.cor.2024.106684_b44 article-title: Solving group technology problems via clique partitioning publication-title: Int. J. Flexible Manuf. Syst. doi: 10.1007/s10696-006-9011-3 – volume: 121 start-page: 307 year: 2010 ident: 10.1016/j.cor.2024.106684_b35 article-title: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations publication-title: Math. Program. doi: 10.1007/s10107-008-0235-8 – volume: 78 start-page: 99 issue: 1–3 year: 2004 ident: 10.1016/j.cor.2024.106684_b28 article-title: Memetic algorithms for the unconstrained binary quadratic programming problem publication-title: BioSystems doi: 10.1016/j.biosystems.2004.08.002 – volume: 131 start-page: 259 year: 2004 ident: 10.1016/j.cor.2024.106684_b30 article-title: Multistart tabu search strategies for the unconstrained binary quadratic optimization problem publication-title: Ann. Oper. Res. doi: 10.1023/B:ANOR.0000039522.58036.68 – volume: 4 start-page: 301 issue: 3 year: 1994 ident: 10.1016/j.cor.2024.106684_b32 article-title: The maximum clique problem publication-title: J. Global Optim. doi: 10.1007/BF01098364 – volume: 33 start-page: 151 issue: 3 year: 1991 ident: 10.1016/j.cor.2024.106684_b5 article-title: The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds publication-title: Ann. Oper. Res. doi: 10.1007/BF02115753 – volume: 15 start-page: 3241 issue: 10 year: 1982 ident: 10.1016/j.cor.2024.106684_b3 article-title: On the computational complexity of Ising spin glass models publication-title: J. Phys. A: Math. Gen. doi: 10.1088/0305-4470/15/10/028 – start-page: 67 year: 2018 ident: 10.1016/j.cor.2024.106684_b6 article-title: Automatic grammar-based design of heuristic algorithms for unconstrained binary quadratic programming – volume: 1 start-page: 100 issue: 2 year: 2010 ident: 10.1016/j.cor.2024.106684_b8 article-title: Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems publication-title: Int. J. Metaheuristics doi: 10.1504/IJMHEUR.2010.034201 – volume: 29 start-page: 653 issue: 3 year: 2000 ident: 10.1016/j.cor.2024.106684_b11 article-title: Fundamentals of scatter search and path relinking publication-title: Control Cybernet. – volume: 1 start-page: 3 issue: 1 year: 2010 ident: 10.1016/j.cor.2024.106684_b7 article-title: Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems publication-title: Int. J. Metaheuristics doi: 10.1504/IJMHEUR.2010.033120 – volume: 223 start-page: 595 issue: 3 year: 2012 ident: 10.1016/j.cor.2024.106684_b47 article-title: Path relinking for unconstrained binary quadratic programming publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2012.07.012 – volume: 26 start-page: 1162 issue: 3 year: 2013 ident: 10.1016/j.cor.2024.106684_b4 article-title: Breakout local search for the max-cutproblem publication-title: Eng. Appl. Artif. Intell. doi: 10.1016/j.engappai.2012.09.001 – volume: 258 year: 2022 ident: 10.1016/j.cor.2024.106684_b13 article-title: A deep learning guided memetic framework for graph coloring problems publication-title: Knowl.-Based Syst. doi: 10.1016/j.knosys.2022.109986 – start-page: 39 year: 2022 ident: 10.1016/j.cor.2024.106684_b9 article-title: Applications and computational advances for solving the QUBO model – year: 2019 ident: 10.1016/j.cor.2024.106684_b22 – volume: 52 start-page: 797 issue: 4 year: 2012 ident: 10.1016/j.cor.2024.106684_b21 article-title: An exact solution method for unconstrained quadratic 0–1 programming: a geometric approach publication-title: J. Global Optim. doi: 10.1007/s10898-011-9713-2 – volume: 7 start-page: 33 issue: 1 year: 1999 ident: 10.1016/j.cor.2024.106684_b50 article-title: The island model genetic algorithm: On separability, population size and convergence publication-title: J. Comput. Inf. Technol. – start-page: 49 year: 2011 ident: 10.1016/j.cor.2024.106684_b24 article-title: Neighborhood combination for unconstrained binary quadratic problems – start-page: 557 year: 2017 ident: 10.1016/j.cor.2024.106684_b39 article-title: A parallel tabu search for the unconstrained binary quadratic programming problem – volume: 10 start-page: 77 issue: 1 year: 2005 ident: 10.1016/j.cor.2024.106684_b19 article-title: Clustering of microarray data via clique partitioning publication-title: J. Comb. Optim. doi: 10.1007/s10878-005-1861-1 – volume: 45 start-page: 131 issue: 2 year: 1990 ident: 10.1016/j.cor.2024.106684_b31 article-title: Computational aspects of a branch and bound algorithm for quadratic zero-one programming publication-title: Computing doi: 10.1007/BF02247879 – year: 2021 ident: 10.1016/j.cor.2024.106684_b14 – volume: 8 start-page: 197 year: 2002 ident: 10.1016/j.cor.2024.106684_b27 article-title: Greedy and local search heuristics for unconstrained binary quadratic programming publication-title: J. Heuristics doi: 10.1023/A:1017912624016 – volume: 248 start-page: 365 issue: 1 year: 2017 ident: 10.1016/j.cor.2024.106684_b25 article-title: A multiple search operator heuristic for the max-k-cut problem publication-title: Ann. Oper. Res. doi: 10.1007/s10479-016-2234-0 – year: 2022 ident: 10.1016/j.cor.2024.106684_b34 – volume: 207 start-page: 1254 issue: 3 year: 2010 ident: 10.1016/j.cor.2024.106684_b23 article-title: A hybrid metaheuristic approach to solving the UBQP problem publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2010.06.039 – volume: 51 start-page: 16 issue: 1 year: 2015 ident: 10.1016/j.cor.2024.106684_b40 article-title: Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel publication-title: Cybernet. Systems Anal. doi: 10.1007/s10559-015-9692-2 – start-page: 72 year: 2011 ident: 10.1016/j.cor.2024.106684_b46 article-title: Effective variable fixing and scoring strategies for binary quadratic programming – volume: 37 start-page: 527 issue: 4 year: 1990 ident: 10.1016/j.cor.2024.106684_b16 article-title: An algorithm for quadratic zero-one programs publication-title: Naval Res. Logist. doi: 10.1002/1520-6750(199008)37:4<527::AID-NAV3220370407>3.0.CO;2-P – volume: 46 start-page: 744 year: 2010 ident: 10.1016/j.cor.2024.106684_b41 article-title: Solving the maxcut problem by the global equilibrium search publication-title: Cybernet. Systems Anal. doi: 10.1007/s10559-010-9256-4 – volume: 40 start-page: 3100 issue: 12 year: 2013 ident: 10.1016/j.cor.2024.106684_b49 article-title: Probabilistic GRASP-tabu search algorithms for the UBQP problem publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2011.12.006 – volume: 8 start-page: 239 issue: 3 year: 2010 ident: 10.1016/j.cor.2024.106684_b12 article-title: Diversification-driven tabu search for unconstrained binary quadratic problems publication-title: 4OR doi: 10.1007/s10288-009-0115-y – start-page: 1 year: 2022 ident: 10.1016/j.cor.2024.106684_b10 article-title: Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models publication-title: Ann. Oper. Res. – ident: 10.1016/j.cor.2024.106684_b43 doi: 10.1145/2725494.2725497 – volume: 25 start-page: 401 issue: 2 year: 1994 ident: 10.1016/j.cor.2024.106684_b1 article-title: 0-1 quadratic programming approach for optimum solutions of two scheduling problems publication-title: Int. J. Syst. Sci. doi: 10.1080/00207729408928968 – volume: 139 start-page: 229 issue: 1 year: 2005 ident: 10.1016/j.cor.2024.106684_b18 article-title: An unconstrained quadratic binary programming approach to the vertex coloring problem publication-title: Ann. Oper. Res. doi: 10.1007/s10479-005-3449-7 – volume: 37 start-page: 1822 issue: 10 year: 2010 ident: 10.1016/j.cor.2024.106684_b33 article-title: An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2010.01.015 – volume: 47 start-page: 889 issue: 6 year: 2011 ident: 10.1016/j.cor.2024.106684_b42 article-title: Systems analysis; solving unconstrained binary quadratic programming problem by global equilibrium search publication-title: Cybernet. Systems Anal. doi: 10.1007/s10559-011-9368-5 – volume: 209 year: 2022 ident: 10.1016/j.cor.2024.106684_b51 article-title: A memetic algorithm based on edge-state learning for max-cut publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2022.118077 – year: 2008 ident: 10.1016/j.cor.2024.106684_b29 – start-page: 241 year: 2022 ident: 10.1016/j.cor.2024.106684_b45 article-title: Metaheuristic algorithms – volume: 134 start-page: 103 issue: 1 year: 2001 ident: 10.1016/j.cor.2024.106684_b17 article-title: Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem publication-title: European J. Oper. Res. doi: 10.1016/S0377-2217(00)00242-3 – volume: 108 start-page: 641 issue: 3 year: 1998 ident: 10.1016/j.cor.2024.106684_b2 article-title: Simulated annealing for the unconstrained quadratic pseudo-Boolean function publication-title: European J. Oper. Res. doi: 10.1016/S0377-2217(97)00130-6 – volume: 19 start-page: 679 year: 2013 ident: 10.1016/j.cor.2024.106684_b48 article-title: Backbone guided tabu search for solving the UBQP problem publication-title: J. Heuristics doi: 10.1007/s10732-011-9164-4 |
| SSID | ssj0000721 |
| Score | 2.440376 |
| Snippet | The unconstrained binary quadratic problem is an NP-hard problem and has applications in many fields. Recently, the problem has attracted much interest in the... |
| SourceID | hal crossref elsevier |
| SourceType | Open Access Repository Enrichment Source Index Database Publisher |
| StartPage | 106684 |
| SubjectTerms | Combinatorial optimization Computer Science Evolutionary search Heuristics Island model Parallel search Quadratic unconstrained binary optimization Unconstrained binary quadratic problem |
| Title | A large population island framework for the unconstrained binary quadratic problem |
| URI | https://dx.doi.org/10.1016/j.cor.2024.106684 https://hal.science/hal-04997597 |
| Volume | 168 |
| WOSCitedRecordID | wos001333528200001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Zb9QwELboFiF44FhALZcsxBOroE3ixPZjQIVyqCAo0r5FiZ2IrVbZ7R5Vfz4zvrItogIkXqLIm9hZz5fxZDzzDSEvkkrDuiDzKBOSRYzrNBJMKVCGohZpm-csU6bYBD86EpOJ_OKyS1amnADvOnF-Lhf_VdTQBsLG1Nm_EHfoFBrgHIQORxA7HP9I8MVohtHdo0UozTWarjB-cdT6QKwQWwiLGtqHWCYCLVGbm3u6qfTSELm6ajPbBqyvArEymJkvmqWLpXOsQcG7_G6-0Xaj4_Nsiotv_4PZnH_dtq6ctUaq5V4T2q2gaRd9rObbPomEhYg45yjzyTJ9ZJJJ0MI4wcwSa75qrL4VPI14nk0uKGRbaOcX5W79DCcgGyRyTRi05LktMHeJM_sbjoVDYYQs0uHskN2EZ1IMyG7x_mDyoV-suUnNC8_mN75NCOClgX5nuuz88E54Y5Qc3yW33dcELSwK7pFrTTckN3wyw5Dc8eKiTocPya0tBsr75GtBDVpojxZq0UIDWiighQJa6AW0UIsWGtBCHVoekO9vD47fHEauzEakwDpdRzrOKt7CX6xEzFWlx0mT1-m4znidpKmSSZ0lkkvRgqkfa8WUwHOJ-_66jps8fUgG3bxr9gg1eV8qrVWsBWvSTCLDG2eaj6Fb1bT7ZOxnsFSOgx6felb6YMOTEia9xEkv7aTvk5fhloUlYLnqYubFUjoL0lqGJWDoqtuegwhD98i4flh8KrENPQIAHH4WP_q3vh-Tm_0b8oQM1stN85RcV2fr6Wr5zMHxJ3zrnr8 |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+large+population+island+framework+for+the+unconstrained+binary+quadratic+problem&rft.jtitle=Computers+%26+operations+research&rft.au=Goudet%2C+Olivier&rft.au=Go%C3%ABffon%2C+Adrien&rft.au=Hao%2C+Jin-Kao&rft.date=2024-08-01&rft.pub=Elsevier+Ltd&rft.issn=0305-0548&rft.eissn=1873-765X&rft.volume=168&rft_id=info:doi/10.1016%2Fj.cor.2024.106684&rft.externalDocID=S0305054824001564 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |