Combinatorial Optimization Problems and Metaheuristics: Review, Challenges, Design, and Development
In the past few decades, metaheuristics have demonstrated their suitability in addressing complex problems over different domains. This success drives the scientific community towards the definition of new and better-performing heuristics and results in an increased interest in this research field....
Uloženo v:
| Vydáno v: | Applied sciences Ročník 11; číslo 14; s. 6449 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Basel
MDPI AG
13.07.2021
|
| Témata: | |
| ISSN: | 2076-3417, 2076-3417 |
| 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 | In the past few decades, metaheuristics have demonstrated their suitability in addressing complex problems over different domains. This success drives the scientific community towards the definition of new and better-performing heuristics and results in an increased interest in this research field. Nevertheless, new studies have been focused on developing new algorithms without providing consolidation of the existing knowledge. Furthermore, the absence of rigor and formalism to classify, design, and develop combinatorial optimization problems and metaheuristics represents a challenge to the field’s progress. This study discusses the main concepts and challenges in this area and proposes a formalism to classify, design, and code combinatorial optimization problems and metaheuristics. We believe these contributions may support the progress of the field and increase the maturity of metaheuristics as problem solvers analogous to other machine learning algorithms. |
|---|---|
| AbstractList | In the past few decades, metaheuristics have demonstrated their suitability in addressing complex problems over different domains. This success drives the scientific community towards the definition of new and better-performing heuristics and results in an increased interest in this research field. Nevertheless, new studies have been focused on developing new algorithms without providing consolidation of the existing knowledge. Furthermore, the absence of rigor and formalism to classify, design, and develop combinatorial optimization problems and metaheuristics represents a challenge to the field’s progress. This study discusses the main concepts and challenges in this area and proposes a formalism to classify, design, and code combinatorial optimization problems and metaheuristics. We believe these contributions may support the progress of the field and increase the maturity of metaheuristics as problem solvers analogous to other machine learning algorithms. |
| Author | Peres, Fernando Castelli, Mauro |
| Author_xml | – sequence: 1 givenname: Fernando surname: Peres fullname: Peres, Fernando – sequence: 2 givenname: Mauro orcidid: 0000-0002-8793-1451 surname: Castelli fullname: Castelli, Mauro |
| BookMark | eNptUV1rFDEUDdKCte2Tf2DAR3drvibJ-CZbbQuViuhzuJvc2WaZScYkW9Ff3-muQhHvy70czjkc7nlFjmKKSMhrRi-E6Og7mCbGmFRSdi_ICadaLYVk-ujZ_ZKcl7Kl83RMGEZPiFulcR0i1JQDDM3dVMMYfkMNKTZfcloPOJYGom8-Y4V73OVQanDlffMVHwL-XDSrexgGjBssi-YSS9jExZ5_iQ84pGnEWM_IcQ9DwfM_-5R8__Tx2-p6eXt3dbP6cLt0UtC65F3PnWfOad8LCp1RQklwErkH7h14w8GhVh5RKWZa0WnVKjFjiq-1FuKU3Bx8fYKtnXIYIf-yCYLdAylvLOQ5_YB2tjGCIxhvtIQOurXomDIgdS9E25rZ683Ba8rpxw5Ltdu0y3GOb3nbSkkNNU8sdmC5nErJ2FsX6v55NUMYLKP2qRr7rJpZ8_Yfzd-k_2M_AlbnkT4 |
| CitedBy_id | crossref_primary_10_3390_machines12030180 crossref_primary_10_1109_COMST_2024_3390613 crossref_primary_10_1016_j_jobe_2023_106113 crossref_primary_10_1002_cpe_7469 crossref_primary_10_1016_j_ejor_2025_08_034 crossref_primary_10_1108_DTA_11_2023_0788 crossref_primary_10_3390_math13010174 crossref_primary_10_3390_sym13091745 crossref_primary_10_32604_cmes_2024_053373 crossref_primary_10_1007_s10586_025_05532_5 crossref_primary_10_1016_j_ins_2024_121693 crossref_primary_10_3390_biomimetics9100631 crossref_primary_10_1016_j_solener_2023_111866 crossref_primary_10_3390_sym15071432 crossref_primary_10_1177_14727978251361282 crossref_primary_10_46223_HCMCOUJS_acs_en_14_1_47_2024 crossref_primary_10_1016_j_clscn_2023_100106 crossref_primary_10_1007_s40747_024_01365_8 crossref_primary_10_3390_biomimetics9060307 crossref_primary_10_1103_PhysRevResearch_7_013243 crossref_primary_10_3390_wevj16050266 crossref_primary_10_1002_cpe_8302 crossref_primary_10_1016_j_heliyon_2024_e26407 crossref_primary_10_3390_app14114878 crossref_primary_10_1007_s11227_024_06167_w crossref_primary_10_1016_j_knosys_2024_112098 crossref_primary_10_1007_s12530_025_09683_z crossref_primary_10_3390_s24072231 crossref_primary_10_1109_TPAMI_2025_3569284 crossref_primary_10_3390_axioms12121088 crossref_primary_10_3390_app12094127 crossref_primary_10_37251_ijome_v3i1_1616 crossref_primary_10_1109_ACCESS_2025_3583584 crossref_primary_10_1016_j_eswa_2024_124400 crossref_primary_10_1016_j_egyr_2022_09_025 crossref_primary_10_1007_s11540_024_09755_8 crossref_primary_10_3390_computers14090345 crossref_primary_10_1016_j_rineng_2025_104866 crossref_primary_10_1016_j_engappai_2024_109738 crossref_primary_10_3390_pr13061632 crossref_primary_10_1016_j_compeleceng_2024_109812 crossref_primary_10_1016_j_jcou_2023_102620 crossref_primary_10_1007_s43069_025_00429_w crossref_primary_10_1016_j_asoc_2023_110908 crossref_primary_10_1016_j_eswa_2024_125720 crossref_primary_10_1371_journal_pone_0263991 crossref_primary_10_3390_s22124380 crossref_primary_10_1111_exsy_13800 crossref_primary_10_3390_math12081249 crossref_primary_10_3390_biomimetics9100647 crossref_primary_10_3390_technologies12040045 crossref_primary_10_1007_s13042_025_02588_y crossref_primary_10_1063_5_0176386 crossref_primary_10_1088_1367_2630_add365 crossref_primary_10_3390_eng5030104 crossref_primary_10_1016_j_ifacol_2023_10_484 crossref_primary_10_1016_j_cosrev_2023_100559 crossref_primary_10_1016_j_jii_2024_100727 crossref_primary_10_1016_j_actatropica_2025_107657 crossref_primary_10_7717_peerj_cs_2935 crossref_primary_10_3390_biomimetics8020235 crossref_primary_10_3390_math10091544 crossref_primary_10_1007_s11425_023_2290_y crossref_primary_10_3390_app14199142 crossref_primary_10_3390_polym14020240 crossref_primary_10_3390_math13101601 crossref_primary_10_1142_S0219686725500209 crossref_primary_10_1007_s00500_024_09761_5 crossref_primary_10_3233_JIFS_222923 |
| Cites_doi | 10.1007/978-3-540-78295-7_1 10.1016/j.swevo.2019.04.008 10.1016/j.ejor.2021.05.042 10.1109/WSC.2018.8632464 10.1007/978-3-319-58253-5_5 10.1007/s10462-017-9605-z 10.1007/978-3-319-91086-4 10.1007/978-3-642-16544-3_2 10.1109/4235.585893 10.1007/s11047-008-9098-4 10.1109/ACCESS.2018.2856832 10.1016/j.sbspro.2015.01.970 10.1145/2739482.2768499 10.1109/CESYS.2016.7889811 10.1016/j.renene.2017.05.087 10.1109/ACCESS.2020.3048438 10.1007/s10100-018-0522-2 10.1109/ACCESS.2021.3054636 10.1007/s10559-006-0086-3 10.1504/IJMHEUR.2014.068914 10.1145/337885.337899 10.1016/j.asoc.2020.106382 10.1002/9780470496916 10.1162/evco_a_00211 10.1109/ChiCC.2014.6896450 10.1007/BF02430363 10.1007/s11227-015-1592-8 10.1016/j.swevo.2013.06.001 10.1111/itor.12001 10.3390/s19224834 10.1145/2598394.2609841 10.1111/itor.12996 10.1080/0952813X.2013.782347 10.1023/A:1016540724870 10.1007/s00500-011-0754-8 10.1201/9781315183176 10.1016/j.asoc.2018.01.022 10.3390/math8122240 10.1007/s13042-018-0833-6 10.1007/s00500-014-1493-4 10.1109/TEVC.2015.2504730 10.1007/s11047-020-09824-0 10.1109/WCCCT.2016.53 10.1007/978-3-319-50920-4_19 10.1101/gr.1262503 10.1007/978-3-642-24488-9 10.1007/s10601-015-9209-7 10.4249/scholarpedia.11472 10.1145/937503.937505 10.1007/978-3-319-77625-5 10.1145/2576768.2598367 10.1109/TEVC.2019.2921598 10.1109/TASSP.1984.1164450 10.1016/j.rser.2017.08.034 10.1007/978-3-319-91722-1 10.1007/s10852-006-9041-6 10.1016/j.ins.2014.11.023 10.1016/B978-0-12-416743-8.00010-5 10.1007/978-1-4419-1644-0_9 10.1007/978-0-387-77247-9 10.1016/j.ins.2013.02.041 10.1016/j.dib.2020.105792 10.20944/preprints201805.0221.v2 10.20944/preprints202101.0048.v1 10.1007/978-3-319-07153-4_4-1 10.1109/ICDE.2018.00028 10.1016/j.swevo.2019.100618 10.1007/s42979-019-0050-8 10.1007/s00500-016-2471-9 10.1007/s12559-020-09730-8 10.1016/j.cie.2019.106040 10.1007/b101874 10.1145/2908812.2908814 10.1145/2501654.2501658 10.1016/j.ejor.2019.01.063 10.1007/s11047-020-09820-4 |
| ContentType | Journal Article |
| Copyright | 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | AAYXX CITATION ABUWG AFKRA AZQEC BENPR CCPQU DWQXO PHGZM PHGZT PIMPY PKEHL PQEST PQQKQ PQUKI PRINS DOA |
| DOI | 10.3390/app11146449 |
| DatabaseName | CrossRef ProQuest Central (Alumni) ProQuest Central UK/Ireland ProQuest Central Essentials ProQuest Central ProQuest One ProQuest Central ProQuest Central Premium ProQuest One Academic (New) Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest Central Essentials ProQuest One Academic Eastern Edition ProQuest Central (Alumni Edition) ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Academic UKI Edition ProQuest Central Korea ProQuest Central (New) ProQuest One Academic ProQuest One Academic (New) |
| DatabaseTitleList | Publicly Available Content Database CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Sciences (General) |
| EISSN | 2076-3417 |
| ExternalDocumentID | oai_doaj_org_article_e76832ea8d874a9a9b39168a47f33558 10_3390_app11146449 |
| GroupedDBID | .4S 2XV 5VS 7XC 8CJ 8FE 8FG 8FH AADQD AAFWJ AAYXX ADBBV ADMLS AFFHD AFKRA AFPKN AFZYC ALMA_UNASSIGNED_HOLDINGS APEBS ARCSS BCNDV BENPR CCPQU CITATION CZ9 D1I D1J D1K GROUPED_DOAJ IAO IGS ITC K6- K6V KC. KQ8 L6V LK5 LK8 M7R MODMG M~E OK1 P62 PHGZM PHGZT PIMPY PROAC TUS ABUWG AZQEC DWQXO PKEHL PQEST PQQKQ PQUKI PRINS |
| ID | FETCH-LOGICAL-c430t-29f2cd1cc7df30a986364ac4e2da2dcad82ace76dee661853976563ace62b7733 |
| IEDL.DBID | DOA |
| ISICitedReferencesCount | 82 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000678175000001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2076-3417 |
| IngestDate | Tue Oct 14 14:47:31 EDT 2025 Mon Jun 30 07:35:46 EDT 2025 Sat Nov 29 07:13:38 EST 2025 Tue Nov 18 21:30:45 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 14 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c430t-29f2cd1cc7df30a986364ac4e2da2dcad82ace76dee661853976563ace62b7733 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-8793-1451 |
| OpenAccessLink | https://doaj.org/article/e76832ea8d874a9a9b39168a47f33558 |
| PQID | 2554408088 |
| PQPubID | 2032433 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_e76832ea8d874a9a9b39168a47f33558 proquest_journals_2554408088 crossref_citationtrail_10_3390_app11146449 crossref_primary_10_3390_app11146449 |
| PublicationCentury | 2000 |
| PublicationDate | 2021-07-13 |
| PublicationDateYYYYMMDD | 2021-07-13 |
| PublicationDate_xml | – month: 07 year: 2021 text: 2021-07-13 day: 13 |
| PublicationDecade | 2020 |
| PublicationPlace | Basel |
| PublicationPlace_xml | – name: Basel |
| PublicationTitle | Applied sciences |
| PublicationYear | 2021 |
| Publisher | MDPI AG |
| Publisher_xml | – name: MDPI AG |
| References | Fong (ref_89) 2016; 72 ref_14 McGeoch (ref_86) 1999; 30 ref_56 ref_11 Gil (ref_46) 2007; 6 ref_52 Lepagnot (ref_2) 2013; 237 ref_51 Baghel (ref_78) 2012; 58 ref_19 KumarBhati (ref_31) 2014; 96 ref_15 ref_59 Woon (ref_37) 2010; 217 Pellerin (ref_83) 2020; 280 Xin (ref_40) 2018; 6 Kamath (ref_74) 2015; 7 Papadimitriou (ref_35) 1984; 32 Barr (ref_85) 1995; 1 Bianchi (ref_27) 2009; 8 Piotrowski (ref_18) 2015; 297 Fister (ref_53) 2013; 13 Shi (ref_65) 2018; 65 ref_61 Wolpert (ref_17) 1997; 1 Blum (ref_36) 2003; 35 Abdmouleh (ref_8) 2017; 113 Li (ref_68) 2021; 9 Jahwar (ref_1) 2021; 17 Doerner (ref_47) 2018; 26 (ref_57) 2015; 22 Lones (ref_62) 2020; 1 Sergienko (ref_39) 2006; 42 Nesmachnow (ref_16) 2014; 3 ref_24 ref_23 ref_67 ref_22 ref_21 ref_20 ref_63 Przybylek (ref_50) 2018; 26 Juan (ref_10) 2015; 2 Liu (ref_58) 2013; 45 ref_29 ref_28 ref_26 Molina (ref_12) 2020; 12 Adetunji (ref_55) 2021; 9 Tzanetos (ref_60) 2020; 31 Osaba (ref_13) 2019; 48 Li (ref_45) 2016; 20 ref_72 (ref_32) 2015; 174 Parejo (ref_4) 2012; 16 Anantharaj (ref_70) 2015; 10 ref_79 ref_33 Yang (ref_25) 2011; 6 ref_30 Nordin (ref_54) 2016; 2 ref_73 Martarelli (ref_76) 2020; 52 Molina (ref_90) 2017; 21 Patnaik (ref_71) 2017; 10 Moles (ref_64) 2003; 13 Hussain (ref_6) 2019; 52 Milano (ref_80) 2011; 45 Blum (ref_34) 2008; 114 Talbi (ref_66) 2002; 8 ref_81 Liu (ref_38) 2020; 93 Eshtay (ref_5) 2019; 10 Li (ref_75) 2018; 81 ref_44 ref_88 ref_43 ref_42 ref_41 Liu (ref_91) 2016; 20 ref_84 Gogna (ref_7) 2013; 25 ref_3 (ref_69) 2018; 2018 Amodeo (ref_93) 2018; 62 Huang (ref_87) 2020; 24 ref_49 ref_48 ref_9 Hussain (ref_92) 2017; 1 Dokeroglu (ref_77) 2019; 137 Urli (ref_82) 2015; 20 |
| References_xml | – volume: 114 start-page: 1 year: 2008 ident: ref_34 article-title: Hybrid Metaheuristics: An Introduction publication-title: Hybrid Metaheuristics doi: 10.1007/978-3-540-78295-7_1 – volume: 48 start-page: 220 year: 2019 ident: ref_13 article-title: Bio-Inspired Computation: Where We Stand and What’s Next publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2019.04.008 – ident: ref_20 doi: 10.1016/j.ejor.2021.05.042 – ident: ref_11 doi: 10.1109/WSC.2018.8632464 – volume: 62 start-page: 75 year: 2018 ident: ref_93 article-title: A Re-characterization of Hyper-Heuristics publication-title: Recent Developments in Metaheuristics doi: 10.1007/978-3-319-58253-5_5 – volume: 52 start-page: 2191 year: 2019 ident: ref_6 article-title: Metaheuristic Research: A Comprehensive Survey publication-title: Artif. Intell. Rev. doi: 10.1007/s10462-017-9605-z – ident: ref_29 doi: 10.1007/978-3-319-91086-4 – ident: ref_52 doi: 10.1007/978-3-642-16544-3_2 – ident: ref_84 – volume: 1 start-page: 67 year: 1997 ident: ref_17 article-title: No Free Lunch Theorems for Optimization publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/4235.585893 – volume: 8 start-page: 239 year: 2009 ident: ref_27 article-title: A Survey on Metaheuristics for Stochastic Combinatorial Optimization publication-title: Nat. Comput. doi: 10.1007/s11047-008-9098-4 – volume: 6 start-page: 41256 year: 2018 ident: ref_40 article-title: Interactive Multiobjective Optimization: A Review of the State-of-the-Art publication-title: IEEE Access doi: 10.1109/ACCESS.2018.2856832 – volume: 174 start-page: 2798 year: 2015 ident: ref_32 article-title: Theory of Problem Solving publication-title: Procedia Soc. Behav. Sci. doi: 10.1016/j.sbspro.2015.01.970 – ident: ref_9 doi: 10.1145/2739482.2768499 – ident: ref_72 doi: 10.1109/CESYS.2016.7889811 – volume: 2018 start-page: 1 year: 2018 ident: ref_69 article-title: A Taxonomy for Management and Optimization of Multiple Resources in Edge Computing publication-title: Wirel. Commun. Mob. Comput. – volume: 113 start-page: 266 year: 2017 ident: ref_8 article-title: Review of Optimization Techniques Applied for the Integration of Distributed Generation from Renewable Energy Sources publication-title: Renew. Energy doi: 10.1016/j.renene.2017.05.087 – volume: 9 start-page: 5046 year: 2021 ident: ref_55 article-title: A Review of Metaheuristic Techniques for Optimal Integration of Electrical Units in Distribution Networks publication-title: IEEE Access doi: 10.1109/ACCESS.2020.3048438 – volume: 26 start-page: 331 year: 2018 ident: ref_47 article-title: Metaheuristic Search Techniques for Multi-Objective and Stochastic Problems: A History of the Inventions of Walter J. Gutjahr in the Past 22 Years publication-title: Cent. Eur. J. Oper. Res. doi: 10.1007/s10100-018-0522-2 – volume: 9 start-page: 19960 year: 2021 ident: ref_68 article-title: An Adaptive Multi-Population Optimization Algorithm for Global Continuous Optimization publication-title: IEEE Access doi: 10.1109/ACCESS.2021.3054636 – volume: 42 start-page: 465 year: 2006 ident: ref_39 article-title: Problems of Discrete Optimization: Challenges and Main Approaches to Solve Them publication-title: Cybern. Syst. Anal. doi: 10.1007/s10559-006-0086-3 – volume: 3 start-page: 320 year: 2014 ident: ref_16 article-title: An Overview of Metaheuristics: Accurate and Efficient Methods for Optimisation publication-title: Int. J. Metaheuristics doi: 10.1504/IJMHEUR.2014.068914 – volume: 30 start-page: 85 year: 1999 ident: ref_86 article-title: How to Present a Paper on Experimental Work with Algorithms publication-title: ACM SIGACT News doi: 10.1145/337885.337899 – volume: 217 start-page: 25 year: 2010 ident: ref_37 article-title: A Critical Review of Discrete Filled Function Methods in Solving Nonlinear Discrete Optimization Problems publication-title: Appl. Math. Comput. – volume: 93 start-page: 106382 year: 2020 ident: ref_38 article-title: Multi-Objective Metaheuristics for Discrete Optimization Problems: A Review of the State-of-the-Art publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2020.106382 – ident: ref_67 doi: 10.1002/9780470496916 – volume: 26 start-page: 507 year: 2018 ident: ref_50 article-title: Decomposition Algorithms for a Multi-Hard Problem publication-title: Evol. Comput. doi: 10.1162/evco_a_00211 – ident: ref_59 doi: 10.1109/ChiCC.2014.6896450 – volume: 1 start-page: 9 year: 1995 ident: ref_85 article-title: Designing and Reporting on Computational Experiments with Heuristic Methods publication-title: J. Heuristics doi: 10.1007/BF02430363 – volume: 72 start-page: 3764 year: 2016 ident: ref_89 article-title: Recent Advances in Metaheuristic Algorithms: Does the Makara Dragon Exist? publication-title: J. Supercomput. doi: 10.1007/s11227-015-1592-8 – volume: 13 start-page: 34 year: 2013 ident: ref_53 article-title: A Comprehensive Review of Firefly Algorithms publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2013.06.001 – volume: 1 start-page: 218 year: 2017 ident: ref_92 article-title: Common Benchmark Functions for Metaheuristic Evaluation: A Review publication-title: Int. J. Inf. Vis. – ident: ref_41 – volume: 22 start-page: 3 year: 2015 ident: ref_57 article-title: Metaheuristics-the Metaphor Exposed publication-title: Int. Trans. Oper. Res. doi: 10.1111/itor.12001 – ident: ref_73 doi: 10.3390/s19224834 – ident: ref_61 doi: 10.1145/2598394.2609841 – ident: ref_88 doi: 10.1111/itor.12996 – volume: 25 start-page: 503 year: 2013 ident: ref_7 article-title: Metaheuristics: Review and Application publication-title: J. Exp. Theor. Artif. Intell. doi: 10.1080/0952813X.2013.782347 – volume: 8 start-page: 541 year: 2002 ident: ref_66 article-title: A Taxonomy of Hybrid Metaheuristics publication-title: J. Heuristics doi: 10.1023/A:1016540724870 – volume: 16 start-page: 527 year: 2012 ident: ref_4 article-title: Metaheuristic Optimization Frameworks: A Survey and Benchmarking publication-title: Soft Comput. doi: 10.1007/s00500-011-0754-8 – ident: ref_33 doi: 10.1201/9781315183176 – volume: 65 start-page: 374 year: 2018 ident: ref_65 article-title: A New Cooperative Framework for Parallel Trajectory-Based Metaheuristics publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2018.01.022 – ident: ref_51 doi: 10.3390/math8122240 – volume: 10 start-page: 1543 year: 2019 ident: ref_5 article-title: Metaheuristic-Based Extreme Learning Machines: A Review of Design Formulations and Applications publication-title: Int. J. Mach. Learn. Cybern. doi: 10.1007/s13042-018-0833-6 – volume: 20 start-page: 223 year: 2016 ident: ref_91 article-title: Is a Comparison of Results Meaningful from the Inexact Replications of Computational Experiments? publication-title: Soft Comput. doi: 10.1007/s00500-014-1493-4 – volume: 20 start-page: 645 year: 2016 ident: ref_45 article-title: Pareto or Non-Pareto: Bi-Criterion Evolution in Multiobjective Optimization publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2015.2504730 – ident: ref_3 – ident: ref_24 – ident: ref_19 doi: 10.1007/s11047-020-09824-0 – ident: ref_81 doi: 10.1109/WCCCT.2016.53 – volume: 10 start-page: 475 year: 2017 ident: ref_71 article-title: Swarm Intelligence: A Review of Algorithms publication-title: Nature-Inspired Computing and Optimization doi: 10.1007/978-3-319-50920-4_19 – volume: 13 start-page: 2467 year: 2003 ident: ref_64 article-title: Parameter Estimation in Biochemical Pathways: A Comparison of Global Optimization Methods publication-title: Genome Res. doi: 10.1101/gr.1262503 – volume: 2 start-page: 62 year: 2015 ident: ref_10 article-title: A Review of Simheuristics: Extending Metaheuristics to Deal with Stochastic Combinatorial Optimization Problems publication-title: Oper. Res. Perspect. – ident: ref_30 doi: 10.1007/978-3-642-24488-9 – volume: 20 start-page: 473 year: 2015 ident: ref_82 article-title: Hybrid Meta-Heuristics for Combinatorial Optimization publication-title: Constraints doi: 10.1007/s10601-015-9209-7 – volume: 17 start-page: 20 year: 2021 ident: ref_1 article-title: Meta-Heuristic Algorithms for K-Means Clustering: A Review publication-title: PalArch’s J. Archaeol. Egypt – volume: 6 start-page: 11472 year: 2011 ident: ref_25 article-title: Metaheuristic Optimization publication-title: Scholarpedia doi: 10.4249/scholarpedia.11472 – volume: 35 start-page: 41 year: 2003 ident: ref_36 article-title: Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison publication-title: ACM Comput. Surv. doi: 10.1145/937503.937505 – ident: ref_79 doi: 10.1007/978-3-319-77625-5 – ident: ref_48 doi: 10.1145/2576768.2598367 – ident: ref_63 – volume: 58 start-page: 21 year: 2012 ident: ref_78 article-title: Survey of Metaheuristic Algorithms for Combinatorial Optimization publication-title: Int. J. Comput. Appl. – volume: 24 start-page: 201 year: 2020 ident: ref_87 article-title: A Survey of Automatic Parameter Tuning Methods for Metaheuristics publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2019.2921598 – ident: ref_21 – volume: 32 start-page: 1258 year: 1984 ident: ref_35 article-title: Combinatorial Optimization:Algorithms and Complexity publication-title: IEEE Trans. Acoust. Speech Signal Process. doi: 10.1109/TASSP.1984.1164450 – volume: 81 start-page: 840 year: 2018 ident: ref_75 article-title: Application of Bio-Inspired Algorithms in Maximum Power Point Tracking for PV Systems under Partial Shading Conditions—A Review publication-title: Renew. Sustain. Energy Rev. doi: 10.1016/j.rser.2017.08.034 – volume: 10 start-page: 13 year: 2015 ident: ref_70 article-title: A Survey of Nature Inspired Algorithms publication-title: Int. J. Appl. Eng. Res. – ident: ref_23 doi: 10.1007/978-3-319-91722-1 – volume: 6 start-page: 213 year: 2007 ident: ref_46 article-title: A Hybrid Meta-Heuristic for Multi-Objective Optimization: MOSATS publication-title: J. Math. Model. Algorithms doi: 10.1007/s10852-006-9041-6 – volume: 297 start-page: 191 year: 2015 ident: ref_18 article-title: Regarding the Rankings of Optimization Heuristics Based on Artificially-Constructed Benchmark Functions publication-title: Inf. Sci. doi: 10.1016/j.ins.2014.11.023 – ident: ref_26 doi: 10.1016/B978-0-12-416743-8.00010-5 – volume: 45 start-page: 305 year: 2011 ident: ref_80 article-title: Hybrid Metaheuristics publication-title: Hybrid Optimization doi: 10.1007/978-1-4419-1644-0_9 – ident: ref_44 doi: 10.1007/978-0-387-77247-9 – volume: 237 start-page: 82 year: 2013 ident: ref_2 article-title: A Survey on Optimization Metaheuristics publication-title: Inf. Sci. doi: 10.1016/j.ins.2013.02.041 – volume: 2 start-page: 15 year: 2016 ident: ref_54 article-title: Heuristics and Metaheuristics Approaches for Facility Layout Problems: A Survey publication-title: Pertanika J. Sch. Res. Rev. – volume: 31 start-page: 105792 year: 2020 ident: ref_60 article-title: A Comprehensive Database of Nature-Inspired Algorithms publication-title: Data Brief doi: 10.1016/j.dib.2020.105792 – ident: ref_42 doi: 10.20944/preprints201805.0221.v2 – ident: ref_56 doi: 10.20944/preprints202101.0048.v1 – ident: ref_15 doi: 10.1007/978-3-319-07153-4_4-1 – ident: ref_43 doi: 10.1109/ICDE.2018.00028 – volume: 52 start-page: 100618 year: 2020 ident: ref_76 article-title: Unsupervised Feature Selection Based on Bio-Inspired Approaches publication-title: Swarm Evol. Comput. doi: 10.1016/j.swevo.2019.100618 – volume: 1 start-page: 49 year: 2020 ident: ref_62 article-title: Mitigating Metaphors: A Comprehensible Guide to Recent Nature-Inspired Algorithms publication-title: SN Comput. Sci. doi: 10.1007/s42979-019-0050-8 – volume: 7 start-page: 261 year: 2015 ident: ref_74 article-title: A Bio-Inspired, Incremental Clustering Algorithm for Semantics-Based Web Service Discovery publication-title: Int. J. Reason. Based Intell. Syst. – volume: 21 start-page: 5573 year: 2017 ident: ref_90 article-title: Since CEC 2005 Competition on Real-Parameter Optimisation: A Decade of Research, Progress and Comparative Analysis’s Weakness publication-title: Soft Comput. doi: 10.1007/s00500-016-2471-9 – volume: 12 start-page: 897 year: 2020 ident: ref_12 article-title: Comprehensive Taxonomies of Nature- and Bio-Inspired Optimization: Inspiration versus Algorithmic Behavior, Critical Analysis and Recommendations publication-title: Cogn. Comput. doi: 10.1007/s12559-020-09730-8 – volume: 137 start-page: 106040 year: 2019 ident: ref_77 article-title: A Survey on New Generation Metaheuristic Algorithms publication-title: Comput. Ind. Eng. doi: 10.1016/j.cie.2019.106040 – ident: ref_14 doi: 10.1007/b101874 – ident: ref_49 doi: 10.1145/2908812.2908814 – volume: 45 start-page: 1 year: 2013 ident: ref_58 article-title: Exploration and Exploitation in Evolutionary Algorithms: A Survey publication-title: ACM Comput. Surv. doi: 10.1145/2501654.2501658 – volume: 280 start-page: 395 year: 2020 ident: ref_83 article-title: A Survey of Hybrid Metaheuristics for the Resource-Constrained Project Scheduling Problem publication-title: Eur. J. Oper. Res. doi: 10.1016/j.ejor.2019.01.063 – ident: ref_22 – volume: 96 start-page: 42 year: 2014 ident: ref_31 article-title: Quadratic Assignment Problem and Its Relevance to the Real World: A Survey publication-title: Int. J. Comput. Appl. – ident: ref_28 doi: 10.1007/s11047-020-09820-4 |
| SSID | ssj0000913810 |
| Score | 2.5244033 |
| Snippet | In the past few decades, metaheuristics have demonstrated their suitability in addressing complex problems over different domains. This success drives the... |
| SourceID | doaj proquest crossref |
| SourceType | Open Website Aggregation Database Enrichment Source Index Database |
| StartPage | 6449 |
| SubjectTerms | Algorithms Application programming interface combinatorial optimization problems Design framework Knowledge metaheuristic Optimization Software Standardization |
| SummonAdditionalLinks | – databaseName: Publicly Available Content Database dbid: PIMPY link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3BThsxEB21gUM50EJBhELlA4eCsmJje9d2L1VLi0AqkANI9LTy2l5AggSyod_fmV0nRAJx6tWeg6XxjN94Zt4A7OQyE44yjIjOfSKFD4kppUjSoIMQ-ML1q4Zn9rc6PdWXl2YQ26PrWFY59YmNo27ZnqluG53wvh85-jHfRyBMo5LRRL7dPyQ0Q4pyrXGgxltYIOIt3YGFwfHJ4M_sz4U4MHU_bdv0BEb7lCXuU1-uJC7NuYep4e9_5p6bN-fw_f897QdYjtiTfW8vywq8CcNVWJpjJFyFlWjrNfsSCal3P4JDp4EBNIXneFvZGXqZu9i-yQbtQJqa2aFnJ2Fir8NjJH_-ytrEQ48dTCe21D32sykZ6TXycxVLa3Bx-Ov84CiJwxkSJ0U6SbipuPN955SvRGqNzkUurZOBe8u9s15z64LKfQgIARAUIO7JcoFrOS-VEmIdOsPRMGwAUyZUpkJg4dNSclWWWcarDJGRM87qPHRhb6qZwkXmchqgcVtgBENqLObU2IWdmfB9S9jxstgPUvFMhFi2m4XR-KqIRlvg8dHhBau9VtIaa0pqU9ZWqkoQLX0XtqbaL6Lp18WTsjdf3_4E7zgVyBBLp9iCzmT8GLZh0f2d3NTjz_Hu_gMGvQAb priority: 102 providerName: ProQuest |
| Title | Combinatorial Optimization Problems and Metaheuristics: Review, Challenges, Design, and Development |
| URI | https://www.proquest.com/docview/2554408088 https://doaj.org/article/e76832ea8d874a9a9b39168a47f33558 |
| Volume | 11 |
| WOSCitedRecordID | wos000678175000001&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: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: DOA dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: M~E dateStart: 20110101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: BENPR dateStart: 20110101 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 2076-3417 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000913810 issn: 2076-3417 databaseCode: PIMPY dateStart: 20110101 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3dS8MwED9EfdAHcVNxfow87EFlxS3J2sY3nYqCm0UU9KmkSYqCTrHTv9-7NpOCgi8-NhykXO6Tu_sdQCeUA2GowojRuQ2ksC5QmRRBz8VOCPRw_bzEmb2KxuP4_l4ltVVf1BNWwQNXjDt0GA8L7nRs40hqpVVGo6KxllEuCBqcrC9GPbVkqrTBqk_QVdVAnsC8nurBfZrAlYSaWXNBJVL_D0NcepfzVVjxYSE7rn6nAXNu0oTlGlhgExpeDQu257Gi99fAoD5jbkuZMwoSu0YD8OInK1lS7YopmJ5YNnJT_eg-PC7zEatqAl02nC1TKbrstOzm6Jb0tWaidbg7P7sdXgR-b0JgpOhNA65ybmzfmMjmoqdVHIpQaiMdt5pbo23MtUG-WufQO6O_xpBkEAo8C3kWRUJswPzkdeI2gUXK5SpHn297meRRlg0GPEeuS6OMjkPXgoMZK1PjQcVpt8VziskF8T2t8b0FnW_itwpL43eyE3qTbxICwC4PUCxSLxbpX2LRgp3Zi6ZeK4sU0ydasI2Gdes_7tiGJU4dLgSzKXZgfvr-4XZh0XxOn4r3NiycnI2Tm3YpmPiVXI6Shy_Y7ed4 |
| linkProvider | Directory of Open Access Journals |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Rb9MwED5NHRLwAGyAKAzww5AANSK1ncRGQgg2plVrSx-GNJ6CYzswCdLRdCD-FL-Ru8QplUC87YFX5x6S-PN3Z_vuO4DdVCbC0g0jRucuksL5SBdSRLFXXgj0cMOy0ZkdZ9OpOjnRsw342dXCUFplx4kNUbu5pTPyZxj6UnNkXBQvz75G1DWKble7FhotLI78j--4ZatfjPZxfh9xfvDmeO8wCl0FIitFvIy4Lrl1Q2szV4rYaJWKVBorPXeGO2uc4sb6LHXeo-9Cb4YOO0kFjqW8yDI6AEXK35QIdtWDzdloMnu_OtUhlU01jNtCQCF0TPfQQ6r8laTWueb6mg4BfziAxqsdXP_f_scNuBbiZ_aqBfwWbPhqG66uqSpuw1bgq5o9DqLaT26CReIrTis6YsAVx94iU34JJahs1jbVqZmpHJv4pfnkz4OA9XPWXp4M2F7XdaYesP0m7WXQ2K9lXd2Cdxfy6behV80rfwdYpn2pSwyOXFxInhVFkvAywejOamtU6vvwtJv73Ab1dWoC8jnHXRgBJV8DSh92V8ZnrejI381eE4hWJqQU3gzMFx_zQDw5vj6StjfKqUwabXRBpdbKyKwUJK3fh50OX3mgrzr_Da67_378EC4fHk_G-Xg0PboHVzgl_JDqqNiB3nJx7u_DJftteVovHoSVwuDDRYPxFzxvUwU |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Nb9QwEB1VW4TgQGkBsbSAD0UCtFGztvNhJISgy4pV2yUHkNpTcGwHKkG23WxB_Wv8OmYSZ1kJxK0HrokP-XjzZjyeeQOwG8tIGDphxOjcBlJYF6hCiiB0qRMCPdywbHRmD5PpND0-Vtka_Ox6YaissuPEhqjtzFCOfA9DXxqOjEaxV_qyiGw0fnV2HtAEKTpp7cZptBA5cJc_cPtWv5yM8F8_4Xz89sP-u8BPGAiMFOEi4Krkxg6NSWwpQq3SWMRSG-m41dwabVOujUti6xz6MfRs6LyjWOC1mBdJQslQpP91DMml7MF6NjnKTpYZHlLcTIdh2xQohArpTHpIXcCSlDtX3GAzLeAPZ9B4uPHG__xtbsMtH1ez160hbMKaq7bg5ora4hZseh6r2VMvtv3sDhgkxOK0otQDWiJ7jwz6zbemsqwdtlMzXVl25Bb6i7vwwtYvWHuoMmD73TSaesBGTTnMoFm_Uo11Fz5eyavfg141q9x9YIlypSoxaLJhIXlSFFHEywijPqOMTmPXh-cdDnLjVdlpOMjXHHdnBJp8BTR92F0uPmvFSP6-7A0BarmEFMSbC7P559wTUo6Pj2TudGrTRGqlVUEt2KmWSSlIcr8POx3Wck9rdf4baA_-ffsxXEcE5oeT6cE23OBUB0RipGIHeov5hXsI18z3xWk9f-SNhsGnq8biLx0qW8Y |
| 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=Combinatorial+Optimization+Problems+and+Metaheuristics%3A+Review%2C+Challenges%2C+Design%2C+and+Development&rft.jtitle=Applied+sciences&rft.au=Peres%2C+Fernando&rft.au=Castelli%2C+Mauro&rft.date=2021-07-13&rft.issn=2076-3417&rft.eissn=2076-3417&rft.volume=11&rft.issue=14&rft.spage=6449&rft_id=info:doi/10.3390%2Fapp11146449&rft.externalDBID=n%2Fa&rft.externalDocID=10_3390_app11146449 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2076-3417&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2076-3417&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2076-3417&client=summon |