Hybrid ant colony optimization algorithms for mixed discrete–continuous optimization problems
► This paper presents three new hybrid ACO algorithms for constrained optimization problems. ► All three algorithms are based on ACOR. ► Fourteen problems selected from various domains were tested. ► All three algorithms greatly outperform the original ACOR. ► This paper also investigated the relati...
Uloženo v:
| Vydáno v: | Applied mathematics and computation Ročník 219; číslo 6; s. 3241 - 3252 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Elsevier Inc
25.11.2012
|
| Témata: | |
| ISSN: | 0096-3003, 1873-5649 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | ► This paper presents three new hybrid ACO algorithms for constrained optimization problems. ► All three algorithms are based on ACOR. ► Fourteen problems selected from various domains were tested. ► All three algorithms greatly outperform the original ACOR. ► This paper also investigated the relative performance of applying local search with fixed and varying probability.
This paper presents three new hybrid ant colony optimization algorithms that are extended from the ACOR developed by Socha and Dorigo for solving mixed discrete–continuous constrained optimization problems. The first two hybrids, labeled ACOR-HJ and ACOR-DE, differs in philosophy with the former integrating ACOR with the effective Hooke and Jeeves local search method and the latter a cooperative hybrid between ACOR and differentia evolution. The third hybrid, labeled ACOR-DE-HJ, is the second cooperative hybrid enhanced with the Hooke and Jeeves local search. All three algorithms incorporate a method to handle mixed discrete–continuous variables and the Deb’s parameterless penalty method for handling constraints. Fourteen problems selected from various domains were used for testing the performance of both algorithms. It was showed that all three algorithms greatly outperform the original ACOR in finding the exact or near global optima. An investigation was also carried out to determine the relative performance of applying local search with a fixed probability or varying probability. |
|---|---|
| AbstractList | ► This paper presents three new hybrid ACO algorithms for constrained optimization problems. ► All three algorithms are based on ACOR. ► Fourteen problems selected from various domains were tested. ► All three algorithms greatly outperform the original ACOR. ► This paper also investigated the relative performance of applying local search with fixed and varying probability.
This paper presents three new hybrid ant colony optimization algorithms that are extended from the ACOR developed by Socha and Dorigo for solving mixed discrete–continuous constrained optimization problems. The first two hybrids, labeled ACOR-HJ and ACOR-DE, differs in philosophy with the former integrating ACOR with the effective Hooke and Jeeves local search method and the latter a cooperative hybrid between ACOR and differentia evolution. The third hybrid, labeled ACOR-DE-HJ, is the second cooperative hybrid enhanced with the Hooke and Jeeves local search. All three algorithms incorporate a method to handle mixed discrete–continuous variables and the Deb’s parameterless penalty method for handling constraints. Fourteen problems selected from various domains were used for testing the performance of both algorithms. It was showed that all three algorithms greatly outperform the original ACOR in finding the exact or near global optima. An investigation was also carried out to determine the relative performance of applying local search with a fixed probability or varying probability. |
| Author | Liao, T. Warren Kuo, R.J. Hu, J.T.L. |
| Author_xml | – sequence: 1 givenname: T. Warren surname: Liao fullname: Liao, T. Warren email: ieliao@lsu.edu organization: Department of Mechanical and Industrial Engineering, Louisiana State University, Baton Rouge, LA 70803, USA – sequence: 2 givenname: R.J. surname: Kuo fullname: Kuo, R.J. organization: Department of Industrial Management, National Taiwan University of Science and Technology, Taipei 10607, Taiwan – sequence: 3 givenname: J.T.L. surname: Hu fullname: Hu, J.T.L. organization: Department of Business Management, National Taipei University of Technology, Taipei 10608, Taiwan |
| BookMark | eNp90L1OwzAQwHELFYm28ABseYGEc74jJlQBRUJigdlyzhdwldiV7SLKxDvwhjwJKWWBodNNv9Pdf8Ymxhpi7JxDwoGXF6tEDpikwNMEmgTK_IhNeV1lcVHmzYRNAZoyzgCyEzbzfgUAVcnzKRPLbeu0iqQJEdremm1k10EP-l0GbU0k-2frdHgZfNRZFw36jVSktEdHgb4-PtGaoM3Gbvxft3a27Wnwp-y4k72ns985Z08314-LZXz_cHu3uLqPMW2qEKcFFg1CJcuy5R3nLSmObSc77FqeZogpIaRABDzPa2xy4qrNC6VqoLZGzOas2u9FZ7131AnU4eeU4KTuBQex6yRWYuwkdp0ENGLsNEr-T66dHqTbHjSXe0PjS6-anPCoySAp7QiDUFYf0N_-B4fw |
| CitedBy_id | crossref_primary_10_1155_2016_8932896 crossref_primary_10_1016_j_asoc_2015_10_007 crossref_primary_10_1016_j_compag_2015_12_021 crossref_primary_10_1109_ACCESS_2024_3511671 crossref_primary_10_1016_j_asr_2021_03_017 crossref_primary_10_1155_2022_1634995 crossref_primary_10_1007_s11590_014_0762_6 crossref_primary_10_1016_j_asoc_2014_02_026 crossref_primary_10_1007_s10462_020_09931_5 crossref_primary_10_1155_2014_174185 crossref_primary_10_3390_sym10040104 crossref_primary_10_1016_j_asoc_2014_03_033 crossref_primary_10_1016_j_asoc_2013_05_003 crossref_primary_10_1080_00207721_2014_891664 |
| Cites_doi | 10.1016/S0045-7825(99)00389-8 10.1016/j.ces.2006.03.004 10.1016/j.eswa.2011.02.151 10.1162/106454699568728 10.1021/ie990700g 10.1023/A:1008202821328 10.1016/j.ejor.2006.06.046 10.1007/s10589-008-9176-7 10.1109/3477.484436 10.1016/j.amc.2006.09.098 10.1016/j.asoc.2010.05.007 10.1145/321062.321069 |
| ContentType | Journal Article |
| Copyright | 2012 Elsevier Inc. |
| Copyright_xml | – notice: 2012 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.amc.2012.09.064 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics |
| EISSN | 1873-5649 |
| EndPage | 3252 |
| ExternalDocumentID | 10_1016_j_amc_2012_09_064 S0096300312009630 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 1B1 1RT 1~. 1~5 23M 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAXUO ABAOU ABFNM ABFRF ABJNI ABMAC ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACRLP ADBBV ADEZE ADGUI ADMUD AEBSH AEFWE AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ ARUGR AXJTR BKOJK BLXMC CS3 EBS EFJIC EFLBG EO8 EO9 EP2 EP3 F5P FDB FIRID FNPLU FYGXN G-Q GBLVA HZ~ IHE J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 RIG RNS ROL RPZ RXW SBC SDF SDG SES SME SPC SPCBC SSW SSZ T5K TN5 WH7 X6Y XPP ZMT ~02 ~G- 9DU AAQXK AATTM AAXKI AAYWO AAYXX ABEFU ABWVN ACLOT ACRPL ACVFH ADCNI ADIYS ADNMO AEIPS AEUPX AFFNX AFJKZ AFPUW AGQPQ AI. AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EJD FEDTE FGOYB G-2 HLZ HMJ HVGLF R2- SEW TAE VH1 VOH WUQ ~HD |
| ID | FETCH-LOGICAL-c297t-25c59c07a66b1f11bed1cbfafcfb123cc2ec020ee01448c94e1db45dd80eb8cc3 |
| ISICitedReferencesCount | 20 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000310649900038&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0096-3003 |
| IngestDate | Sat Nov 29 06:12:32 EST 2025 Tue Nov 18 21:55:22 EST 2025 Fri Feb 23 02:27:04 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Keywords | Ant colony optimization Metaheuristic Mixed discrete–continuous Hybrid metaheuristic Constrained optimization |
| Language | English |
| License | https://www.elsevier.com/tdm/userlicense/1.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c297t-25c59c07a66b1f11bed1cbfafcfb123cc2ec020ee01448c94e1db45dd80eb8cc3 |
| PageCount | 12 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_amc_2012_09_064 crossref_primary_10_1016_j_amc_2012_09_064 elsevier_sciencedirect_doi_10_1016_j_amc_2012_09_064 |
| PublicationCentury | 2000 |
| PublicationDate | 2012-11-25 |
| PublicationDateYYYYMMDD | 2012-11-25 |
| PublicationDate_xml | – month: 11 year: 2012 text: 2012-11-25 day: 25 |
| PublicationDecade | 2010 |
| PublicationTitle | Applied mathematics and computation |
| PublicationYear | 2012 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Storn, Price (b0070) 1997; 11 Dorigo, Maniezzo, Colorni (b0015) 1996; 26 Dréo, Siarry (b0030) 2002 Shelokar, Siarry, Jayaraman, Kulkarni (b0045) 2007; 188 Dorigo, Stützle (b0010) 2004 Deb (b0060) 2000; 186 Liao (b0080) 2010; 10 Xiao, Li (b0055) 2011; 38 Hooke, Jeeves (b0065) 1961; 8 Bilchev, Parmee (b0025) 1995 Mathur, Karale, Priye, Jayaraman, Kulkarni (b0040) 2000; 39 Dorigo, Di Caro, Gambardella (b0020) 1999; 5 Socha, Dorigo (b0035) 2008; 185 Angira, Babu (b0075) 2006; 61 M. Dorigo, Optimization, Learning, and Natural Algorithms (in Italian), Ph.D. Thesis, Dipartimento di Elettronica, Politechico di Milano, Italy, 1992. Karimi, Nobahari, Siarry (b0050) 2010; 45 Bilchev (10.1016/j.amc.2012.09.064_b0025) 1995 Shelokar (10.1016/j.amc.2012.09.064_b0045) 2007; 188 Angira (10.1016/j.amc.2012.09.064_b0075) 2006; 61 Dorigo (10.1016/j.amc.2012.09.064_b0020) 1999; 5 Mathur (10.1016/j.amc.2012.09.064_b0040) 2000; 39 Dorigo (10.1016/j.amc.2012.09.064_b0015) 1996; 26 Karimi (10.1016/j.amc.2012.09.064_b0050) 2010; 45 Hooke (10.1016/j.amc.2012.09.064_b0065) 1961; 8 10.1016/j.amc.2012.09.064_b0005 Dréo (10.1016/j.amc.2012.09.064_b0030) 2002 Dorigo (10.1016/j.amc.2012.09.064_b0010) 2004 Storn (10.1016/j.amc.2012.09.064_b0070) 1997; 11 Socha (10.1016/j.amc.2012.09.064_b0035) 2008; 185 Liao (10.1016/j.amc.2012.09.064_b0080) 2010; 10 Deb (10.1016/j.amc.2012.09.064_b0060) 2000; 186 Xiao (10.1016/j.amc.2012.09.064_b0055) 2011; 38 |
| References_xml | – volume: 185 start-page: 1155 year: 2008 end-page: 1173 ident: b0035 article-title: Ant colony optimization for continuous domains publication-title: European Journal of Operational Research – volume: 45 start-page: 639 year: 2010 end-page: 661 ident: b0050 article-title: Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions publication-title: Computational Optimization and Applications – volume: 61 start-page: 4707 year: 2006 end-page: 4721 ident: b0075 article-title: Optimization of process synthesis and design problems: a modified differential evolution approach publication-title: Chemical Engineering Science – year: 2004 ident: b0010 article-title: Ant Colony Optimization – volume: 5 start-page: 137 year: 1999 end-page: 172 ident: b0020 article-title: Ant algorithms for discrete optimization publication-title: Artificial Life – reference: M. Dorigo, Optimization, Learning, and Natural Algorithms (in Italian), Ph.D. Thesis, Dipartimento di Elettronica, Politechico di Milano, Italy, 1992. – volume: 8 start-page: 212 year: 1961 end-page: 229 ident: b0065 article-title: Direct search solution of numerical and statistical problems publication-title: Journal of the ACM – volume: 188 start-page: 129 year: 2007 end-page: 142 ident: b0045 article-title: Particle swarm and ant colony algorithms hybridized for improved continuous optimization publication-title: Applied Mathematics and Computation – volume: 38 start-page: 11072 year: 2011 end-page: 11077 ident: b0055 article-title: A hybrid ant colony optimization for continuous domains publication-title: Expert Systems with Applications – volume: 39 start-page: 3814 year: 2000 end-page: 3822 ident: b0040 article-title: Ant colony approach to continuous function optimization publication-title: Industrial & Engineering Chemistry Research – start-page: 25 year: 1995 end-page: 39 ident: b0025 article-title: The ant colony metaphor for searching continuous design spaces publication-title: LNCS 993 – volume: 26 start-page: 29 year: 1996 end-page: 41 ident: b0015 article-title: Ant systems: optimization by a colony of cooperating agents publication-title: IEEE Transactions on Systems, Man, and Cybernetics – Part B – start-page: 216 year: 2002 end-page: 221 ident: b0030 article-title: A new ant colony algorithm using the heterarchical concept aimed at optimization of multiminima continuous functions publication-title: LNCS 2463 – volume: 186 start-page: 311 year: 2000 end-page: 338 ident: b0060 article-title: An efficient constraint handling method for genetic algorithms publication-title: Computer Methods in Applied Mechanics and Engineering – volume: 10 start-page: 1188 year: 2010 end-page: 1199 ident: b0080 article-title: Two hybrid differential evolution algorithms for engineering design optimization publication-title: Applied Soft Computing – volume: 11 start-page: 341 year: 1997 end-page: 359 ident: b0070 article-title: Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces publication-title: Journal of Global Optimization – ident: 10.1016/j.amc.2012.09.064_b0005 – volume: 186 start-page: 311 issue: 2–4 year: 2000 ident: 10.1016/j.amc.2012.09.064_b0060 article-title: An efficient constraint handling method for genetic algorithms publication-title: Computer Methods in Applied Mechanics and Engineering doi: 10.1016/S0045-7825(99)00389-8 – year: 2004 ident: 10.1016/j.amc.2012.09.064_b0010 – volume: 61 start-page: 4707 year: 2006 ident: 10.1016/j.amc.2012.09.064_b0075 article-title: Optimization of process synthesis and design problems: a modified differential evolution approach publication-title: Chemical Engineering Science doi: 10.1016/j.ces.2006.03.004 – volume: 38 start-page: 11072 year: 2011 ident: 10.1016/j.amc.2012.09.064_b0055 article-title: A hybrid ant colony optimization for continuous domains publication-title: Expert Systems with Applications doi: 10.1016/j.eswa.2011.02.151 – volume: 5 start-page: 137 issue: 2 year: 1999 ident: 10.1016/j.amc.2012.09.064_b0020 article-title: Ant algorithms for discrete optimization publication-title: Artificial Life doi: 10.1162/106454699568728 – volume: 39 start-page: 3814 year: 2000 ident: 10.1016/j.amc.2012.09.064_b0040 article-title: Ant colony approach to continuous function optimization publication-title: Industrial & Engineering Chemistry Research doi: 10.1021/ie990700g – start-page: 25 year: 1995 ident: 10.1016/j.amc.2012.09.064_b0025 article-title: The ant colony metaphor for searching continuous design spaces – volume: 11 start-page: 341 year: 1997 ident: 10.1016/j.amc.2012.09.064_b0070 article-title: Differential evolution – a simple and efficient heuristic for global optimization over continuous spaces publication-title: Journal of Global Optimization doi: 10.1023/A:1008202821328 – volume: 185 start-page: 1155 year: 2008 ident: 10.1016/j.amc.2012.09.064_b0035 article-title: Ant colony optimization for continuous domains publication-title: European Journal of Operational Research doi: 10.1016/j.ejor.2006.06.046 – volume: 45 start-page: 639 year: 2010 ident: 10.1016/j.amc.2012.09.064_b0050 article-title: Continuous ant colony system and tabu search algorithms hybridized for global minimization of continuous multi-minima functions publication-title: Computational Optimization and Applications doi: 10.1007/s10589-008-9176-7 – volume: 26 start-page: 29 issue: 1 year: 1996 ident: 10.1016/j.amc.2012.09.064_b0015 article-title: Ant systems: optimization by a colony of cooperating agents publication-title: IEEE Transactions on Systems, Man, and Cybernetics – Part B doi: 10.1109/3477.484436 – volume: 188 start-page: 129 year: 2007 ident: 10.1016/j.amc.2012.09.064_b0045 article-title: Particle swarm and ant colony algorithms hybridized for improved continuous optimization publication-title: Applied Mathematics and Computation doi: 10.1016/j.amc.2006.09.098 – volume: 10 start-page: 1188 year: 2010 ident: 10.1016/j.amc.2012.09.064_b0080 article-title: Two hybrid differential evolution algorithms for engineering design optimization publication-title: Applied Soft Computing doi: 10.1016/j.asoc.2010.05.007 – start-page: 216 year: 2002 ident: 10.1016/j.amc.2012.09.064_b0030 article-title: A new ant colony algorithm using the heterarchical concept aimed at optimization of multiminima continuous functions – volume: 8 start-page: 212 issue: 2 year: 1961 ident: 10.1016/j.amc.2012.09.064_b0065 article-title: Direct search solution of numerical and statistical problems publication-title: Journal of the ACM doi: 10.1145/321062.321069 |
| SSID | ssj0007614 |
| Score | 2.1484396 |
| Snippet | ► This paper presents three new hybrid ACO algorithms for constrained optimization problems. ► All three algorithms are based on ACOR. ► Fourteen problems... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 3241 |
| SubjectTerms | Ant colony optimization Constrained optimization Hybrid metaheuristic Metaheuristic Mixed discrete–continuous |
| Title | Hybrid ant colony optimization algorithms for mixed discrete–continuous optimization problems |
| URI | https://dx.doi.org/10.1016/j.amc.2012.09.064 |
| Volume | 219 |
| WOSCitedRecordID | wos000310649900038&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 Freedom Collection - Elsevier customDbUrl: eissn: 1873-5649 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0007614 issn: 0096-3003 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3LbtQwFLWGlgUsEE9RCsgLVkSJ8o69rFBRqUqFYBCzs-IXpJrJjOZRTXf9BcQf8iVcx_Ek0wICJDZRZI2TzL0n18fOvccIvQDGSpSmqS_hVfPTLMv8kqTEL6Qoo1KTXPGw2WyiOD0loxF9Nxh8dbUw5-Oirsl6TWf_1dXQBs42pbN_4e7NRaEBzsHpcAS3w_GPHH90YYqwPLCYZxSp6wtvCmFh0tZbeuX483ReLb9YIQZvUq2Bcpra3DnQZ5f6kJgM9qpemfzYrd7t_jOLPqd1RHayUYBduGq52Wr7S_9JVTZLs8PA-2RyhLsUgFXT_j44DjqgNQgLhsFJ0F-biGJTpGfrmO2CmSua2crpNLMmPwlDG9eUjbukSPwst-qlLjC7YFpdC7PAAqPekJ3EVgX32nBgVybOgnJi1CrNsi8NQquafkVl-4N5KvNQUWzPbqDduMgoxPrdgzeHo-PN8F7kVjDe_Qv3qbxJGrxyo5-TnR6BGd5Fd9qZBz6wiLmHBqq-j26_7Zz2ADGLHQzYwRY7uO993GEHA3Zwgx3ssPP98luHmu1-DjUP0cfXh8NXR367A4cvYloswZcioyIsyjznkY4irmQkuC610BwojxCxEjDfUMrMy4mgqYokTzMpSag4ESJ5hHbqaa0eI0w1j0XCJcwwZBprQbVKUg18WGoRh5LuodCZiolWnt7skjJmLg_xjIF1mbEuCykD6-6hl5suM6vN8rsfp87-rCWXljQyAMuvuz35t2776Fb3PjxFO8v5Sj1DN8X5slrMn7eQ-gHpqKHu |
| 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=Hybrid+ant+colony+optimization+algorithms+for+mixed+discrete%E2%80%93continuous+optimization+problems&rft.jtitle=Applied+mathematics+and+computation&rft.au=Liao%2C+T.+Warren&rft.au=Kuo%2C+R.J.&rft.au=Hu%2C+J.T.L.&rft.date=2012-11-25&rft.pub=Elsevier+Inc&rft.issn=0096-3003&rft.eissn=1873-5649&rft.volume=219&rft.issue=6&rft.spage=3241&rft.epage=3252&rft_id=info:doi/10.1016%2Fj.amc.2012.09.064&rft.externalDocID=S0096300312009630 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0096-3003&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0096-3003&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0096-3003&client=summon |