{"id":"https://openalex.org/W2033798335","doi":"https://doi.org/10.1109/cec.2009.4983012","title":"Benchmarking and solving dynamic constrained problems","display_name":"Benchmarking and solving dynamic constrained problems","publication_year":2009,"publication_date":"2009-05-01","ids":{"openalex":"https://openalex.org/W2033798335","doi":"https://doi.org/10.1109/cec.2009.4983012","mag":"2033798335"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2009.4983012","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4983012","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},"type":"article","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/A5046932726","display_name":"Trung Th\u00e0nh Nguy\u1ec5n","orcid":"https://orcid.org/0000-0002-3268-1790"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Trung Thanh Nguyen","raw_affiliation_strings":["Centre of Excellence for Research in Computational Intelligence and Applications, (CERCIA), School of Computer Science, University of Binningham, UK","The Centre of Excellence for Research in Computational Intelligence and Applications (Cercia), School of Computer Science, University of Birmingham, B15 2TT, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Centre of Excellence for Research in Computational Intelligence and Applications, (CERCIA), School of Computer Science, University of Binningham, UK","institution_ids":[]},{"raw_affiliation_string":"The Centre of Excellence for Research in Computational Intelligence and Applications (Cercia), School of Computer Science, University of Birmingham, B15 2TT, United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100635494","display_name":"Xin Yao","orcid":"https://orcid.org/0000-0001-8837-4442"},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Xin Yao","raw_affiliation_strings":["Centre of Excellence for Research in Computational Intelligence and Applications, (CERCIA), School of Computer Science, University of Binningham, UK","The Centre of Excellence for Research in Computational Intelligence and Applications (Cercia), School of Computer Science, University of Birmingham, B15 2TT, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Centre of Excellence for Research in Computational Intelligence and Applications, (CERCIA), School of Computer Science, University of Binningham, UK","institution_ids":[]},{"raw_affiliation_string":"The Centre of Excellence for Research in Computational Intelligence and Applications (Cercia), School of Computer Science, University of Birmingham, B15 2TT, United Kingdom","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046932726"],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":null,"apc_paid":null,"fwci":6.7166,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.97080516,"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":null,"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.9988999962806702,"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.9988999962806702,"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.9976000189781189,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9918000102043152,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7006568312644958},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6902130842208862},{"id":"https://openalex.org/keywords/dynamic-problem","display_name":"Dynamic problem","score":0.6662465929985046},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6181091070175171},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5596616268157959},{"id":"https://openalex.org/keywords/benchmarking","display_name":"Benchmarking","score":0.5394490361213684},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.5258320569992065},{"id":"https://openalex.org/keywords/test-functions-for-optimization","display_name":"Test functions for optimization","score":0.5032359957695007},{"id":"https://openalex.org/keywords/constrained-optimization-problem","display_name":"Constrained optimization problem","score":0.4457359313964844},{"id":"https://openalex.org/keywords/dynamic-testing","display_name":"Dynamic testing","score":0.4397130608558655},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43467336893081665},{"id":"https://openalex.org/keywords/current","display_name":"Current (fluid)","score":0.4308894872665405},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35497528314590454},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.2247008979320526},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16204527020454407}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7006568312644958},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6902130842208862},{"id":"https://openalex.org/C99580578","wikidata":"https://www.wikidata.org/wiki/Q5319002","display_name":"Dynamic problem","level":2,"score":0.6662465929985046},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6181091070175171},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5596616268157959},{"id":"https://openalex.org/C86251818","wikidata":"https://www.wikidata.org/wiki/Q816754","display_name":"Benchmarking","level":2,"score":0.5394490361213684},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.5258320569992065},{"id":"https://openalex.org/C150185637","wikidata":"https://www.wikidata.org/wiki/Q7705773","display_name":"Test functions for optimization","level":4,"score":0.5032359957695007},{"id":"https://openalex.org/C2989514635","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization problem","level":3,"score":0.4457359313964844},{"id":"https://openalex.org/C198824145","wikidata":"https://www.wikidata.org/wiki/Q442770","display_name":"Dynamic testing","level":2,"score":0.4397130608558655},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43467336893081665},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.4308894872665405},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35497528314590454},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.2247008979320526},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16204527020454407},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C144133560","wikidata":"https://www.wikidata.org/wiki/Q4830453","display_name":"Business","level":0,"score":0.0},{"id":"https://openalex.org/C162853370","wikidata":"https://www.wikidata.org/wiki/Q39809","display_name":"Marketing","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/cec.2009.4983012","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2009.4983012","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Congress on Evolutionary Computation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.216.1625","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.216.1625","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.bham.ac.uk/%7Etxn/Papers/Nguyen_Yao_CEC09.pdf","raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/60619954-8bbb-4a40-8f39-2224c4152ae3","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/60619954-8bbb-4a40-8f39-2224c4152ae3","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nguyen, T & Yao, X 2009, 'Benchmarking and Solving Dynamic Constrained Problems', Paper presented at Proceedings of the 2009 IEEE Congress on Evolutionary Computation (CEC '09), 18/05/09 pp. 690-697. https://doi.org/10.1109/CEC.2009.4983012","raw_type":"conferenceObject"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/60e468d0-ef4f-4274-ba4f-186a794c5529","is_oa":false,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/60e468d0-ef4f-4274-ba4f-186a794c5529","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Nguyen, T & Yao, X 2009, 'Benchmarking and Solving Dynamic Constrained Problems', Paper presented at IEEE Congress on Evolutionary Computation, Vols 1-5, 21/05/09 pp. 690-697.","raw_type":"conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W117011241","https://openalex.org/W326774659","https://openalex.org/W1555154718","https://openalex.org/W1563737017","https://openalex.org/W1568054438","https://openalex.org/W1587451448","https://openalex.org/W1719186128","https://openalex.org/W1766792594","https://openalex.org/W1991335163","https://openalex.org/W2031847437","https://openalex.org/W2066033793","https://openalex.org/W2096333653","https://openalex.org/W2130602638","https://openalex.org/W2160958384","https://openalex.org/W2568658910","https://openalex.org/W6604847932","https://openalex.org/W6611259849","https://openalex.org/W6633372947","https://openalex.org/W6637415550","https://openalex.org/W6679499745"],"related_works":["https://openalex.org/W23263483","https://openalex.org/W2145128058","https://openalex.org/W4205481658","https://openalex.org/W2147562817","https://openalex.org/W198638128","https://openalex.org/W2089818717","https://openalex.org/W2352716706","https://openalex.org/W2113933470","https://openalex.org/W2033798335","https://openalex.org/W1984207415"],"abstract_inverted_index":{"Many":[0],"real-world":[1],"dynamic":[2,37,50,57,65,81,89,99,119,131,149,170,176,195],"optimisation":[3],"problems":[4,83,101,133],"have":[5,135],"constraints,":[6],"and":[7,40],"in":[8,27,56,173],"certain":[9],"cases":[10],"not":[11,32,140],"only":[12],"the":[13,20,75,110,123,147,154,157,166,184,192],"objective":[14],"function":[15],"changes":[16],"over":[17],"time,":[18],"but":[19],"constraints":[21],"also":[22],"change":[23],"as":[24],"well.":[25],"However,":[26],"academic":[28],"research":[29,34,45],"there":[30,42,61],"is":[31,43,62],"many":[33],"on":[35,46,122,153],"continuous":[36],"constrained":[38,58,66,82,132,177],"optimization,":[39],"particularly":[41],"little":[44],"whether":[47],"current":[48,148,169],"numerical":[49,64,98,175],"optimization":[51,90,120,150,171,196],"algorithms":[52,121],"would":[53],"work":[54],"well":[55],"environments":[59],"nor":[60],"any":[63],"benchmark":[67,100],"problems.":[68,178],"In":[69],"this":[70],"paper,":[71],"we":[72,115,159],"firstly":[73],"investigate":[74],"characteristics":[76,137],"that":[77,130,138,183],"might":[78,139],"make":[79],"a":[80,95,161],"difficult":[84],"to":[85,164,191],"solve":[86],"by":[87,144],"existing":[88,194],"algorithms.":[91,151,197],"We":[92],"then":[93],"introduce":[94],"set":[96],"of":[97,112,146,156,168],"with":[102],"these":[103,113],"characteristics.":[104],"To":[105],"verify":[106],"our":[107],"hypothesis":[108],"about":[109],"difficulty":[111],"problems,":[114],"tested":[116,193],"several":[117],"canonical":[118],"proposed":[124,185],"benchmarks.":[125],"The":[126,179],"test":[127,180],"results":[128,181,189],"confirm":[129],"do":[134],"special":[136],"be":[141],"solved":[142],"effectively":[143],"some":[145],"Based":[152],"analyses":[155],"results,":[158],"propose":[160],"new":[162],"algorithm":[163,186],"improve":[165],"performance":[167],"methods":[172],"solving":[174],"show":[182],"achieves":[187],"superior":[188],"compared":[190]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}