{"id":"https://openalex.org/W2774251702","doi":"https://doi.org/10.1142/s1469026817500250","title":"Immigrants Based Adaptive Genetic Algorithms for Task Allocation in Multi-Robot Systems","display_name":"Immigrants Based Adaptive Genetic Algorithms for Task Allocation in Multi-Robot Systems","publication_year":2017,"publication_date":"2017-12-01","ids":{"openalex":"https://openalex.org/W2774251702","doi":"https://doi.org/10.1142/s1469026817500250","mag":"2774251702"},"language":"en","primary_location":{"id":"doi:10.1142/s1469026817500250","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1469026817500250","pdf_url":null,"source":{"id":"https://openalex.org/S206936884","display_name":"International Journal of Computational Intelligence and Applications","issn_l":"1469-0268","issn":["1469-0268","1757-5885"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence and Applications","raw_type":"journal-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/A5003623633","display_name":"Pranab K. Muhuri","orcid":"https://orcid.org/0000-0001-7122-7622"},"institutions":[{"id":"https://openalex.org/I90425906","display_name":"South Asian University","ror":"https://ror.org/02kjyst95","country_code":"IN","type":"education","lineage":["https://openalex.org/I90425906"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Pranab K Muhuri","raw_affiliation_strings":["Department of Computer Science, South Asian University, New Delhi 110021, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, South Asian University, New Delhi 110021, India","institution_ids":["https://openalex.org/I90425906"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052882219","display_name":"Amit Rauniyar","orcid":"https://orcid.org/0000-0002-5735-6548"},"institutions":[{"id":"https://openalex.org/I90425906","display_name":"South Asian University","ror":"https://ror.org/02kjyst95","country_code":"IN","type":"education","lineage":["https://openalex.org/I90425906"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Amit Rauniyar","raw_affiliation_strings":["Department of Computer Science, South Asian University, New Delhi 110021, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, South Asian University, New Delhi 110021, India","institution_ids":["https://openalex.org/I90425906"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5003623633"],"corresponding_institution_ids":["https://openalex.org/I90425906"],"apc_list":null,"apc_paid":null,"fwci":1.9606,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.88766656,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"16","issue":"04","first_page":"1750025","last_page":"1750025"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9937000274658203,"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/T12288","display_name":"Optimization and Search Problems","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8368088006973267},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6709121465682983},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6149449348449707},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5845007300376892},{"id":"https://openalex.org/keywords/variance","display_name":"Variance (accounting)","score":0.4841111898422241},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4498160183429718},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43080881237983704},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38391196727752686},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3499114215373993},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.29685646295547485},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07942599058151245}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8368088006973267},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6709121465682983},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6149449348449707},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5845007300376892},{"id":"https://openalex.org/C196083921","wikidata":"https://www.wikidata.org/wiki/Q7915758","display_name":"Variance (accounting)","level":2,"score":0.4841111898422241},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4498160183429718},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43080881237983704},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38391196727752686},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3499114215373993},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.29685646295547485},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07942599058151245},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C121955636","wikidata":"https://www.wikidata.org/wiki/Q4116214","display_name":"Accounting","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1469026817500250","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1469026817500250","pdf_url":null,"source":{"id":"https://openalex.org/S206936884","display_name":"International Journal of Computational Intelligence and Applications","issn_l":"1469-0268","issn":["1469-0268","1757-5885"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311754","host_organization_name":"Imperial College Press","host_organization_lineage":["https://openalex.org/P4310311754"],"host_organization_lineage_names":["Imperial College Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Intelligence and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.41999998688697815,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321071","display_name":"Department of Electronics and Information Technology, Ministry of Communications and Information Technology","ror":"https://ror.org/02z31cn83"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W8897691","https://openalex.org/W173758486","https://openalex.org/W1487172044","https://openalex.org/W1539694548","https://openalex.org/W1555154718","https://openalex.org/W1719186128","https://openalex.org/W1966754032","https://openalex.org/W1971441460","https://openalex.org/W1972391046","https://openalex.org/W1983961745","https://openalex.org/W1987926710","https://openalex.org/W1990771923","https://openalex.org/W2007088348","https://openalex.org/W2012812921","https://openalex.org/W2030307920","https://openalex.org/W2038847765","https://openalex.org/W2051080947","https://openalex.org/W2068305009","https://openalex.org/W2072583763","https://openalex.org/W2076701290","https://openalex.org/W2079748944","https://openalex.org/W2084817988","https://openalex.org/W2085888329","https://openalex.org/W2088668112","https://openalex.org/W2096416100","https://openalex.org/W2096440680","https://openalex.org/W2104087708","https://openalex.org/W2107258648","https://openalex.org/W2107686474","https://openalex.org/W2113257089","https://openalex.org/W2119120935","https://openalex.org/W2129842050","https://openalex.org/W2131562862","https://openalex.org/W2132340807","https://openalex.org/W2137130066","https://openalex.org/W2137714578","https://openalex.org/W2139883176","https://openalex.org/W2144827113","https://openalex.org/W2151740479","https://openalex.org/W2156887976","https://openalex.org/W2157488300","https://openalex.org/W2162509910","https://openalex.org/W2162844575","https://openalex.org/W2182089961","https://openalex.org/W2322038820","https://openalex.org/W2408697637","https://openalex.org/W2512972094","https://openalex.org/W2587385967","https://openalex.org/W2588374640","https://openalex.org/W4211185905"],"related_works":["https://openalex.org/W2140798747","https://openalex.org/W2948169060","https://openalex.org/W2730112582","https://openalex.org/W2358580169","https://openalex.org/W2111347279","https://openalex.org/W2110696645","https://openalex.org/W2110944602","https://openalex.org/W3213722473","https://openalex.org/W2037004935","https://openalex.org/W2081472162"],"abstract_inverted_index":{"Optimal":[0],"task":[1,122],"allocation":[2,123],"among":[3],"the":[4,12,19,26,32,41,51,98,149,191],"suitably":[5],"formed":[6],"robot":[7],"groups":[8],"is":[9,43,59,200],"one":[10],"of":[11,22,29,34,53,94,133,151,193],"key":[13],"issues":[14],"to":[15,40,73,88,177],"be":[16,74],"investigated":[17],"for":[18,120,170,211],"smooth":[20],"operations":[21],"multi-robot":[23,62],"systems.":[24],"Considering":[25],"complete":[27],"execution":[28],"available":[30,36],"tasks,":[31],"problem":[33,58],"assigning":[35],"resources":[37],"(robot":[38],"features)":[39],"tasks":[42,54],"computationally":[44],"complex,":[45],"which":[46],"may":[47],"further":[48],"increase":[49],"if":[50],"number":[52],"increases.":[55],"Popularly":[56],"this":[57],"known":[60],"as":[61,157],"coalition":[63],"formation":[64],"(MRCF)":[65],"problem.":[66,126],"Genetic":[67],"algorithms":[68,135],"(GAs)":[69],"have":[70,96],"been":[71,197],"found":[72],"quite":[75],"efficient":[76],"in":[77,124,142],"solving":[78],"such":[79],"complex":[80],"computational":[81],"problems.":[82],"There":[83],"are":[84,168],"several":[85],"GA-based":[86],"approaches":[87],"solve":[89],"MRCF":[90,125],"problems":[91],"but":[92],"none":[93],"them":[95,137,156],"considered":[97],"dynamic":[99],"GA":[100],"variants.":[101],"This":[102],"paper":[103],"considers":[104],"immigrants-based":[105],"GAs":[106],"viz.":[107],"random":[108],"immigrants":[109,116],"genetic":[110,117,152,179,216],"algorithm":[111,118,180],"(RIGA)":[112],"and":[113,154,161,204,214,221,225],"elitism":[114],"based":[115],"(EIGA)":[119],"optimal":[121],"Further,":[127],"it":[128],"reports":[129],"a":[130,171],"novel":[131],"use":[132],"these":[134],"making":[136],"adaptive":[138,158,162,215],"with":[139,175,190],"certain":[140],"modifications":[141],"their":[143],"traditional":[144],"attributes":[145],"by":[146],"adaptively":[147],"choosing":[148],"parameters":[150],"operators":[153],"terms":[155],"RIGA":[159,203,224],"(aRIGA)":[160],"EIGA":[163,205,220],"(aEIGA).":[164],"Extensive":[165],"simulation":[166],"experiments":[167],"conducted":[169],"comparative":[172],"performance":[173,185],"evaluation":[174],"respect":[176],"standard":[178],"(SGA)":[181],"using":[182],"three":[183],"popular":[184],"metrics.":[186],"A":[187],"statistical":[188],"analysis":[189,192],"variance":[194],"has":[195],"also":[196],"performed.":[198],"It":[199],"demonstrated":[201],"that":[202],"produce":[206],"better":[207],"solutions":[208],"than":[209],"SGA":[210],"both":[212],"fixed":[213],"operators.":[217],"Among":[218],"them,":[219],"aEIGA":[222],"outperform":[223],"aRIGA,":[226],"respectively.":[227]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4}],"updated_date":"2026-08-14T07:06:38.338062","created_date":"2025-10-10T00:00:00"}