{"id":"https://openalex.org/W119087972","doi":"https://doi.org/10.4230/dagsemproc.04461.15","title":"NBI and MOGA-II, two complementary algorithms for Multi-Objective optimizations","display_name":"NBI and MOGA-II, two complementary algorithms for Multi-Objective optimizations","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W119087972","doi":"https://doi.org/10.4230/dagsemproc.04461.15","mag":"119087972"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:272","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04461.15","pdf_url":"https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol04461/DagSemProc.04461.15/DagSemProc.04461.15.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol04461/DagSemProc.04461.15/DagSemProc.04461.15.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5068794763","display_name":"Enrico Rigoni","orcid":"https://orcid.org/0000-0002-8655-2214","observed_orcids":["https://orcid.org/0000-0002-8655-2214"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rigoni, Enrico","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5078489932","display_name":"Silvia Poles","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Poles, Silvia","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.4148,"has_fulltext":true,"cited_by_count":34,"citation_normalized_percentile":{"value":0.8861918,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"0","last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9994999766349792,"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.9994999766349792,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":9.999999747378752e-05,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"multi-objective optimization","score":0.9110000133514404},{"id":"https://openalex.org/keywords/gradient-based-optimization","display_name":"gradient-based optimization","score":0.8019999861717224},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.8659999966621399},{"id":"https://openalex.org/keywords/pareto-front","display_name":"Pareto front","score":0.8550000190734863},{"id":"https://openalex.org/keywords/hybrid-optimization","display_name":"hybrid optimization","score":0.7350000143051147},{"id":"https://openalex.org/keywords/partitioning-methods","display_name":"partition method","score":0.7900000214576721},{"id":"https://openalex.org/keywords/algorithm-comparison","display_name":"algorithm comparison","score":0.6520000100135803}],"concepts":[{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.7245451211929321},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.6393029689788818},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6200953722000122},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5502389669418335},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5396990180015564},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5249940156936646},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.5159311890602112},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4396298825740814},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3430233895778656},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:272","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04461.15","pdf_url":"https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol04461/DagSemProc.04461.15/DagSemProc.04461.15.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/dagsemproc.04461.15","doi":"https://doi.org/10.4230/dagsemproc.04461.15","is_oa":true,"landing_page_url":"https://doi.org/10.4230/dagsemproc.04461.15","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"JournalArticle"},{"id":"mag:119087972","doi":null,"is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/volltexte/2005/272/pdf/04461.PolesSilvia.Paper.272.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306418148","display_name":"Dagstuhl Seminar Proceedings","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Dagstuhl Seminar Proceedings","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:272","doi":null,"is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.04461.15","pdf_url":"https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol04461/DagSemProc.04461.15/DagSemProc.04461.15.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W119087972.pdf","grobid_xml":"https://content.openalex.org/works/W119087972.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W1520767601","https://openalex.org/W1978646089","https://openalex.org/W2004529982","https://openalex.org/W2024008934","https://openalex.org/W2261054240","https://openalex.org/W2789640602","https://openalex.org/W2914715548"],"related_works":["https://openalex.org/W2064079650","https://openalex.org/W4288828733","https://openalex.org/W7214929190","https://openalex.org/W3107459742","https://openalex.org/W4412604689","https://openalex.org/W2039418695","https://openalex.org/W1969837585","https://openalex.org/W2279614208","https://openalex.org/W2312592250","https://openalex.org/W420249759"],"abstract_inverted_index":{"The":[0],"NBI-NLPQLP":[1,20],"optimization":[2,9],"method":[3,70],"is":[4,13,21,29,71],"tested":[5],"on":[6,23],"several":[7],"multi-objective":[8],"problems.":[10],"Its":[11],"performance":[12],"compared":[14],"to":[15,51,59],"that":[16],"of":[17],"MOGA-II:":[18],"since":[19],"based":[22],"the":[24,40,54],"classical":[25],"gradient-based":[26],"NLPQLP,":[27],"it":[28],"fast":[30],"and":[31],"accurate,":[32],"but":[33],"not":[34],"as":[35],"robust,":[36],"in":[37,53],"comparison":[38],"with":[39,67],"genetic":[41],"algorithm.":[42],"Furthermore":[43],"a":[44,63,68],"discontinuous":[45],"Pareto":[46],"frontier":[47],"can":[48],"give":[49],"rise":[50],"problems":[52],"NBI\u00b4s":[55],"convergence.":[56],"In":[57],"order":[58],"overcome":[60],"this":[61],"problem,":[62],"hybridization":[64],"technique":[65],"coupled":[66],"partitioning":[69],"proposed.":[72]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}