Solution‐based versus attribute‐based tabu search for binary integer programming
Tabu search is one of the most commonly used local search‐based metaheuristics. A key component of the search is the tabu criterion, which controls whether it should be prohibited to make certain moves relative to the current solution. While attribute‐based tabu criteria have been dominant for decad...
Gespeichert in:
| Veröffentlicht in: | International transactions in operational research Jg. 32; H. 6; S. 3780 - 3800 |
|---|---|
| Hauptverfasser: | , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Oxford
Blackwell Publishing Ltd
01.11.2025
|
| Schlagworte: | |
| ISSN: | 0969-6016, 1475-3995 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Tabu search is one of the most commonly used local search‐based metaheuristics. A key component of the search is the tabu criterion, which controls whether it should be prohibited to make certain moves relative to the current solution. While attribute‐based tabu criteria have been dominant for decades, an alternative has received increased attention lately. Using a set of hash functions to map solutions onto hash values, a solution‐based tabu criterion has been used successfully, in particular for optimization problems involving binary variables. This paper compares the performance of solution‐based and attribute‐based tabu search on the general binary integer programming problem. According to computational experiments conducted on a sample of 160 benchmark instances, there is no statistically significant difference between the performances of solution‐based tabu search and attribute‐based tabu search. |
|---|---|
| AbstractList | Tabu search is one of the most commonly used local search‐based metaheuristics. A key component of the search is the tabu criterion, which controls whether it should be prohibited to make certain moves relative to the current solution. While attribute‐based tabu criteria have been dominant for decades, an alternative has received increased attention lately. Using a set of hash functions to map solutions onto hash values, a solution‐based tabu criterion has been used successfully, in particular for optimization problems involving binary variables. This paper compares the performance of solution‐based and attribute‐based tabu search on the general binary integer programming problem. According to computational experiments conducted on a sample of 160 benchmark instances, there is no statistically significant difference between the performances of solution‐based tabu search and attribute‐based tabu search. Tabu search is one of the most commonly used local search‐based metaheuristics. A key component of the search is the tabu criterion, which controls whether it should be prohibited to make certain moves relative to the current solution. While attribute‐based tabu criteria have been dominant for decades, an alternative has received increased attention lately. Using a set of hash functions to map solutions onto hash values, a solution‐based tabu criterion has been used successfully, in particular for optimization problems involving binary variables. This paper compares the performance of solution‐based and attribute‐based tabu search on the general binary integer programming problem. According to computational experiments conducted on a sample of 160 benchmark instances, there is no statistically significant difference between the performances of solution‐based tabu search and attribute‐based tabu search. |
| Author | Danielsen, Ketil Hvattum, Lars Magnus |
| Author_xml | – sequence: 1 givenname: Ketil surname: Danielsen fullname: Danielsen, Ketil email: ketil.danielsen@himolde.no organization: Molde University College – sequence: 2 givenname: Lars Magnus orcidid: 0000-0003-0490-9978 surname: Hvattum fullname: Hvattum, Lars Magnus email: hvattum@himolde.no organization: Molde University College |
| BookMark | eNp9kM9KAzEQxoMo2FYvPsGCN2Fr0nQ3m6MU_xQKBa3nMJudrSntpiZZpTcfwWf0SUxd8SDiXGZgft98w9cnh41tkJAzRocs1qUJ1g0FpYwdkB4biyzlUmaHpEdlLtOcsvyY9L1f0YhkTPTI4sGu22Bs8_H2XoLHKnlB51ufQAjOlG3An0WAsk08gtNPSW1dUpoG3C4xTcAlumTr7NLBZmOa5Qk5qmHt8fS7D8jjzfVicpfO5rfTydUs1VyOWSorzcoRZJJDocdxLoBqKDPNNRYSgIsaINcasaJcUlFoLhAEr4o8Po8VH5Dz7m70fm7RB7WyrWuipeKjUSGzjAsaqYuO0s5677BWW2c28XXFqNqnpvapqa_UIkx_wdoE2AcUHJj13xLWSV7NGnf_HFfTxfy-03wCdkmF9A |
| CitedBy_id | crossref_primary_10_3390_electronics14132642 |
| Cites_doi | 10.13164/mendel.2020.1.023 10.1016/j.ejor.2016.10.035 10.1016/0377-2217(95)00249-9 10.1023/A:1009642405419 10.1137/S1052623497328987 10.1016/j.orp.2016.09.002 10.1016/j.asoc.2021.107260 10.1016/j.ins.2018.01.026 10.1007/s10732-021-09466-0 10.1016/j.orl.2013.08.007 10.1287/ijoc.1030.0050 10.1023/A:1023717307746 10.1287/ijoc.1080.0275 10.1016/j.ejor.2020.10.045 10.1016/j.ejor.2024.04.004 10.1016/j.ejor.2014.09.058 10.1016/j.cor.2020.105155 10.1016/j.ins.2018.02.006 10.4018/IJAMC.2016100103 10.1016/j.cor.2016.02.016 10.1007/s12532-011-0025-9 10.1016/j.cor.2021.105427 10.1007/s10732-018-9377-x 10.1016/j.ejor.2018.10.001 10.1016/j.eswa.2023.119856 10.1109/ACCESS.2019.2959315 10.1016/j.eswa.2023.121477 10.1016/j.ejor.2023.01.030 10.1007/978-1-4615-4102-8_1 10.1007/978-1-4615-6089-0 10.1007/s12532-023-00234-8 10.1080/1055678021000090033 10.1016/j.swevo.2011.02.002 10.1016/j.eswa.2020.113802 10.1145/2541012.2541014 10.1080/15458830.1996.11770707 10.1504/IJMHEUR.2022.127813 10.1016/j.ejco.2022.100028 10.1504/IJMHEUR.2024.10066097 10.1007/BF02022565 |
| ContentType | Journal Article |
| Copyright | 2025 International Federation of Operational Research Societies. |
| Copyright_xml | – notice: 2025 International Federation of Operational Research Societies. |
| DBID | AAYXX CITATION 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D |
| DOI | 10.1111/itor.70011 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Mechanical & Transportation Engineering Abstracts Technology Research Database Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Mechanical & Transportation Engineering Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | CrossRef Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1475-3995 |
| EndPage | 3800 |
| ExternalDocumentID | 10_1111_itor_70011 ITOR70011 |
| Genre | researchArticle |
| GroupedDBID | --K .3N .GA .Y3 05W 0R~ 10A 1B1 1OC 1XV 29J 31~ 33P 4.4 50Y 50Z 51W 51Y 52M 52O 52Q 52S 52T 52U 52W 5GY 5HH 5LA 5VS 66C 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 8VB 930 A04 AABNI AAEDT AAESR AAHHS AAHQN AALRI AAMNL AANHP AAONW AAOUF AAQFI AAQXK AASGY AAXRX AAXUO AAYCA AAZKR ABCQN ABCUV ABEML ABJNI ABPVW ABSOO ABWVN ACAHQ ACBKW ACBWZ ACCFJ ACCZN ACGFS ACHQT ACIWK ACPOU ACRPL ACSCC ACVFH ACXQS ACYXJ ADBBV ADCNI ADEMA ADEOM ADIZJ ADKYN ADMGS ADMUD ADNMO ADXAS ADZMN ADZOD AEEZP AEIGN AEIMD AEMOZ AENEX AEQDE AEUPX AEUYR AEYWJ AFBPY AFEBI AFFPM AFGKR AFKFF AFPUW AFWVQ AFZJQ AGHNM AGQPQ AHBTC AHQJS AIURR AIWBW AJBDE AKVCP ALAGY ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMVHM AMYDB ASPBG ASTYK AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BMXJE BNVMJ BQESF BROTX BRXPI BY8 CAG COF CS3 D-C D-D DCZOG DPXWK DR2 DRFUL DRSSH DU5 EBA EBO EBR EBS EBU EJD EMK F00 F01 F5P FDB FEDTE FGOYB FIRID G-S G.N G50 GODZA HGLYW HVGLF HZI HZ~ I-F IHE IX1 J0M K1G K48 LATKE LC2 LC4 LEEKS LG8 LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES M41 MEWTI MK4 MRFUL MRSSH MSFUL MSSSH MXFUL MXSSH N04 N06 N9A NF~ NQ- O66 O9- OIG P2P P2W P2Y P4C PQQKQ Q.N Q11 QB0 QWB R.K R2- RIG ROL RPZ RX1 SEW SUPJJ TH9 UB1 UHS W8V W99 WBKPD WEBCB WIH WII WOHZO WQZ WSUWO WXSBR XG1 ZL0 ZZTAW ~IA ~WP 9DU AAMMB AAYXX AEFGJ AGXDD AIDQK AIDYY CITATION O8X 7SC 7TB 8FD FR3 JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c3941-9dc1b2a593a8c4c1b8a0cab5c3ce89aa37faa6cceed039078c37ea73d86151ed3 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001435679600001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0969-6016 |
| IngestDate | Mon Aug 04 05:10:42 EDT 2025 Sat Nov 29 07:45:57 EST 2025 Tue Nov 18 22:11:26 EST 2025 Tue Jun 10 09:20:17 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c3941-9dc1b2a593a8c4c1b8a0cab5c3ce89aa37faa6cceed039078c37ea73d86151ed3 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0003-0490-9978 |
| OpenAccessLink | https://onlinelibrary.wiley.com/doi/pdfdirect/10.1111/itor.70011 |
| PQID | 3228955370 |
| PQPubID | 45259 |
| PageCount | 21 |
| ParticipantIDs | proquest_journals_3228955370 crossref_primary_10_1111_itor_70011 crossref_citationtrail_10_1111_itor_70011 wiley_primary_10_1111_itor_70011_ITOR70011 |
| PublicationCentury | 2000 |
| PublicationDate | November 2025 |
| PublicationDateYYYYMMDD | 2025-11-01 |
| PublicationDate_xml | – month: 11 year: 2025 text: November 2025 |
| PublicationDecade | 2020 |
| PublicationPlace | Oxford |
| PublicationPlace_xml | – name: Oxford |
| PublicationTitle | International transactions in operational research |
| PublicationYear | 2025 |
| Publisher | Blackwell Publishing Ltd |
| Publisher_xml | – name: Blackwell Publishing Ltd |
| References | 2019; 7 2021; 27 2009; 21 2011; 1 1996a; 95 2023; 15 2021a; 165 2023; 223 2021; 127 2015; 242 2002; 7 2013; 41 1993; 41 1997 2002; 2 2023; 308 2016; 72 1993 2025 2011; 3 2017; 258 2018; 24 2025; 321 2013; 18 2018b; 441 2016; 7 2016; 3 2021; 135 2024; 237 2020 2000; 10 2022; 8 1996b; 28 2018a; 436 2021b; 105 2003; 9 1979; 6 2021; 292 2020; 26 2022; 10 2005; 17 1998; 4 2019; 274 e_1_2_7_6_1 e_1_2_7_5_1 e_1_2_7_4_1 e_1_2_7_3_1 e_1_2_7_9_1 e_1_2_7_8_1 e_1_2_7_7_1 e_1_2_7_18_1 e_1_2_7_17_1 e_1_2_7_16_1 e_1_2_7_40_1 e_1_2_7_2_1 e_1_2_7_15_1 Khan S. (e_1_2_7_24_1) 2002; 2 e_1_2_7_41_1 e_1_2_7_14_1 Glover F. (e_1_2_7_19_1) 1993 Holm S. (e_1_2_7_22_1) 1979; 6 e_1_2_7_42_1 e_1_2_7_13_1 e_1_2_7_43_1 e_1_2_7_12_1 e_1_2_7_44_1 e_1_2_7_11_1 e_1_2_7_45_1 e_1_2_7_10_1 e_1_2_7_26_1 e_1_2_7_27_1 e_1_2_7_28_1 e_1_2_7_29_1 e_1_2_7_30_1 e_1_2_7_25_1 e_1_2_7_31_1 e_1_2_7_32_1 e_1_2_7_23_1 e_1_2_7_33_1 e_1_2_7_34_1 e_1_2_7_21_1 e_1_2_7_35_1 e_1_2_7_20_1 e_1_2_7_36_1 e_1_2_7_37_1 e_1_2_7_38_1 e_1_2_7_39_1 |
| References_xml | – year: 2025 article-title: Testing initial solutions in a variable neighborhood search for binary integer programming problems publication-title: International Journal of Metaheuristics – volume: 27 start-page: 459 issue: 3 year: 2021 end-page: 496 article-title: Weighted proximity search publication-title: Journal of Heuristics – volume: 41 start-page: 123 issue: 2 year: 1993 end-page: 137 article-title: Hashing vectors for tabu search publication-title: Annals of Operations Research – volume: 7 start-page: 181357 year: 2019 end-page: 181368 article-title: A tabu search approach with dynamical neighborhood size for solving the maximum min‐sum dispersion problem publication-title: IEEE Access – volume: 26 start-page: 23 year: 2020 end-page: 29 article-title: Combining solutions of the optimum satisfiability problem using evolutionary tunneling publication-title: MENDEL – volume: 258 start-page: 829 issue: 3 year: 2017 end-page: 843 article-title: Effective metaheuristic algorithms for the minimum differential dispersion problem publication-title: European Journal of Operational Research – volume: 237 year: 2024 article-title: Solving the incremental graph drawing problem by multiple neighborhood solution‐based tabu search algorithm publication-title: Expert Systems with Applications – volume: 274 start-page: 35 issue: 1 year: 2019 end-page: 48 article-title: Two‐stage solution based tabu search for the multidemand multidimensional knapsack problem publication-title: European Journal of Operational Research – volume: 2 start-page: 157 issue: 1 year: 2002 end-page: 178 article-title: Solving the knapsack problem for adaptive multimedia system publication-title: Studia Informatica Universalis – volume: 72 start-page: 118 year: 2016 end-page: 127 article-title: A tabu search based memetic algorithm for the max‐mean dispersion problem publication-title: Computers & Operations Research – volume: 165 year: 2021a article-title: Kernel based tabu search for the set‐union knapsack problem publication-title: Expert Systems with Applications – volume: 441 start-page: 79 year: 2018b end-page: 94 article-title: Solution‐based tabu search for the maximum min‐sum dispersion problem publication-title: Information Sciences – volume: 18 start-page: 51 issue: 4 year: 2013 article-title: A fast and scalable multi‐dimensional multiple‐choice knapsack heuristic publication-title: ACM Transactions on Design Automation of Electronic Systems – volume: 28 start-page: 617 issue: 8 year: 1996b end-page: 629 article-title: Solving the traveling‐salesman problem with time windows using tabu search publication-title: IIE Transactions – volume: 4 start-page: 63 issue: 1 year: 1998 end-page: 86 article-title: A genetic algorithm for the multidimensional knapsack problem publication-title: Journal of Heuristics – volume: 321 start-page: 345 issue: 2 year: 2025 end-page: 362 article-title: Fifty years of metaheuristics publication-title: European Journal of Operational Research – volume: 308 start-page: 1056 issue: 3 year: 2023 end-page: 1073 article-title: The board packing problem publication-title: European Journal of Operational Research – volume: 7 start-page: 39 issue: 4 year: 2016 end-page: 49 article-title: On the value of aspiration criteria in tabu search publication-title: International Journal of Applied Metaheuristic Computing – volume: 15 start-page: 365 year: 2023 end-page: 388 article-title: Feasibility jump: an LP‐free Lagrangian MIP heuristic publication-title: Mathematical Programming Computation – volume: 3 start-page: 43 year: 2016 end-page: 58 article-title: The irace package: Iterated racing for automatic algorithm configuration publication-title: Operations Research Perspectives – volume: 41 start-page: 611 year: 2013 end-page: 614 article-title: Measuring the impact of primal heuristics publication-title: Operations Research Letters – volume: 223 year: 2023 article-title: Solution‐based tabu search for the capacitated dispersion problem publication-title: Expert Systems with Applications – volume: 135 year: 2021 article-title: A two‐phase intensification tabu search algorithm for the maximum min‐sum dispersion problem publication-title: Computers & Operations Research – volume: 21 start-page: 26 year: 2009 end-page: 38 article-title: Advanced scatter search for the max‐cut problem publication-title: INFORMS Journal on Computing – volume: 95 start-page: 237 issue: 1 year: 1996a end-page: 239 article-title: A note on hashing functions and tabu search algorithms publication-title: European Journal of Operational Research – volume: 6 start-page: 65 year: 1979 end-page: 70 article-title: A simple sequentially rejective multiple test procedure publication-title: Scandinavian Journal of Statistics – volume: 1 start-page: 3 year: 2011 end-page: 18 article-title: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms publication-title: Swarm and Evolutionary Computation – volume: 3 start-page: 103 year: 2011 end-page: 163 article-title: MIPLIB 2010 ‐ mixed integer programming library version 5 publication-title: Mathematical Programming Computation – volume: 127 year: 2021 article-title: Parallel iterative solution‐based tabu search for the obnoxious p‐median problem publication-title: Computers & Operations Research – volume: 242 start-page: 21 issue: 1 year: 2015 end-page: 33 article-title: Construction and improvement algorithms for dispersion problems publication-title: European Journal of Operational Research – volume: 7 start-page: 1033 year: 2002 end-page: 1058 article-title: Randomized heuristics for the max‐cut problem publication-title: Optimization Methods and Software – start-page: 1 year: 1997 end-page: 75 – volume: 24 start-page: 783 year: 2018 end-page: 815 article-title: A comparison of acceptance criteria for the adaptive large neighbourhood search metaheuristic publication-title: Journal of Heuristics – volume: 17 start-page: 82 year: 2005 end-page: 98 article-title: A local‐search‐based heuristic for the demand‐constrained multidimensional knapsack problem publication-title: INFORMS Journal of Computing – start-page: 70 year: 1993 end-page: 150 – volume: 9 start-page: 229 year: 2003 end-page: 247 article-title: A heuristic for Boolean optimization problems publication-title: Journal of Heuristics – year: 2020 – year: 1997 – volume: 292 start-page: 423 issue: 2 year: 2021 end-page: 442 article-title: Meta‐analysis of metaheuristics: quantifying the effect of adaptiveness in adaptive large neighborhood search publication-title: European Journal of Operational Research – volume: 105 year: 2021b article-title: Multistart solution‐based tabu search for the set‐union knapsack problem publication-title: Applied Soft Computing – volume: 10 year: 2022 article-title: Exponential extrapolation memory for tabu search publication-title: EURO Journal on Computational Optimization – volume: 10 start-page: 673 year: 2000 end-page: 696 article-title: A spectral bundle method for semidefinite programming publication-title: SIAM Journal on Optimization – volume: 436 start-page: 282 year: 2018a end-page: 301 article-title: A two‐phase tabu‐evolutionary algorithm for the 0–1 multidimensional knapsack problem publication-title: Information Sciences – volume: 8 start-page: 1 issue: 1 year: 2022 end-page: 26 article-title: Variable neighborhood search for binary integer programming problems publication-title: International Journal of Metaheuristics – ident: e_1_2_7_13_1 doi: 10.13164/mendel.2020.1.023 – ident: e_1_2_7_41_1 doi: 10.1016/j.ejor.2016.10.035 – start-page: 70 volume-title: Modern Heuristic Techniques for Combinatorial Problems year: 1993 ident: e_1_2_7_19_1 – volume: 6 start-page: 65 year: 1979 ident: e_1_2_7_22_1 article-title: A simple sequentially rejective multiple test procedure publication-title: Scandinavian Journal of Statistics – ident: e_1_2_7_9_1 doi: 10.1016/0377-2217(95)00249-9 – ident: e_1_2_7_12_1 doi: 10.1023/A:1009642405419 – ident: e_1_2_7_21_1 doi: 10.1137/S1052623497328987 – ident: e_1_2_7_31_1 doi: 10.1016/j.orp.2016.09.002 – ident: e_1_2_7_44_1 doi: 10.1016/j.asoc.2021.107260 – ident: e_1_2_7_28_1 doi: 10.1016/j.ins.2018.01.026 – ident: e_1_2_7_37_1 doi: 10.1007/s10732-021-09466-0 – volume: 2 start-page: 157 issue: 1 year: 2002 ident: e_1_2_7_24_1 article-title: Solving the knapsack problem for adaptive multimedia system publication-title: Studia Informatica Universalis – ident: e_1_2_7_7_1 doi: 10.1016/j.orl.2013.08.007 – ident: e_1_2_7_8_1 doi: 10.1287/ijoc.1030.0050 – ident: e_1_2_7_14_1 doi: 10.1023/A:1023717307746 – ident: e_1_2_7_34_1 doi: 10.1287/ijoc.1080.0275 – ident: e_1_2_7_40_1 doi: 10.1016/j.ejor.2020.10.045 – ident: e_1_2_7_35_1 doi: 10.1016/j.ejor.2024.04.004 – ident: e_1_2_7_3_1 doi: 10.1016/j.ejor.2014.09.058 – ident: e_1_2_7_11_1 doi: 10.1016/j.cor.2020.105155 – ident: e_1_2_7_29_1 doi: 10.1016/j.ins.2018.02.006 – ident: e_1_2_7_23_1 doi: 10.4018/IJAMC.2016100103 – ident: e_1_2_7_27_1 doi: 10.1016/j.cor.2016.02.016 – ident: e_1_2_7_25_1 doi: 10.1007/s12532-011-0025-9 – ident: e_1_2_7_42_1 doi: 10.1016/j.cor.2021.105427 – ident: e_1_2_7_38_1 doi: 10.1007/s10732-018-9377-x – ident: e_1_2_7_30_1 doi: 10.1016/j.ejor.2018.10.001 – ident: e_1_2_7_32_1 doi: 10.1016/j.eswa.2023.119856 – ident: e_1_2_7_26_1 doi: 10.1109/ACCESS.2019.2959315 – ident: e_1_2_7_36_1 doi: 10.1016/j.eswa.2023.121477 – ident: e_1_2_7_2_1 doi: 10.1016/j.ejor.2023.01.030 – ident: e_1_2_7_17_1 doi: 10.1007/978-1-4615-4102-8_1 – ident: e_1_2_7_20_1 doi: 10.1007/978-1-4615-6089-0 – ident: e_1_2_7_33_1 doi: 10.1007/s12532-023-00234-8 – ident: e_1_2_7_16_1 doi: 10.1080/1055678021000090033 – ident: e_1_2_7_15_1 doi: 10.1016/j.swevo.2011.02.002 – ident: e_1_2_7_43_1 doi: 10.1016/j.eswa.2020.113802 – ident: e_1_2_7_18_1 – ident: e_1_2_7_39_1 doi: 10.1145/2541012.2541014 – ident: e_1_2_7_10_1 doi: 10.1080/15458830.1996.11770707 – ident: e_1_2_7_4_1 doi: 10.1504/IJMHEUR.2022.127813 – ident: e_1_2_7_5_1 doi: 10.1016/j.ejco.2022.100028 – ident: e_1_2_7_6_1 doi: 10.1504/IJMHEUR.2024.10066097 – ident: e_1_2_7_45_1 doi: 10.1007/BF02022565 |
| SSID | ssj0001517 |
| Score | 2.3565867 |
| Snippet | Tabu search is one of the most commonly used local search‐based metaheuristics. A key component of the search is the tabu criterion, which controls whether it... |
| SourceID | proquest crossref wiley |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 3780 |
| SubjectTerms | 0‐1 integer programming adaptive memory Algorithms binary optimization Criteria Heuristic Heuristic methods Integer programming Optimization tabu criterion Tabu search |
| Title | Solution‐based versus attribute‐based tabu search for binary integer programming |
| URI | https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fitor.70011 https://www.proquest.com/docview/3228955370 |
| Volume | 32 |
| WOSCitedRecordID | wos001435679600001&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: PRVWIB databaseName: Wiley Online Library customDbUrl: eissn: 1475-3995 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001517 issn: 0969-6016 databaseCode: DRFUL dateStart: 19970101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1PS8MwFH8MJ6IHp1NxOiWgF4VK2rRrA15EHQoyZWywW0nTFASdsnae_Qh-Rj-JL2m6TRBBvJU2TUPe__S93wM4DqjE9SUZChJVji-Z7whfCkeyhEeeiyqTZ6bZRNjrRaMRf6jBeVULU-JDzA7ctGQYfa0FXCT5gpAjw0_O9F9TjH3quqoKQ6_6Vb87vJtpYrRmplyad7ijYUcsPKnO5Jm__d0gzb3MRV_VGJtu43_L3IB162SSi5IrNqGmxk1YqXLcm9CoejkQK9pNWFsAJtyCQXVa9vn-oe1cSnT2xjQnoig7ZKnZg0IkU1LKC0EHmCSmwJcYGAr8gM3_esZpt2HYvR5c3ji2_wJSivuuw1PpJp4IOBOR9PE6ElSKJJBMqogLwcJMiI7UZpYyDLIjyUIlQpZG2k1SKduBpfHLWO0CydATkAHyg0AXMaM0ERhXUjdN8U7qyawFJxURYmnByXWPjKe4ClL0PsZmH1twNBv7WkJy_DiqXdEytmKZx6i9Ih4ELKQtODVU-2WG-HZw3zdXe38ZvA-rnu4RbOoV27BUTKbqAJblW_GYTw4ti34B7IPuog |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bS8MwFD7IJl4enE7F6dSAvihU2qZdk0dRx4ZzythgbyVNWxB0ytb57E_wN_pLPEnTbYII4ltp0zTk3L6TngvAqW9LXF-UoiDZieVJ6lnCk8KSNOLMdVBl8lQ3mwi6XTYc8gcTm6NyYfL6ELMDNyUZWl8rAVcH0gtSjhw_vlC_TdH5KXsNGrASlK97zUFnporRnOl8ad7glqo7YuqTqlCe-dvfLdIcZi6CVW1tmpV_rnMTNgzMJJc5X2zBUjKqwkoR5V6FStHNgRjhrsL6QmnCbegX52Wf7x_K0sVExW9MJ0RkeY-sZPYgE9GU5BJDEAKTSKf4El2IAj9gIsCecdodGDRv-lcty3RgQFpxz7F4LJ3IFT6ngkkPr5mwpYh8SWXCuBA0SIVoSGVobYpuNpM0SERAY6aAUhLTXSiNXkbJHpAUsYD0kSMEgsTUtiOBnqXtxDHeiV2Z1uCsoEIoTXly1SXjKSzcFLWPod7HGpzMxr7mRTl-HFUviBkawZyEqL8Y930a2DU412T7ZYaw3b_v6av9vww-htVW_64Tdtrd2wNYc1XHYJ29WIdSNp4mh7As37LHyfjI8OsXKtzykg |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1bS8MwFD7IJkMfnE7F6dSAvihU2qZdm0dxDodjjrGBbyVNUxB0jl189if4G_0lnqRpN0EE8a20aRpybt9JzwXg3LcFri9OUZBsaXmCehb3BLcEjVnoOqgyWaqbTQS9Xvj4yPomNkflwmT1IYoDNyUZWl8rAZeTJF2RcuT46ZX6bYrOT9nzme-VoNwatEfdQhWjOdP50qzJLFV3xNQnVaE8y7e_W6QlzFwFq9ratKv_XOc2bBmYSa4zvtiBNTmuQSWPcq9BNe_mQIxw12BzpTThLgzz87LP9w9l6RKi4jcWM8LnWY8sWTyY83hBMokhCIFJrFN8iS5EgR8wEWAvOO0ejNq3w5s7y3RgQFoxz7FYIpzY5T6jPBQeXofcFjz2BRUyZJzTIOW8KZShtSm62aGggeQBTUIFlGRC96E0fh3LAyApYgHhI0dwBImpbcccPUvbSRK8k7gircNFToVImPLkqkvGc5S7KWofI72PdTgrxk6yohw_jmrkxIyMYM4i1F8h830a2HW41GT7ZYaoM3wY6KvDvww-hUq_1Y66nd79EWy4qmGwTl5sQGk-XchjWBdv86fZ9MSw6xfL1PIN |
| 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=Solution%E2%80%90based+versus+attribute%E2%80%90based+tabu+search+for+binary+integer+programming&rft.jtitle=International+transactions+in+operational+research&rft.au=Danielsen%2C+Ketil&rft.au=Hvattum%2C+Lars+Magnus&rft.date=2025-11-01&rft.issn=0969-6016&rft.eissn=1475-3995&rft.volume=32&rft.issue=6&rft.spage=3780&rft.epage=3800&rft_id=info:doi/10.1111%2Fitor.70011&rft.externalDBID=10.1111%252Fitor.70011&rft.externalDocID=ITOR70011 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0969-6016&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0969-6016&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0969-6016&client=summon |