{"id":"https://openalex.org/W2031660331","doi":"https://doi.org/10.1145/2739480.2754708","title":"Multi-objective Optimization with Dynamic Constraints and Objectives","display_name":"Multi-objective Optimization with Dynamic Constraints and Objectives","publication_year":2015,"publication_date":"2015-07-07","ids":{"openalex":"https://openalex.org/W2031660331","doi":"https://doi.org/10.1145/2739480.2754708","mag":"2031660331"},"language":"en","primary_location":{"id":"doi:10.1145/2739480.2754708","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2739480.2754708","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5045540275","display_name":"Radhia Azzouz","orcid":"https://orcid.org/0000-0002-0047-683X"},"institutions":[{"id":"https://openalex.org/I108714496","display_name":"Tunis University","ror":"https://ror.org/02q1spa57","country_code":"TN","type":"education","lineage":["https://openalex.org/I108714496"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Radhia Azzouz","raw_affiliation_strings":["University of Tunis, Tunis, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Tunis, Tunis, Tunisia","institution_ids":["https://openalex.org/I108714496"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080575230","display_name":"Slim Bechikh","orcid":"https://orcid.org/0000-0003-1378-7415"},"institutions":[{"id":"https://openalex.org/I108714496","display_name":"Tunis University","ror":"https://ror.org/02q1spa57","country_code":"TN","type":"education","lineage":["https://openalex.org/I108714496"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Slim Bechikh","raw_affiliation_strings":["University of Tunis, Tunis, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Tunis, Tunis, Tunisia","institution_ids":["https://openalex.org/I108714496"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028612749","display_name":"Lamjed Ben Sa\u00efd","orcid":"https://orcid.org/0000-0001-9225-884X"},"institutions":[{"id":"https://openalex.org/I108714496","display_name":"Tunis University","ror":"https://ror.org/02q1spa57","country_code":"TN","type":"education","lineage":["https://openalex.org/I108714496"]}],"countries":["TN"],"is_corresponding":false,"raw_author_name":"Lamjed Ben Said","raw_affiliation_strings":["University of Tunis, Tunis, Tunisia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Tunis, Tunis, Tunisia","institution_ids":["https://openalex.org/I108714496"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I108714496"],"apc_list":null,"apc_paid":null,"fwci":3.6635,"has_fulltext":false,"cited_by_count":67,"citation_normalized_percentile":{"value":0.93557909,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"615","last_page":"622"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":1.0,"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":1.0,"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.9995999932289124,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9976999759674072,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7164360284805298},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7094061970710754},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6594126224517822},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.566762387752533},{"id":"https://openalex.org/keywords/test-suite","display_name":"Test suite","score":0.553911566734314},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.5325286388397217},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5108680129051208},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4655134677886963},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.46497344970703125},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.46404948830604553},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.41330695152282715},{"id":"https://openalex.org/keywords/test-case","display_name":"Test case","score":0.35189396142959595},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20742034912109375},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14010706543922424},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.08893638849258423}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7164360284805298},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7094061970710754},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6594126224517822},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.566762387752533},{"id":"https://openalex.org/C151552104","wikidata":"https://www.wikidata.org/wiki/Q7705809","display_name":"Test suite","level":4,"score":0.553911566734314},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.5325286388397217},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5108680129051208},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4655134677886963},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.46497344970703125},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.46404948830604553},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.41330695152282715},{"id":"https://openalex.org/C128942645","wikidata":"https://www.wikidata.org/wiki/Q1568346","display_name":"Test case","level":3,"score":0.35189396142959595},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20742034912109375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14010706543922424},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.08893638849258423},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C152877465","wikidata":"https://www.wikidata.org/wiki/Q208042","display_name":"Regression analysis","level":2,"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":1,"locations":[{"id":"doi:10.1145/2739480.2754708","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2739480.2754708","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W18977443","https://openalex.org/W1501538060","https://openalex.org/W1574490530","https://openalex.org/W1587294773","https://openalex.org/W1607104331","https://openalex.org/W1696786035","https://openalex.org/W1912576130","https://openalex.org/W1968173975","https://openalex.org/W1972055403","https://openalex.org/W1977943938","https://openalex.org/W1995122990","https://openalex.org/W2008813646","https://openalex.org/W2041006267","https://openalex.org/W2056605897","https://openalex.org/W2062518669","https://openalex.org/W2068843161","https://openalex.org/W2090537542","https://openalex.org/W2110368321","https://openalex.org/W2126105956","https://openalex.org/W2126891684","https://openalex.org/W2133738572","https://openalex.org/W2143585163","https://openalex.org/W2147058979","https://openalex.org/W2147573707","https://openalex.org/W2147585405","https://openalex.org/W2153718396","https://openalex.org/W2155019998","https://openalex.org/W2164655924","https://openalex.org/W3149025087","https://openalex.org/W4245145882","https://openalex.org/W4299590268"],"related_works":["https://openalex.org/W2801693842","https://openalex.org/W2906115061","https://openalex.org/W2977596624","https://openalex.org/W1598160211","https://openalex.org/W2145877535","https://openalex.org/W2744730182","https://openalex.org/W2067499928","https://openalex.org/W1524028411","https://openalex.org/W3134440233","https://openalex.org/W2138059712"],"abstract_inverted_index":{"Dynamic":[0,108],"Multi-objective":[1],"Optimization":[2],"(DMO)":[3],"is":[4,60,140],"a":[5,61,69,86,93,103,127],"challenging":[6],"research":[7,64],"topic":[8],"since":[9],"the":[10,48,107,122,149,170,174,178,184],"objective":[11,56],"functions,":[12],"constraints,":[13],"and":[14,130,147,153,161,192],"problem":[15,51],"parameters":[16],"may":[17],"change":[18],"over":[19,183],"time.":[20],"Several":[21],"evolutionary":[22],"algorithms":[23],"have":[24,67],"been":[25],"proposed":[26],"to":[27,36,115],"deal":[28,116],"with":[29,54,117],"DMO":[30],"problems.":[31,41,99,197],"Nevertheless,":[32],"they":[33],"were":[34],"restricted":[35],"unconstrained":[37],"or":[38],"domain":[39],"constrained":[40,97],"In":[42],"this":[43,59,82],"work,":[44],"we":[45,66,84,101],"focus":[46],"on":[47,187,194],"dynamicty":[49],"of":[50,71,88,95,106,173,180,190],"constraints":[52,119],"along":[53],"time-varying":[55],"functions.":[57],"As":[58],"very":[62],"recent":[63],"area,":[65],"observed":[68],"lack":[70],"benchmarks":[72],"that":[73,91,137],"simultaneously":[74],"take":[75],"into":[76],"account":[77],"these":[78],"characteristics.":[79],"To":[80],"fill":[81],"gap,":[83],"propose":[85,102],"set":[87],"test":[89,196],"problems":[90],"extend":[92],"suite":[94],"static":[96],"multi-objective":[98],"Moreover,":[100,169],"new":[104],"version":[105],"Non":[109],"dominated":[110],"Sorting":[111],"Genetic":[112],"Algorithm":[113],"II":[114],"dynamic":[118,145],"by":[120,126],"replacing":[121],"used":[123],"constraint-handling":[124],"mechanism":[125],"more":[128],"elaborated":[129],"self-adaptive":[131],"penalty":[132],"function.":[133],"Empirical":[134],"results":[135,176],"show":[136],"our":[138,181],"proposal":[139,182],"able":[141],"to:":[142],"(1)":[143],"handle":[144,155],"environments":[146],"track":[148],"changing":[150],"Pareto":[151],"front":[152],"(2)":[154],"infeasible":[156],"solutions":[157],"in":[158],"an":[159],"effective":[160],"efficient":[162],"manner":[163],"which":[164],"allows":[165],"avoiding":[166],"premature":[167],"convergence.":[168],"statistical":[171],"analysis":[172],"obtained":[175],"emphasize":[177],"advantages":[179],"original":[185],"algorithm":[186],"both":[188],"aspects":[189],"convergence":[191],"diversity":[193],"most":[195]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":8},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}