{"id":"https://openalex.org/W1987008334","doi":"https://doi.org/10.1016/j.entcs.2011.11.025","title":"Multiobjective Harmony Search Algorithm Proposals","display_name":"Multiobjective Harmony Search Algorithm Proposals","alternate_titles":[],"publication_year":2011,"publication_date":"2011-12-01","ids":{"openalex":"https://openalex.org/W1987008334","doi":"https://doi.org/10.1016/j.entcs.2011.11.025","mag":"1987008334"},"language":"en","primary_location":{"id":"doi:10.1016/j.entcs.2011.11.025","doi":"https://doi.org/10.1016/j.entcs.2011.11.025","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2011.11.025","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-1","norway-1","poland-40","russia-white-list-3"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"parent_works":[],"lineage":["https://openalex.org/W1987008334"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/j.entcs.2011.11.025","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083646304","display_name":"Juan Ricart","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I8379220","display_name":"Universidad Nacional de Asunci\u00f3n","ror":"https://ror.org/03f27y887","country_code":"PY","type":"education","lineage":["https://openalex.org/I8379220"]}],"countries":["PY"],"is_corresponding":true,"raw_author_name":"Juan Ricart","raw_affiliation_strings":["Facultad Polit\u00e9cnica, Universidad Nacional de Asunci\u00f3n, San Lorenzo, Paraguay"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Facultad Polit\u00e9cnica, Universidad Nacional de Asunci\u00f3n, San Lorenzo, Paraguay","institution_ids":["https://openalex.org/I8379220"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088071938","display_name":"Germ\u00e1n H\u00fcttemann","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I8379220","display_name":"Universidad Nacional de Asunci\u00f3n","ror":"https://ror.org/03f27y887","country_code":"PY","type":"education","lineage":["https://openalex.org/I8379220"]}],"countries":["PY"],"is_corresponding":true,"raw_author_name":"Germ\u00e1n H\u00fcttemann","raw_affiliation_strings":["Facultad Polit\u00e9cnica, Universidad Nacional de Asunci\u00f3n, San Lorenzo, Paraguay"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Facultad Polit\u00e9cnica, Universidad Nacional de Asunci\u00f3n, San Lorenzo, Paraguay","institution_ids":["https://openalex.org/I8379220"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5066573870","display_name":"Joaqu\u00edn Lima","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I8379220","display_name":"Universidad Nacional de Asunci\u00f3n","ror":"https://ror.org/03f27y887","country_code":"PY","type":"education","lineage":["https://openalex.org/I8379220"]}],"countries":["PY"],"is_corresponding":true,"raw_author_name":"Joaqu\u00edn Lima","raw_affiliation_strings":["Facultad Polit\u00e9cnica, Universidad Nacional de Asunci\u00f3n, San Lorenzo, Paraguay"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Facultad Polit\u00e9cnica, Universidad Nacional de Asunci\u00f3n, San Lorenzo, Paraguay","institution_ids":["https://openalex.org/I8379220"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039186245","display_name":"Benjam\u00edn Bar\u00e1n","orcid":"https://orcid.org/0000-0002-2855-7201","observed_orcids":["https://orcid.org/0000-0002-2855-7201"]},"institutions":[{"id":"https://openalex.org/I8379220","display_name":"Universidad Nacional de Asunci\u00f3n","ror":"https://ror.org/03f27y887","country_code":"PY","type":"education","lineage":["https://openalex.org/I8379220"]}],"countries":["PY"],"is_corresponding":true,"raw_author_name":"Benjam\u00edn Bar\u00e1n","raw_affiliation_strings":["Facultad Polit\u00e9cnica, Universidad Nacional de Asunci\u00f3n, San Lorenzo, Paraguay"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Facultad Polit\u00e9cnica, Universidad Nacional de Asunci\u00f3n, San Lorenzo, Paraguay","institution_ids":["https://openalex.org/I8379220"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039186245","https://openalex.org/A5066573870","https://openalex.org/A5083646304","https://openalex.org/A5088071938"],"corresponding_institution_ids":["https://openalex.org/I8379220"],"apc_list":null,"apc_paid":null,"fwci":2.3926,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.87374098,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":99},"biblio":{"volume":"281","issue":null,"first_page":"51","last_page":"67"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.8270999789237976,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.8270999789237976,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.16269999742507935,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.00039999998989515007,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/harmony-search-algorithm","display_name":"harmony search algorithm","score":0.8640000224113464},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"multi-objective optimization","score":0.9909999966621399},{"id":"https://openalex.org/keywords/pareto-optimality","display_name":"Pareto optimality","score":0.9670000076293945},{"id":"https://openalex.org/keywords/zdt-test-functions","display_name":"ZDT test functions","score":0.9210000038146973},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.8970000147819519},{"id":"https://openalex.org/keywords/nsga-ii-comparison","display_name":"NSGA-II comparison","score":0.8529999852180481},{"id":"https://openalex.org/keywords/performance-indicators","display_name":"performance indicators","score":0.5139999985694885}],"concepts":[{"id":"https://openalex.org/C33099171","wikidata":"https://www.wikidata.org/wiki/Q26208718","display_name":"Harmony search","level":2,"score":0.9577704668045044},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.7949743866920471},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.6901717185974121},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6813254356384277},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.6671447157859802},{"id":"https://openalex.org/C2776453491","wikidata":"https://www.wikidata.org/wiki/Q5659234","display_name":"Harmony (color)","level":2,"score":0.6201634407043457},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.5253426432609558},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5211608409881592},{"id":"https://openalex.org/C139143892","wikidata":"https://www.wikidata.org/wiki/Q7441615","display_name":"Search-based software engineering","level":5,"score":0.5196541547775269},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4638277292251587},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35224223136901855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32845476269721985},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.08579960465431213},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.05566713213920593},{"id":"https://openalex.org/C529173508","wikidata":"https://www.wikidata.org/wiki/Q638608","display_name":"Software development","level":3,"score":0.0},{"id":"https://openalex.org/C180152950","wikidata":"https://www.wikidata.org/wiki/Q2904257","display_name":"Software development process","level":4,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/j.entcs.2011.11.025","doi":"https://doi.org/10.1016/j.entcs.2011.11.025","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2011.11.025","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-1","norway-1","poland-40","russia-white-list-3"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/j.entcs.2011.11.025","doi":"https://doi.org/10.1016/j.entcs.2011.11.025","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.entcs.2011.11.025","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","jufo-1","norway-1","poland-40","russia-white-list-3"],"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W16274536","https://openalex.org/W42994425","https://openalex.org/W75592099","https://openalex.org/W127103380","https://openalex.org/W626292722","https://openalex.org/W1496413023","https://openalex.org/W1525964546","https://openalex.org/W1585939719","https://openalex.org/W1612556207","https://openalex.org/W1784778693","https://openalex.org/W1969995868","https://openalex.org/W1987746070","https://openalex.org/W1993885071","https://openalex.org/W2058984664","https://openalex.org/W2086390318","https://openalex.org/W2095710927","https://openalex.org/W2120926795","https://openalex.org/W2125502051","https://openalex.org/W2125899728","https://openalex.org/W2126105956","https://openalex.org/W2152195021","https://openalex.org/W2167378942","https://openalex.org/W2171107890","https://openalex.org/W2280254340","https://openalex.org/W2432516117","https://openalex.org/W2496857733","https://openalex.org/W2543580944","https://openalex.org/W4247864970","https://openalex.org/W4294962951","https://openalex.org/W6600423877","https://openalex.org/W6619920785","https://openalex.org/W6816604038"],"related_works":["https://openalex.org/W2009621188","https://openalex.org/W2404044176","https://openalex.org/W2804754583","https://openalex.org/W2386129382","https://openalex.org/W2760219840","https://openalex.org/W2948533978","https://openalex.org/W102803077","https://openalex.org/W2408209771","https://openalex.org/W2393980958","https://openalex.org/W2358152978"],"abstract_inverted_index":{"Harmony":[0,36],"Search":[1,37],"metaheuristic":[2,38],"is":[3],"successfully":[4],"used":[5],"in":[6,16],"several":[7],"applications":[8],"of":[9,24,34],"science":[10],"and":[11],"engineering.":[12],"However,":[13],"its":[14],"effectiveness":[15],"solving":[17],"multiobjective":[18,40],"optimization":[19],"problems":[20],"using":[21,42],"the":[22,35,43,57],"concepts":[23],"Pareto":[25],"optimality,":[26],"remains":[27],"unproved.":[28],"This":[29],"paper":[30],"presents":[31],"two":[32],"proposals":[33,58],"for":[39,52],"optimization,":[41],"ZDT":[44],"functions":[45],"as":[46],"a":[47],"test":[48],"bed.":[49],"Performance":[50],"metrics":[51],"experimental":[53],"results":[54],"show":[55],"that":[56],"are":[59],"competitive":[60],"even":[61],"when":[62],"compared":[63],"to":[64],"NSGA-II":[65],"evolutionary":[66],"algorithm.":[67]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W1987008334","counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":5},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":9},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":1}],"updated_date":"2026-11-17T12:49:18.490984","created_date":"2016-06-24T00:00:00"}
