{"id":"https://openalex.org/W2076695728","doi":"https://doi.org/10.1109/mcdm.2009.4938819","title":"Tutorial MCDM-T2 Evolutionary programming with diversity enhancement and ensemble strategies","display_name":"Tutorial MCDM-T2 Evolutionary programming with diversity enhancement and ensemble strategies","publication_year":2009,"publication_date":"2009-03-01","ids":{"openalex":"https://openalex.org/W2076695728","doi":"https://doi.org/10.1109/mcdm.2009.4938819","mag":"2076695728"},"language":"en","primary_location":{"id":"doi:10.1109/mcdm.2009.4938819","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mcdm.2009.4938819","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Symposium on Computational Intelligence in Milti-Criteria Decision-Making","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/A5025626208","display_name":"Ponnuthurai Nagaratnam Suganthan","orcid":"https://orcid.org/0000-0003-0901-5105"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Ponnuthurai Nagaratnam Suganthan","raw_affiliation_strings":["Nanyang Technological University, Singapore","Nanyang Technological University (Singapore)"],"affiliations":[{"raw_affiliation_string":"Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"Nanyang Technological University (Singapore)","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5025626208"],"corresponding_institution_ids":["https://openalex.org/I172675005"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10204249,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"xi","last_page":"xi"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9968000054359436,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9968000054359436,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9927999973297119,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9848999977111816,"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/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.6965820789337158},{"id":"https://openalex.org/keywords/evolutionary-programming","display_name":"Evolutionary programming","score":0.6717595458030701},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6672956943511963},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5711323022842407},{"id":"https://openalex.org/keywords/genetic-programming","display_name":"Genetic programming","score":0.5174315571784973},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.5130897760391235},{"id":"https://openalex.org/keywords/tournament-selection","display_name":"Tournament selection","score":0.4404262602329254},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4299622178077698},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4281238913536072},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.42462238669395447},{"id":"https://openalex.org/keywords/premature-convergence","display_name":"Premature convergence","score":0.42214030027389526},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.3733236789703369},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3463869094848633},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.32392436265945435},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3062840700149536},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21129664778709412},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17286014556884766}],"concepts":[{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.6965820789337158},{"id":"https://openalex.org/C121835503","wikidata":"https://www.wikidata.org/wiki/Q2596288","display_name":"Evolutionary programming","level":3,"score":0.6717595458030701},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6672956943511963},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5711323022842407},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.5174315571784973},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.5130897760391235},{"id":"https://openalex.org/C165661538","wikidata":"https://www.wikidata.org/wiki/Q7829327","display_name":"Tournament selection","level":3,"score":0.4404262602329254},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4299622178077698},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4281238913536072},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.42462238669395447},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.42214030027389526},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.3733236789703369},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3463869094848633},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.32392436265945435},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3062840700149536},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21129664778709412},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17286014556884766}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/mcdm.2009.4938819","is_oa":false,"landing_page_url":"https://doi.org/10.1109/mcdm.2009.4938819","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE Symposium on Computational Intelligence in Milti-Criteria Decision-Making","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":0,"referenced_works":[],"related_works":["https://openalex.org/W171170629","https://openalex.org/W2114487464","https://openalex.org/W2374559649","https://openalex.org/W1548246675","https://openalex.org/W2145435822","https://openalex.org/W752991098","https://openalex.org/W2089704278","https://openalex.org/W1538199400","https://openalex.org/W2035961408","https://openalex.org/W2367365720"],"abstract_inverted_index":{"The":[0],"first":[1],"part":[2],"of":[3,10,42,95,115,170,180],"the":[4,11,31,43,51,130,163,177,181,242,258],"tutorials":[5],"will":[6,19,38,122,152,226],"cover":[7],"various":[8,21,25],"aspects":[9],"evolutionary":[12,35,44,64,118,158,194,231],"programming":[13,45,159,232],"for":[14],"real":[15],"parameter":[16,27,142],"optimization.":[17],"We":[18,37,225],"introduce":[20],"mutation":[22,75],"operators":[23],"and":[24,103,120,133,140,168],"strategy":[26,156,183],"adaptation":[28],"methods":[29],"including":[30],"recently":[32,214],"proposed":[33,57,215],"adaptive":[34,89],"programming.":[36],"also":[39,227],"discuss":[40],"hybridization":[41],"with":[46,157,262],"other":[47],"optimization":[48,195,203],"paradigms.":[49],"Over":[50],"last":[52],"4\u20135":[53],"decades,":[54],"researchers":[55],"have":[56,123],"several":[58,109],"approaches":[59,102,111,132],"/":[60,71,73,78,80,84,91,93,97],"alternatives":[61,68],"to":[62,124,128,134,160,165,207,217,252,257],"construct":[63],"algorithms.":[65],"Some":[66],"such":[67],"are":[69,108],"Gaussian":[70],"Levy":[72],"Cauchy":[74],"operators,":[76],"clearing":[77],"crowding":[79],"restricted":[81],"tournament":[82],"selection":[83,139],"sharing":[85],"based":[86],"niching":[87],"algorithms,":[88],"penalty":[90],"epsilon":[92],"superiority":[94],"feasible":[96],"stochastic":[98],"ranking":[99],"constraint":[100],"handling":[101],"so":[104],"on.":[105],"Clearly,":[106],"there":[107],"alternative":[110],"at":[112],"every":[113],"stage":[114],"constructing":[116],"an":[117,154],"algorithm":[119],"users":[121],"perform":[125],"numerous":[126],"simulations":[127],"pick":[129],"best":[131],"fine":[135],"tune":[136,166],"parameters.":[137],"This":[138,248],"subsequent":[141],"tuning":[143],"approach":[144],"is":[145,197,250],"not":[146],"efficient.":[147],"In":[148,205],"this":[149,209],"tutorial,":[150],"we":[151,211],"present":[153,228],"ensemble":[155,182],"benefit":[161],"from":[162],"need":[164],"parameters":[167],"availability":[169],"diverse":[171,186],"approaches.":[172],"Our":[173],"research":[174],"has":[175],"shown":[176],"general":[178],"applicability":[179],"in":[184],"solving":[185,201],"problems.":[187,204],"A":[188],"common":[189],"problem-faced":[190],"by":[191],"almost":[192],"all":[193],"algorithms":[196],"premature":[198],"convergence":[199],"when":[200],"hard":[202],"order":[206],"tackle":[208],"problem,":[210],"describe":[212],"our":[213],"strategies":[216],"enhance":[218],"diversity":[219],"while":[220],"enhancing":[221],"exploitation":[222],"as":[223],"well.":[224],"a":[229],"multi-objective":[230],"(MOEP)":[233],"which":[234],"treats":[235],"each":[236],"objective":[237],"independently,":[238],"but":[239],"without":[240],"using":[241],"computationally":[243],"expensive":[244],"non-domination":[245,263],"sorting":[246,264],"algorithm.":[247,265],"MOEP":[249,260],"up":[251],"20":[253],"times":[254],"faster":[255],"compared":[256],"same":[259],"implementation":[261]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}