A multi-objective tabu search algorithm based on decomposition for multi-objective unconstrained binary quadratic programming problem
•A multi-objective tabu search algorithm based on decomposition (DMTS) is proposed for multi-objective unconstrained binary quadratic programming problem.•To enhance the convergence and diversity properties of the proposed algorithm, uniform generation method and adaptive use of scalarizing approach...
Saved in:
| Published in: | Knowledge-based systems Vol. 141; pp. 18 - 30 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
01.02.2018
|
| Subjects: | |
| ISSN: | 0950-7051, 1872-7409 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | •A multi-objective tabu search algorithm based on decomposition (DMTS) is proposed for multi-objective unconstrained binary quadratic programming problem.•To enhance the convergence and diversity properties of the proposed algorithm, uniform generation method and adaptive use of scalarizing approaches are designed.•Experiments are carried out to demonstrate the effectiveness of two main components mentioned above.•Experimental results show that DMTS significantly outperforms the state-of-the-art algorithms on 50 benchmark instances.
Unconstrained binary quadratic programming problem (UBQP) is a well-known NP-hard problem. In this problem, a quadratic 0–1 function is maximized. Numerous single-objective combinatorial optimization problems can be expressed as UBQP. To enhance the expressive ability of UBQP, a multi-objective extension of UBQP and a set of benchmark instances have been introduced recently. A decomposition-based multi-objective tabu search algorithm for multi-objective UBQP is proposed in this paper. In order to obtain a good Pareto set approximation, a novel weight vector generation method is first introduced. Then, the problem is decomposed into a number of subproblems by means of scalarizing approaches. The choice of different types of scalarizing approaches can greatly affect the performance of an algorithm. Therefore, to take advantages of different scalarizing approaches, both the weighted sum approach and the Tchebycheff approach are utilized adaptively in the proposed algorithm. Finally, in order to better utilize the problem-specific knowledge, a tabu search procedure is designed to further optimize these subproblems simultaneously. Experimental results on 50 benchmark instances indicate that the proposed algorithm performs better than current state-of-the-art algorithms. |
|---|---|
| AbstractList | •A multi-objective tabu search algorithm based on decomposition (DMTS) is proposed for multi-objective unconstrained binary quadratic programming problem.•To enhance the convergence and diversity properties of the proposed algorithm, uniform generation method and adaptive use of scalarizing approaches are designed.•Experiments are carried out to demonstrate the effectiveness of two main components mentioned above.•Experimental results show that DMTS significantly outperforms the state-of-the-art algorithms on 50 benchmark instances.
Unconstrained binary quadratic programming problem (UBQP) is a well-known NP-hard problem. In this problem, a quadratic 0–1 function is maximized. Numerous single-objective combinatorial optimization problems can be expressed as UBQP. To enhance the expressive ability of UBQP, a multi-objective extension of UBQP and a set of benchmark instances have been introduced recently. A decomposition-based multi-objective tabu search algorithm for multi-objective UBQP is proposed in this paper. In order to obtain a good Pareto set approximation, a novel weight vector generation method is first introduced. Then, the problem is decomposed into a number of subproblems by means of scalarizing approaches. The choice of different types of scalarizing approaches can greatly affect the performance of an algorithm. Therefore, to take advantages of different scalarizing approaches, both the weighted sum approach and the Tchebycheff approach are utilized adaptively in the proposed algorithm. Finally, in order to better utilize the problem-specific knowledge, a tabu search procedure is designed to further optimize these subproblems simultaneously. Experimental results on 50 benchmark instances indicate that the proposed algorithm performs better than current state-of-the-art algorithms. |
| Author | Wang, Jiahai Wu, Ziyan Zhou, Ying Wu, Keke |
| Author_xml | – sequence: 1 givenname: Ying surname: Zhou fullname: Zhou, Ying email: zy_zhou_y@163.com organization: School of Computer Sciences, Shenzhen Institute of Information Technology, Shenzhen 518172, China – sequence: 2 givenname: Jiahai surname: Wang fullname: Wang, Jiahai organization: Department of Computer Science, Sun Yat-sen University, Guangzhou 510006, China – sequence: 3 givenname: Ziyan surname: Wu fullname: Wu, Ziyan organization: China Securities Depository and Clearing Corporation Limited Shenzhen Branch, 2012 Shennan Blvd, Shenzhen 518038, China – sequence: 4 givenname: Keke surname: Wu fullname: Wu, Keke organization: School of Computer Sciences, Shenzhen Institute of Information Technology, Shenzhen 518172, China |
| BookMark | eNqFkM9OwyAcx4mZidv0DTzwAq382o4ODybL4r9kiRc9Ewp0Y7YwgS3ZA_je0syTJnoCDp9v-HwmaGSd1QhdA8mBAL3Z5u_WhWPICwJ1DpATws7QGOZ1kdUVYSM0JmxGsprM4AJNQtgSQooC5mP0ucD9vosmc81Wy2gOGkfR7HHQwssNFt3aeRM3PW5E0Ao7i5WWrt-5YKJJr9b5XwN7K50N0QtjE9IYK_wRf-yF8iIaiXferb3oe2PXw73pdH-JzlvRBX31fU7R28P96_IpW708Pi8Xq0yWhMZMalU2TSFUXYqibIHIkrVqDqyCtp4zTZMVBTWjlJaVqGlZtErPGkmZYDVroZyi29Ou9C4Er1suTRSDyPDbjgPhQ1C-5aegfAjKAXgKmuDqB7zzpk9u_2F3J0wnsYPRngdptE0uxqdgXDnz98AXkyCZJA |
| CitedBy_id | crossref_primary_10_1016_j_asoc_2018_04_009 crossref_primary_10_1109_ACCESS_2024_3353222 crossref_primary_10_4018_IJCINI_361012 crossref_primary_10_1016_j_neucom_2019_06_111 crossref_primary_10_1109_TEVC_2019_2934148 crossref_primary_10_1016_j_knosys_2018_07_018 crossref_primary_10_3390_math8112072 crossref_primary_10_1016_j_eswa_2019_07_025 crossref_primary_10_1016_j_asoc_2019_105485 crossref_primary_10_1016_j_seps_2025_102271 crossref_primary_10_1007_s40430_019_2121_0 crossref_primary_10_1016_j_asoc_2018_07_034 crossref_primary_10_1155_2020_3050714 crossref_primary_10_1016_j_eswa_2023_120402 crossref_primary_10_1007_s42835_020_00406_9 crossref_primary_10_1016_j_procir_2024_08_292 crossref_primary_10_1016_j_cie_2020_106620 crossref_primary_10_1109_JSYST_2019_2959664 crossref_primary_10_1016_j_ejor_2024_07_010 crossref_primary_10_1016_j_cor_2021_105370 |
| Cites_doi | 10.1109/JSYST.2014.2300201 10.1016/j.eswa.2011.05.060 10.1016/j.eswa.2010.02.032 10.1007/s00500-008-0323-y 10.1080/10556780701550083 10.1109/TEVC.2010.2051446 10.1016/j.cor.2009.01.005 10.1016/j.cor.2012.01.001 10.1016/j.asoc.2017.04.002 10.1007/s10479-015-2076-1 10.1016/j.swevo.2011.02.002 10.15388/Informatica.2006.138 10.1162/EVCO_a_00109 10.1109/4235.996017 10.1111/j.1475-3995.2011.00808.x 10.1016/j.ins.2014.05.045 10.1016/j.ejor.2012.07.012 10.1007/s10732-009-9103-9 10.1109/TEVC.2013.2293776 10.1109/TEVC.2014.2373386 10.2307/3001968 10.1007/s00291-003-0153-3 10.1007/s10878-014-9734-0 10.1109/TCYB.2013.2295886 10.1016/j.cor.2011.12.006 10.1109/TEVC.2007.892759 10.1007/s10479-007-0230-0 10.1016/j.cor.2012.03.010 10.1016/j.asoc.2013.11.008 10.1111/j.2517-6161.1958.tb00299.x 10.1016/j.neucom.2016.09.122 10.1109/TCYB.2015.2409837 10.1109/5326.704576 |
| ContentType | Journal Article |
| Copyright | 2017 Elsevier B.V. |
| Copyright_xml | – notice: 2017 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.knosys.2017.11.009 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1872-7409 |
| EndPage | 30 |
| ExternalDocumentID | 10_1016_j_knosys_2017_11_009 S0950705117305300 |
| GroupedDBID | --K --M .DC .~1 0R~ 1B1 1~. 1~5 4.4 457 4G. 5VS 7-5 71M 77K 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO AAYFN ABAOU ABBOA ABIVO ABJNI ABMAC ABYKQ ACAZW ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE ADGUI ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ IHE J1W JJJVA KOM LG9 LY7 M41 MHUIS MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ Q38 RIG ROL RPZ SDF SDG SDP SES SPC SPCBC SST SSV SSW SSZ T5K WH7 XPP ZMT ~02 ~G- 29L 77I 9DU AAQXK AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADJOM ADMUD ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS FEDTE FGOYB G-2 HLZ HVGLF HZ~ R2- SBC SET SEW UHS WUQ ~HD |
| ID | FETCH-LOGICAL-c306t-ced3bb2ad73a23f10c39fd81941f789e600261d566634a7632fde5bc69a979f13 |
| ISICitedReferencesCount | 24 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000423648300002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0950-7051 |
| IngestDate | Sat Nov 29 06:41:32 EST 2025 Tue Nov 18 19:50:36 EST 2025 Fri Feb 23 02:18:39 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Tabu search Multi-objective optimization Decomposition |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c306t-ced3bb2ad73a23f10c39fd81941f789e600261d566634a7632fde5bc69a979f13 |
| PageCount | 13 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_knosys_2017_11_009 crossref_primary_10_1016_j_knosys_2017_11_009 elsevier_sciencedirect_doi_10_1016_j_knosys_2017_11_009 |
| PublicationCentury | 2000 |
| PublicationDate | 2018-02-01 2018-02-00 |
| PublicationDateYYYYMMDD | 2018-02-01 |
| PublicationDate_xml | – month: 02 year: 2018 text: 2018-02-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | Knowledge-based systems |
| PublicationYear | 2018 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Liefooghe, Verel, Paquete, Hao (bib0001) 2015 Miettinen (bib0026) 2012 Zhou (bib0030) 2017 Ishibuchi, Sakane, Tsukamoto, Nojima (bib0029) 2009 Pardalos, Prokopyev, Shylo, Shylo (bib0012) 2008; 23 Qi, Ma, Liu, Jiao, Sun, Wu (bib0020) 2014; 22 Scheffé (bib0043) 1958; 20 Tricoire (bib0036) 2012; 39 Paquete, Schiavinotto, Stützle (bib0035) 2007; 156 Zitzler, Laumanns, Thiele (bib0045) 2002 Collette, Slarry (bib0033) 2004 Li, Zhang, Kwong, Li, Wang (bib0042) 2014; 18 Talbi, Basseurc, Nebro, Alba (bib0034) 2012; 19 Liefooghe, Verel, Hao (bib0014) 2014; 16 Zhou, Wang (bib0049) 2015; 9 Zhou, Wang, Yin (bib0016) 2013 Wang, Lü, Glover, Hao (bib0008) 2013; 40 Deb, Pratap, Agarwal, Meyarivan (bib0037) 2002; 6 Wang, Zhou, Yin (bib0003) 2011; 38 Derrac, García, Molina, Herrera (bib0047) 2011; 1 Giagkiozis, Purshouse, Fleming (bib0024) 2014; 282 Palubeckis (bib0007) 2006; 17 Lu, Zhang, Ruan, Wu (bib0031) 2007 Zhou, Wang, Yin (bib0010) 2011; 38 Mei, Tang, Yao (bib0044) 2011; 15 Wang, Lü, Glover, Hao (bib0011) 2012; 223 Deb (bib0032) 2014 Kochenberger, Glover, Alidaee, Rego (bib0002) 2004; 26 Zangari, Pozo, Santana, Mendiburu (bib0015) 2017, in press. Garey, Johnson (bib0005) 1979 Wang (bib0009) 2010; 37 Ke, Zhang, Battiti (bib0017) 2014; 44 Ishibuchi, Sakane, Tsukamoto, Nojima (bib0025) 2010 Ishibuchi, Murata (bib0038) 1998; 28 Glover, Hao (bib0013) 2016; 238 Giagkiozis, Purshouse, Fleming (bib0023) 2013 Wilcoxon (bib0046) 1945; 1 Lust, Teghem (bib0039) 2010; 16 wang, Xiong, Ishibuchi, Wu, Zhang (bib0027) 2017 Zhang, Li (bib0019) 2007; 11 Glover, Lü, Hao (bib0006) 2010; 8 Kochenberger, Hao, Glover, Lewis, Lü, Wang, Wang (bib0004) 2014; 28 Li, Deb, Zhang, Kwong (bib0018) 2015; 19 Alcalá-Fdez, Sánchez, García (bib0048) 2009; 13 Lust, Jaszkiewicz (bib0040) 2010; 37 yan Tan, chang Jiao, Li, kuan Wang (bib0021) 2013; 40 Ma, Qi, Li, Liu, Jiao, Wu (bib0022) 2014; 18 Trivedi, Srinivasan, Sanyal, Ghosh (bib0028) 2017; 21 Wang, Zhou, Wang, Zhang, Chen, Zheng (bib0050) 2016; 46 Qi, Zhang, Ma, Quan, Miao (bib0041) 2017 Derrac (10.1016/j.knosys.2017.11.009_bib0047) 2011; 1 Glover (10.1016/j.knosys.2017.11.009_bib0013) 2016; 238 Li (10.1016/j.knosys.2017.11.009_bib0042) 2014; 18 Wang (10.1016/j.knosys.2017.11.009_bib0009) 2010; 37 Zangari (10.1016/j.knosys.2017.11.009_bib0015) 2017 Talbi (10.1016/j.knosys.2017.11.009_bib0034) 2012; 19 Mei (10.1016/j.knosys.2017.11.009_bib0044) 2011; 15 Ishibuchi (10.1016/j.knosys.2017.11.009_bib0025) 2010 yan Tan (10.1016/j.knosys.2017.11.009_bib0021) 2013; 40 Miettinen (10.1016/j.knosys.2017.11.009_bib0026) 2012 Zhou (10.1016/j.knosys.2017.11.009_bib0016) 2013 Trivedi (10.1016/j.knosys.2017.11.009_bib0028) 2017; 21 Wang (10.1016/j.knosys.2017.11.009_bib0011) 2012; 223 Lust (10.1016/j.knosys.2017.11.009_bib0039) 2010; 16 Wang (10.1016/j.knosys.2017.11.009_bib0050) 2016; 46 Scheffé (10.1016/j.knosys.2017.11.009_bib0043) 1958; 20 Kochenberger (10.1016/j.knosys.2017.11.009_bib0002) 2004; 26 Liefooghe (10.1016/j.knosys.2017.11.009_bib0014) 2014; 16 Liefooghe (10.1016/j.knosys.2017.11.009_bib0001) 2015 Li (10.1016/j.knosys.2017.11.009_bib0018) 2015; 19 Giagkiozis (10.1016/j.knosys.2017.11.009_bib0023) 2013 Deb (10.1016/j.knosys.2017.11.009_bib0032) 2014 Kochenberger (10.1016/j.knosys.2017.11.009_bib0004) 2014; 28 Zhang (10.1016/j.knosys.2017.11.009_bib0019) 2007; 11 Wang (10.1016/j.knosys.2017.11.009_bib0008) 2013; 40 Qi (10.1016/j.knosys.2017.11.009_bib0041) 2017 Giagkiozis (10.1016/j.knosys.2017.11.009_bib0024) 2014; 282 Deb (10.1016/j.knosys.2017.11.009_bib0037) 2002; 6 Palubeckis (10.1016/j.knosys.2017.11.009_bib0007) 2006; 17 Zhou (10.1016/j.knosys.2017.11.009_bib0030) 2017 Tricoire (10.1016/j.knosys.2017.11.009_bib0036) 2012; 39 Collette (10.1016/j.knosys.2017.11.009_bib0033) 2004 Lust (10.1016/j.knosys.2017.11.009_bib0040) 2010; 37 Zitzler (10.1016/j.knosys.2017.11.009_bib0045) 2002 Pardalos (10.1016/j.knosys.2017.11.009_bib0012) 2008; 23 wang (10.1016/j.knosys.2017.11.009_sbref0027) 2017 Garey (10.1016/j.knosys.2017.11.009_bib0005) 1979 Zhou (10.1016/j.knosys.2017.11.009_bib0049) 2015; 9 Qi (10.1016/j.knosys.2017.11.009_bib0020) 2014; 22 Wang (10.1016/j.knosys.2017.11.009_bib0003) 2011; 38 Wilcoxon (10.1016/j.knosys.2017.11.009_bib0046) 1945; 1 Ishibuchi (10.1016/j.knosys.2017.11.009_bib0038) 1998; 28 Paquete (10.1016/j.knosys.2017.11.009_bib0035) 2007; 156 Ma (10.1016/j.knosys.2017.11.009_bib0022) 2014; 18 Alcalá-Fdez (10.1016/j.knosys.2017.11.009_bib0048) 2009; 13 Ishibuchi (10.1016/j.knosys.2017.11.009_bib0029) 2009 Zhou (10.1016/j.knosys.2017.11.009_bib0010) 2011; 38 Ke (10.1016/j.knosys.2017.11.009_bib0017) 2014; 44 Lu (10.1016/j.knosys.2017.11.009_bib0031) 2007 Glover (10.1016/j.knosys.2017.11.009_bib0006) 2010; 8 |
| References_xml | – start-page: 95 year: 2002 end-page: 100 ident: bib0045 article-title: SPEA2: Improving the strength Pareto evolutionary algorithm publication-title: Evolutionary Methods for Design, Optimization and Control with Applications to Industrial Problems,Barcelona, Spain: CIMNE – year: 2017 ident: bib0027 article-title: On the effect of reference point in MOEA/d for multi-objective optimization publication-title: Appl. Soft. Comput. – volume: 28 start-page: 392 year: 1998 end-page: 403 ident: bib0038 article-title: Multi-objective genetic local search algorithm and its application to flowshop scheduling publication-title: IEEE Trans. Syst. Man . Cybern. – start-page: 519 year: 2010 end-page: 526 ident: bib0025 article-title: Simultaneous use of different scalarizing functions in MOEA/D publication-title: GECCO 2010: Proceedings of the Genetic and Evolutionary Computation Conference – volume: 37 start-page: 521 year: 2010 end-page: 533 ident: bib0040 article-title: Speed-up techniques for solving large-scale biobjective tsp publication-title: Comput. Oper. Res. – year: 2007 ident: bib0031 article-title: Multi-objective group decision making: Methods, software and applications with fuzzy set techniques – year: 2012 ident: bib0026 article-title: Nonlinear multiobjective optimization – volume: 20 start-page: 344 year: 1958 end-page: 360 ident: bib0043 article-title: Experiments with mixtures publication-title: J. R. Stat. Soc. Series B – volume: 18 start-page: 2541 year: 2014 end-page: 2564 ident: bib0022 article-title: MOEA/D with uniform decomposition measurement for many-objective problems publication-title: Methodol. Appl. – volume: 13 start-page: 307 year: 2009 end-page: 318 ident: bib0048 article-title: KEEL: A software tool to assess evolutionary algorithms for data mining problems publication-title: Soft. Comput. – volume: 19 start-page: 694 year: 2015 end-page: 716 ident: bib0018 article-title: An evolutionary many-objective optimization algorithm based on dominance and decomposition publication-title: IEEE Trans. Evol. Comput. – start-page: 403 year: 2014 end-page: 449 ident: bib0032 article-title: Multi-objective Optimization publication-title: Search Methodologies: Introductory Tutorials in Optimization and Decision Support Techniques – volume: 282 start-page: 363 year: 2014 end-page: 387 ident: bib0024 article-title: Generalized decomposition and cross entropy methods for many-objective optimization publication-title: Inf. Sci. – start-page: 428 year: 2013 end-page: 442 ident: bib0023 article-title: Generalized decomposition publication-title: International Conference on Evolutionary Multi-Criterion Optimization, EMO 2013 – start-page: 438 year: 2009 end-page: 452 ident: bib0029 article-title: Adaptation of Scalarizing Functions in MOEA/D: An Adaptive Scalarizing Function-based Multiobjective Evolutionary Algorithm publication-title: Evolutionary Multi-Criterion Optimization – volume: 18 start-page: 909 year: 2014 end-page: 923 ident: bib0042 article-title: Stable matching-based selection in evolutionary multiobjective optimization publication-title: IEEE Trans. Evol. Comput. – volume: 40 start-page: 1648 year: 2013 end-page: 1660 ident: bib0021 article-title: MOEA/D + uniform design: a new version of MOEA/d for optimization problems with many objectives publication-title: Comput. Oper. Res. – volume: 39 start-page: 3089 year: 2012 end-page: 3101 ident: bib0036 article-title: Multi-directional local search publication-title: Comput. Oper. Res. – volume: 19 start-page: 283 year: 2012 end-page: 305 ident: bib0034 article-title: Multi-objective optimization using metaheuristics: non-standard algorithms publication-title: Int. Trans. Oper. Res. – volume: 17 start-page: 279 year: 2006 end-page: 296 ident: bib0007 article-title: Iterated tabu search strategies for the unconstrained binary quadratic optimization problem publication-title: Informatica – volume: 156 start-page: 83 year: 2007 end-page: 97 ident: bib0035 article-title: On local optima in multiobjective combinatorial problems publication-title: Ann. Oper. Res. – volume: 238 start-page: 651 year: 2016 end-page: 657 ident: bib0013 article-title: F-flip strategies for unconstrained binary quadratic programming publication-title: Ann. Oper. Res. – volume: 44 start-page: 1808 year: 2014 end-page: 1820 ident: bib0017 article-title: Hybridization of decomposition and local search for multiobjective optimization publication-title: IEEE Trans. Cybern. – volume: 21 start-page: 440 year: 2017 end-page: 462 ident: bib0028 article-title: A survey of multiobjective evolutionary algorithms based on decomposition publication-title: IEEE Trans. Evol. Comput. – year: 1979 ident: bib0005 article-title: Computers and Intractability: A Guide to the Theory of np-Completeness – volume: 223 start-page: 595 year: 2012 end-page: 604 ident: bib0011 article-title: Path relinking for unconstrained binary quadratic programming publication-title: Eur. J. Oper. Res. – volume: 16 start-page: 10 year: 2014 end-page: 19 ident: bib0014 article-title: A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming publication-title: Appl. Soft. Comput. – volume: 23 start-page: 129 year: 2008 end-page: 140 ident: bib0012 article-title: Global equilibrium search applied to the unconstrained binary quadratic optimization problem publication-title: Optim. Methods Softw. – volume: 16 start-page: 475 year: 2010 end-page: 510 ident: bib0039 article-title: Two-phase pareto local search for the biobjective traveling salesman problem publication-title: J. Heuristics – volume: 8 start-page: 239 year: 2010 end-page: 253 ident: bib0006 article-title: Diversification-driven tabu search for unconstrained binary quadratic problems publication-title: 40R – year: 2017, in press. ident: bib0015 article-title: A decomposition-based binary ACO algorithm for the multiobjective UBQP publication-title: Neurocomputing – volume: 38 start-page: 13894 year: 2011 end-page: 13905 ident: bib0010 article-title: Cooperative annealing hopfield network for unconstrained binary quadratic programming problem publication-title: Expert Syst. Appl. – volume: 46 start-page: 582 year: 2016 end-page: 594 ident: bib0050 article-title: Multiobjective vehicle routing problems with simultaneous delivery and pickup and time windows: formulation, instances, and algorithms publication-title: IEEE Trans. Cybern. – year: 2004 ident: bib0033 article-title: Multiobjective Optimization: Principles and Case Studies – start-page: 171 year: 2015 end-page: 186 ident: bib0001 article-title: Experiments on local search for bi-objective unconstrained binary quadratic programming publication-title: International Conference on Evolutionary Multi-Criterion Optimization – volume: 38 start-page: 14870 year: 2011 end-page: 14881 ident: bib0003 article-title: Combining tabu hopfield network and estimation of distribution for unconstrained binary quadratic programming problem publication-title: Expert Syst. Appl. – start-page: 101 year: 2017 end-page: 107 ident: bib0030 article-title: A decomposition-based multi-objective tabu search algorithm for tri-objective unconstrained binary quadratic programming problem publication-title: 2017 IEEE International Conference on Computational Science and Engineering (CSE) and IEEE International Conference on Embedded and Ubiquitous Computing (EUC) – volume: 26 start-page: 237 year: 2004 end-page: 250 ident: bib0002 article-title: A unified modeling and solution framework for combinatorial optimization problems publication-title: OR Spectrum – volume: 6 start-page: 182 year: 2002 end-page: 197 ident: bib0037 article-title: A fast and elitist multiobjective genetic algorithm: NSGA-II publication-title: IEEE Trans. Evol. Comput. – volume: 9 start-page: 1100 year: 2015 end-page: 1113 ident: bib0049 article-title: A local search-based multiobjective optimization algorithm for multiobjective vehicle routing problem with time windows publication-title: IEEE Syst. J. – start-page: in press year: 2017 ident: bib0041 article-title: Utopian point based decomposition for multi-objective optimization problems with complicated pareto fronts publication-title: Appl. Soft. Comput. – volume: 11 start-page: 712 year: 2007 end-page: 731 ident: bib0019 article-title: MOEA/D: a multi-objective evolutionary algorithm based on decomposition publication-title: IEEE Trans. Evol. Comput. – volume: 1 start-page: 3 year: 2011 end-page: 18 ident: bib0047 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 Evol. Comput. – volume: 40 start-page: 3100 year: 2013 end-page: 3107 ident: bib0008 article-title: Probabilistic GRASP-tabu search algorithms for the UBQP problem publication-title: Comput. Oper. Res. – volume: 1 start-page: 80 year: 1945 end-page: 83 ident: bib0046 article-title: Individual comparisons by ranking methods publication-title: Biometrics Bull. – volume: 28 start-page: 58 year: 2014 end-page: 81 ident: bib0004 article-title: The unconstrained binary quadratic programming problem: a survey publication-title: J. Comb. Optim. – start-page: 281 year: 2013 end-page: 286 ident: bib0016 article-title: A directional-biased tabu search algorithm for multi-objective unconstrained binary quadratic programming problem publication-title: 2013 Sixth International Conference on Advanced Computational Intelligence – volume: 15 start-page: 151 year: 2011 end-page: 165 ident: bib0044 article-title: Decomposition-based memetic algorithm for multiobjective capacitated arc routing problem publication-title: IEEE Trans. Evol. Comput. – volume: 22 start-page: 231 year: 2014 end-page: 264 ident: bib0020 article-title: MOEA/D with adaptive weight adjustment publication-title: Evolutionary Comput. – volume: 37 start-page: 5758 year: 2010 end-page: 5774 ident: bib0009 article-title: Discrete hopfield network combined with estimation of distribution for unconstrained binary quadratic programming problem publication-title: Expert Syst. Appl. – volume: 9 start-page: 1100 issue: 3 year: 2015 ident: 10.1016/j.knosys.2017.11.009_bib0049 article-title: A local search-based multiobjective optimization algorithm for multiobjective vehicle routing problem with time windows publication-title: IEEE Syst. J. doi: 10.1109/JSYST.2014.2300201 – volume: 38 start-page: 14870 issue: 12 year: 2011 ident: 10.1016/j.knosys.2017.11.009_bib0003 article-title: Combining tabu hopfield network and estimation of distribution for unconstrained binary quadratic programming problem publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2011.05.060 – volume: 37 start-page: 5758 issue: 8 year: 2010 ident: 10.1016/j.knosys.2017.11.009_bib0009 article-title: Discrete hopfield network combined with estimation of distribution for unconstrained binary quadratic programming problem publication-title: Expert Syst. Appl. doi: 10.1016/j.eswa.2010.02.032 – volume: 13 start-page: 307 issue: 3 year: 2009 ident: 10.1016/j.knosys.2017.11.009_bib0048 article-title: KEEL: A software tool to assess evolutionary algorithms for data mining problems publication-title: Soft. Comput. doi: 10.1007/s00500-008-0323-y – start-page: 428 year: 2013 ident: 10.1016/j.knosys.2017.11.009_bib0023 article-title: Generalized decomposition – volume: 8 start-page: 239 issue: 3 year: 2010 ident: 10.1016/j.knosys.2017.11.009_bib0006 article-title: Diversification-driven tabu search for unconstrained binary quadratic problems publication-title: 40R – volume: 23 start-page: 129 issue: 1 year: 2008 ident: 10.1016/j.knosys.2017.11.009_bib0012 article-title: Global equilibrium search applied to the unconstrained binary quadratic optimization problem publication-title: Optim. Methods Softw. doi: 10.1080/10556780701550083 – start-page: in press year: 2017 ident: 10.1016/j.knosys.2017.11.009_bib0041 article-title: Utopian point based decomposition for multi-objective optimization problems with complicated pareto fronts publication-title: Appl. Soft. Comput. – volume: 38 start-page: 13894 issue: 11 year: 2011 ident: 10.1016/j.knosys.2017.11.009_bib0010 article-title: Cooperative annealing hopfield network for unconstrained binary quadratic programming problem publication-title: Expert Syst. Appl. – volume: 15 start-page: 151 issue: 2 year: 2011 ident: 10.1016/j.knosys.2017.11.009_bib0044 article-title: Decomposition-based memetic algorithm for multiobjective capacitated arc routing problem publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2010.2051446 – volume: 37 start-page: 521 issue: 3 year: 2010 ident: 10.1016/j.knosys.2017.11.009_bib0040 article-title: Speed-up techniques for solving large-scale biobjective tsp publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2009.01.005 – volume: 40 start-page: 1648 issue: 6 year: 2013 ident: 10.1016/j.knosys.2017.11.009_bib0021 article-title: MOEA/D + uniform design: a new version of MOEA/d for optimization problems with many objectives publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2012.01.001 – year: 2017 ident: 10.1016/j.knosys.2017.11.009_sbref0027 article-title: On the effect of reference point in MOEA/d for multi-objective optimization publication-title: Appl. Soft. Comput. doi: 10.1016/j.asoc.2017.04.002 – start-page: 438 year: 2009 ident: 10.1016/j.knosys.2017.11.009_bib0029 article-title: Adaptation of Scalarizing Functions in MOEA/D: An Adaptive Scalarizing Function-based Multiobjective Evolutionary Algorithm – volume: 238 start-page: 651 issue: 1 year: 2016 ident: 10.1016/j.knosys.2017.11.009_bib0013 article-title: F-flip strategies for unconstrained binary quadratic programming publication-title: Ann. Oper. Res. doi: 10.1007/s10479-015-2076-1 – volume: 1 start-page: 3 issue: 1 year: 2011 ident: 10.1016/j.knosys.2017.11.009_bib0047 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 Evol. Comput. doi: 10.1016/j.swevo.2011.02.002 – volume: 17 start-page: 279 issue: 2 year: 2006 ident: 10.1016/j.knosys.2017.11.009_bib0007 article-title: Iterated tabu search strategies for the unconstrained binary quadratic optimization problem publication-title: Informatica doi: 10.15388/Informatica.2006.138 – volume: 22 start-page: 231 issue: 2 year: 2014 ident: 10.1016/j.knosys.2017.11.009_bib0020 article-title: MOEA/D with adaptive weight adjustment publication-title: Evolutionary Comput. doi: 10.1162/EVCO_a_00109 – start-page: 519 year: 2010 ident: 10.1016/j.knosys.2017.11.009_bib0025 article-title: Simultaneous use of different scalarizing functions in MOEA/D – start-page: 403 year: 2014 ident: 10.1016/j.knosys.2017.11.009_bib0032 article-title: Multi-objective Optimization – year: 2012 ident: 10.1016/j.knosys.2017.11.009_bib0026 – volume: 6 start-page: 182 issue: 2 year: 2002 ident: 10.1016/j.knosys.2017.11.009_bib0037 article-title: A fast and elitist multiobjective genetic algorithm: NSGA-II publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/4235.996017 – volume: 19 start-page: 283 year: 2012 ident: 10.1016/j.knosys.2017.11.009_bib0034 article-title: Multi-objective optimization using metaheuristics: non-standard algorithms publication-title: Int. Trans. Oper. Res. doi: 10.1111/j.1475-3995.2011.00808.x – volume: 282 start-page: 363 year: 2014 ident: 10.1016/j.knosys.2017.11.009_bib0024 article-title: Generalized decomposition and cross entropy methods for many-objective optimization publication-title: Inf. Sci. doi: 10.1016/j.ins.2014.05.045 – volume: 223 start-page: 595 year: 2012 ident: 10.1016/j.knosys.2017.11.009_bib0011 article-title: Path relinking for unconstrained binary quadratic programming publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2012.07.012 – volume: 16 start-page: 475 issue: 3 year: 2010 ident: 10.1016/j.knosys.2017.11.009_bib0039 article-title: Two-phase pareto local search for the biobjective traveling salesman problem publication-title: J. Heuristics doi: 10.1007/s10732-009-9103-9 – volume: 18 start-page: 2541 year: 2014 ident: 10.1016/j.knosys.2017.11.009_bib0022 article-title: MOEA/D with uniform decomposition measurement for many-objective problems publication-title: Methodol. Appl. – volume: 21 start-page: 440 issue: 3 year: 2017 ident: 10.1016/j.knosys.2017.11.009_bib0028 article-title: A survey of multiobjective evolutionary algorithms based on decomposition publication-title: IEEE Trans. Evol. Comput. – volume: 18 start-page: 909 issue: 6 year: 2014 ident: 10.1016/j.knosys.2017.11.009_bib0042 article-title: Stable matching-based selection in evolutionary multiobjective optimization publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2013.2293776 – start-page: 171 year: 2015 ident: 10.1016/j.knosys.2017.11.009_bib0001 article-title: Experiments on local search for bi-objective unconstrained binary quadratic programming – volume: 19 start-page: 694 issue: 5 year: 2015 ident: 10.1016/j.knosys.2017.11.009_bib0018 article-title: An evolutionary many-objective optimization algorithm based on dominance and decomposition publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2014.2373386 – start-page: 101 year: 2017 ident: 10.1016/j.knosys.2017.11.009_bib0030 article-title: A decomposition-based multi-objective tabu search algorithm for tri-objective unconstrained binary quadratic programming problem – start-page: 95 year: 2002 ident: 10.1016/j.knosys.2017.11.009_bib0045 article-title: SPEA2: Improving the strength Pareto evolutionary algorithm – volume: 1 start-page: 80 issue: 6 year: 1945 ident: 10.1016/j.knosys.2017.11.009_bib0046 article-title: Individual comparisons by ranking methods publication-title: Biometrics Bull. doi: 10.2307/3001968 – volume: 26 start-page: 237 issue: 2 year: 2004 ident: 10.1016/j.knosys.2017.11.009_bib0002 article-title: A unified modeling and solution framework for combinatorial optimization problems publication-title: OR Spectrum doi: 10.1007/s00291-003-0153-3 – volume: 28 start-page: 58 issue: 1 year: 2014 ident: 10.1016/j.knosys.2017.11.009_bib0004 article-title: The unconstrained binary quadratic programming problem: a survey publication-title: J. Comb. Optim. doi: 10.1007/s10878-014-9734-0 – volume: 44 start-page: 1808 issue: 10 year: 2014 ident: 10.1016/j.knosys.2017.11.009_bib0017 article-title: Hybridization of decomposition and local search for multiobjective optimization publication-title: IEEE Trans. Cybern. doi: 10.1109/TCYB.2013.2295886 – year: 2004 ident: 10.1016/j.knosys.2017.11.009_bib0033 – year: 2007 ident: 10.1016/j.knosys.2017.11.009_bib0031 – volume: 40 start-page: 3100 year: 2013 ident: 10.1016/j.knosys.2017.11.009_bib0008 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: 11 start-page: 712 issue: 6 year: 2007 ident: 10.1016/j.knosys.2017.11.009_bib0019 article-title: MOEA/D: a multi-objective evolutionary algorithm based on decomposition publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2007.892759 – volume: 156 start-page: 83 issue: 1 year: 2007 ident: 10.1016/j.knosys.2017.11.009_bib0035 article-title: On local optima in multiobjective combinatorial problems publication-title: Ann. Oper. Res. doi: 10.1007/s10479-007-0230-0 – volume: 39 start-page: 3089 issue: 12 year: 2012 ident: 10.1016/j.knosys.2017.11.009_bib0036 article-title: Multi-directional local search publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2012.03.010 – volume: 16 start-page: 10 year: 2014 ident: 10.1016/j.knosys.2017.11.009_bib0014 article-title: A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming publication-title: Appl. Soft. Comput. doi: 10.1016/j.asoc.2013.11.008 – volume: 20 start-page: 344 issue: 2 year: 1958 ident: 10.1016/j.knosys.2017.11.009_bib0043 article-title: Experiments with mixtures publication-title: J. R. Stat. Soc. Series B doi: 10.1111/j.2517-6161.1958.tb00299.x – year: 1979 ident: 10.1016/j.knosys.2017.11.009_bib0005 – year: 2017 ident: 10.1016/j.knosys.2017.11.009_bib0015 article-title: A decomposition-based binary ACO algorithm for the multiobjective UBQP publication-title: Neurocomputing doi: 10.1016/j.neucom.2016.09.122 – start-page: 281 year: 2013 ident: 10.1016/j.knosys.2017.11.009_bib0016 article-title: A directional-biased tabu search algorithm for multi-objective unconstrained binary quadratic programming problem – volume: 46 start-page: 582 issue: 3 year: 2016 ident: 10.1016/j.knosys.2017.11.009_bib0050 article-title: Multiobjective vehicle routing problems with simultaneous delivery and pickup and time windows: formulation, instances, and algorithms publication-title: IEEE Trans. Cybern. doi: 10.1109/TCYB.2015.2409837 – volume: 28 start-page: 392 year: 1998 ident: 10.1016/j.knosys.2017.11.009_bib0038 article-title: Multi-objective genetic local search algorithm and its application to flowshop scheduling publication-title: IEEE Trans. Syst. Man . Cybern. doi: 10.1109/5326.704576 |
| SSID | ssj0002218 |
| Score | 2.3132875 |
| Snippet | •A multi-objective tabu search algorithm based on decomposition (DMTS) is proposed for multi-objective unconstrained binary quadratic programming problem.•To... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 18 |
| SubjectTerms | Decomposition Multi-objective optimization Tabu search |
| Title | A multi-objective tabu search algorithm based on decomposition for multi-objective unconstrained binary quadratic programming problem |
| URI | https://dx.doi.org/10.1016/j.knosys.2017.11.009 |
| Volume | 141 |
| WOSCitedRecordID | wos000423648300002&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: ScienceDirect customDbUrl: eissn: 1872-7409 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002218 issn: 0950-7051 databaseCode: AIEXJ dateStart: 19950201 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LT9tAEF5FwKGX8mirQqHaA7doUfzKeo9RRVWKhHqgUtSLtfbuFodgQ3AQ_QH9H_2pnX05JkG0HLhY0cZe25kv883MzswidAisBrwsFZFqKEks44RwBcowAC4IVJAUkYzNZhP07Cwdj9m3Xu-Pr4W5m9KqSu_v2fWLihrGQNi6dPYZ4m4nhQH4DEKHI4gdjv8l-JFNEiR1PrHKrN_wfN534Q0-_VnPyubiqq_5S-i1AiF1XrlL3jJph8sTAPdpM1LvJqENVlvCezPnYmb6vbocrytb2G42qOnavKc-bEfsLW87TdJNyLqeGyLwJGrC-y5RuOQXvGxHzXk_yl8LRNuhU3kpu-GLIPUZz5045IDQges661WybYbllKpT0Jae7SrOiuK3MYjJ0WVVw1volD16pLuzDtiC6Pzi_hL_tVmJPuFtktlZMj0LuEiZqRBdD2nCQG-uj06Ox19btg9DE0NuX8OXZ5ocwtWnedz86Zg051votfNF8MhiaBv1ZLWDNv0-H9ip_Tfo9wgvIQJrSGELKdxCChv54rrCDyCFAVIrEzyAFLaQwi2kcAdS2EHqLfr--fj80xfitu8gBfihDSmkiPI85IJGPIxUMCgipgRYoHGgaMrk0Pj_AvyJYRRz4LlQCZnkxZBxRpkKondoraor-R5hIVIKX6epAAdacN2xiLOQpjm4HzQRyS6K_K-aFa63vX6DafaUTHcRaa-6tr1d_nE-9QLLnH1q7c4MUPjklXvPvNMH9GrxX9lHa81sLg_QRnHXlLezjw6CfwHc_rwK |
| 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+multi-objective+tabu+search+algorithm+based+on+decomposition+for+multi-objective+unconstrained+binary+quadratic+programming+problem&rft.jtitle=Knowledge-based+systems&rft.au=Zhou%2C+Ying&rft.au=Wang%2C+Jiahai&rft.au=Wu%2C+Ziyan&rft.au=Wu%2C+Keke&rft.date=2018-02-01&rft.issn=0950-7051&rft.volume=141&rft.spage=18&rft.epage=30&rft_id=info:doi/10.1016%2Fj.knosys.2017.11.009&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_knosys_2017_11_009 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0950-7051&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0950-7051&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0950-7051&client=summon |