{"id":"https://openalex.org/W2972901114","doi":"https://doi.org/10.1109/cec.2019.8790371","title":"Peacock Algorithm","display_name":"Peacock Algorithm","publication_year":2019,"publication_date":"2019-06-01","ids":{"openalex":"https://openalex.org/W2972901114","doi":"https://doi.org/10.1109/cec.2019.8790371","mag":"2972901114"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2019.8790371","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2019.8790371","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Congress on Evolutionary Computation (CEC)","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/A5082534055","display_name":"Reshu Chaudhary","orcid":"https://orcid.org/0000-0002-6006-4706"},"institutions":[{"id":"https://openalex.org/I110166357","display_name":"University of Delhi","ror":"https://ror.org/04gzb2213","country_code":"IN","type":"education","lineage":["https://openalex.org/I110166357"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Reshu Chaudhary","raw_affiliation_strings":["Department of Computer Science, University of Delhi, Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Delhi, Delhi, India","institution_ids":["https://openalex.org/I110166357"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050592692","display_name":"Hema Banati","orcid":"https://orcid.org/0000-0002-8085-7527"},"institutions":[{"id":"https://openalex.org/I110166357","display_name":"University of Delhi","ror":"https://ror.org/04gzb2213","country_code":"IN","type":"education","lineage":["https://openalex.org/I110166357"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Hema Banati","raw_affiliation_strings":["Dyal Singh College, University of Delhi, Delhi, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dyal Singh College, University of Delhi, Delhi, India","institution_ids":["https://openalex.org/I110166357"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2892,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.67043914,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"2331","last_page":"2338"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9991999864578247,"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.9991999864578247,"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.9818000197410583,"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.9412000179290771,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5899417996406555},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5865427255630493},{"id":"https://openalex.org/keywords/lek-mating","display_name":"Lek mating","score":0.5555981993675232},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5494253039360046},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4434114098548889},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35765889286994934},{"id":"https://openalex.org/keywords/mating","display_name":"Mating","score":0.19305244088172913},{"id":"https://openalex.org/keywords/mate-choice","display_name":"Mate choice","score":0.11947041749954224},{"id":"https://openalex.org/keywords/geography","display_name":"Geography","score":0.08983549475669861},{"id":"https://openalex.org/keywords/cartography","display_name":"Cartography","score":0.06934109330177307}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5899417996406555},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5865427255630493},{"id":"https://openalex.org/C12411756","wikidata":"https://www.wikidata.org/wiki/Q1816486","display_name":"Lek mating","level":4,"score":0.5555981993675232},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5494253039360046},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4434114098548889},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35765889286994934},{"id":"https://openalex.org/C514575182","wikidata":"https://www.wikidata.org/wiki/Q228395","display_name":"Mating","level":2,"score":0.19305244088172913},{"id":"https://openalex.org/C54779947","wikidata":"https://www.wikidata.org/wiki/Q1209263","display_name":"Mate choice","level":3,"score":0.11947041749954224},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.08983549475669861},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.06934109330177307},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2019.8790371","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2019.8790371","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE Congress on Evolutionary Computation (CEC)","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":50,"referenced_works":["https://openalex.org/W596049705","https://openalex.org/W1102883814","https://openalex.org/W1195325312","https://openalex.org/W1587263632","https://openalex.org/W1596914020","https://openalex.org/W1642940937","https://openalex.org/W1968075052","https://openalex.org/W1974330875","https://openalex.org/W1982522576","https://openalex.org/W1982658584","https://openalex.org/W1997987442","https://openalex.org/W1998782714","https://openalex.org/W2001975861","https://openalex.org/W2005166868","https://openalex.org/W2010879721","https://openalex.org/W2017782761","https://openalex.org/W2024936104","https://openalex.org/W2025603547","https://openalex.org/W2033184145","https://openalex.org/W2042253843","https://openalex.org/W2042494420","https://openalex.org/W2043325537","https://openalex.org/W2044587647","https://openalex.org/W2062961150","https://openalex.org/W2065322714","https://openalex.org/W2065543187","https://openalex.org/W2123105979","https://openalex.org/W2150460060","https://openalex.org/W2152195021","https://openalex.org/W2166095939","https://openalex.org/W2171211995","https://openalex.org/W2173538357","https://openalex.org/W2181966827","https://openalex.org/W2198792620","https://openalex.org/W2211945929","https://openalex.org/W2223528668","https://openalex.org/W2224971544","https://openalex.org/W2237685256","https://openalex.org/W2287654067","https://openalex.org/W2290883490","https://openalex.org/W2347008388","https://openalex.org/W2364240738","https://openalex.org/W2508671486","https://openalex.org/W2543580944","https://openalex.org/W2585392941","https://openalex.org/W2889545660","https://openalex.org/W2963103847","https://openalex.org/W3104313545","https://openalex.org/W4231507133","https://openalex.org/W4243924057"],"related_works":["https://openalex.org/W3016744902","https://openalex.org/W4388252440","https://openalex.org/W2371830386","https://openalex.org/W1982055135","https://openalex.org/W2076864577","https://openalex.org/W4388386522","https://openalex.org/W1540532593","https://openalex.org/W2109818470","https://openalex.org/W2041175940","https://openalex.org/W4376878263"],"abstract_inverted_index":{"The":[0,22,36,102,120],"paper":[1],"proposes":[2],"a":[3,148,160,190],"novel":[4,192],"nature-inspired":[5],"swarm":[6],"algorithm:":[7],"peacock":[8,86,89,94,104],"algorithm":[9,121],"(PA).":[10],"It":[11],"is":[12,74,145,169],"based":[13,43],"on":[14,44],"the":[15,30,41,63,69,92,138,141,173,183],"lekking":[16,118],"and":[17,66,164],"mating":[18,100],"behavior":[19],"of":[20,140,150,162,185],"peacocks.":[21],"best":[23],"solutions":[24,32,127,130],"are":[25,33,38,131,159],"identified":[26],"as":[27,56,58,189],"peacocks,":[28],"while":[29,51],"remaining":[31],"called":[34],"peahens.":[35],"peahens":[37,52],"assigned":[39],"to":[40,78,80,97,133,154,177],"peacocks":[42,112],"their":[45],"relative":[46],"positions.":[47],"Peacocks":[48],"perform":[49,53],"exploitation":[50],"both,":[54],"exploration":[55],"well":[57],"exploitation.":[59],"A":[60],"peahen":[61],"explores":[62],"search":[64],"space":[65],"moves":[67,90],"towards":[68,91],"lek":[70,107],"peacock.":[71],"Once":[72],"it":[73,76,144,188],"near,":[75],"may":[77],"choose":[79],"mate":[81],"(exploitation)":[82],"or":[83],"pursue":[84],"another":[85],"(exploration).":[87],"Every":[88],"dominant":[93,103],"(best":[95],"solution)":[96],"enhance":[98],"its":[99,117],"chances.":[101],"maintains":[105,122],"his":[106],"by":[108,124],"pushing":[109],"away":[110],"other":[111,156],"if":[113],"they":[114],"encroach":[115],"upon":[116],"area.":[119],"diversity":[123],"adding":[125],"random":[126],"whenever":[128],"two":[129],"found":[132],"be":[134],"similar.":[135],"To":[136],"test":[137,175],"efficiency":[139],"proposed":[142],"work,":[143],"compared":[146,171],"over":[147,172],"set":[149],"23":[151],"benchmark":[152],"functions":[153],"nine":[155],"algorithms,":[157],"which":[158],"mixture":[161],"well-established":[163],"new":[165],"algorithms.":[166,179],"Its":[167],"performance":[168],"also":[170],"CEC'14":[174],"suite":[176],"six":[178],"Experimental":[180],"results":[181],"demonstrate":[182],"superiority":[184],"PA,":[186],"establishing":[187],"promising":[191],"algorithm.":[193]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":5},{"year":2021,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2019-09-19T00:00:00"}