{"id":"https://openalex.org/W4413906945","doi":"https://doi.org/10.1007/s40747-025-02062-w","title":"An enhanced genetic algorithm for optimized task allocation and planning in heterogeneous multi-robot systems","display_name":"An enhanced genetic algorithm for optimized task allocation and planning in heterogeneous multi-robot systems","publication_year":2025,"publication_date":"2025-09-02","ids":{"openalex":"https://openalex.org/W4413906945","doi":"https://doi.org/10.1007/s40747-025-02062-w"},"language":"en","primary_location":{"id":"doi:10.1007/s40747-025-02062-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s40747-025-02062-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s40747-025-02062-w.pdf","source":{"id":"https://openalex.org/S3035462843","display_name":"Complex & Intelligent Systems","issn_l":"2198-6053","issn":["2198-6053","2199-4536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Complex &amp; Intelligent Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://link.springer.com/content/pdf/10.1007/s40747-025-02062-w.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006517832","display_name":"Ahmed Nait Chabane","orcid":"https://orcid.org/0000-0001-8664-8550"},"institutions":[{"id":"https://openalex.org/I4210162598","display_name":"Centre Hospitalier Saint-Nazaire","ror":"https://ror.org/056v5p787","country_code":"FR","type":"healthcare","lineage":["https://openalex.org/I4210162598"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Ahmed Nait Chabane","raw_affiliation_strings":["CESI LINEACT, 24 Le Paquebot, Saint Nazaire, France"],"affiliations":[{"raw_affiliation_string":"CESI LINEACT, 24 Le Paquebot, Saint Nazaire, France","institution_ids":["https://openalex.org/I4210162598"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062807477","display_name":"Ouahib Guenounou","orcid":null},"institutions":[{"id":"https://openalex.org/I129235615","display_name":"CEA CESTA","ror":"https://ror.org/026ma2c10","country_code":"FR","type":"government","lineage":["https://openalex.org/I129235615","https://openalex.org/I4210101455"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ouahib Guenounou","raw_affiliation_strings":["CESI LINEACT, 44 Fr\u00e9d\u00e9ric Auguste Bartholdi, Le Mans, France"],"affiliations":[{"raw_affiliation_string":"CESI LINEACT, 44 Fr\u00e9d\u00e9ric Auguste Bartholdi, Le Mans, France","institution_ids":["https://openalex.org/I129235615"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5006517832"],"corresponding_institution_ids":["https://openalex.org/I4210162598"],"apc_list":{"value":1320,"currency":"GBP","value_usd":1619},"apc_paid":{"value":1320,"currency":"GBP","value_usd":1619},"fwci":4.6519,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.95269457,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":99},"biblio":{"volume":"11","issue":"10","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9976999759674072,"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/computational-intelligence","display_name":"Computational intelligence","score":0.8323190212249756},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.7204018831253052},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6351479291915894},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6100041270256042},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.49926328659057617},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.396496444940567},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3239631950855255},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.21179994940757751},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.14902427792549133},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1370757520198822},{"id":"https://openalex.org/keywords/systems-engineering","display_name":"Systems engineering","score":0.08441030979156494}],"concepts":[{"id":"https://openalex.org/C139502532","wikidata":"https://www.wikidata.org/wiki/Q1122090","display_name":"Computational intelligence","level":2,"score":0.8323190212249756},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.7204018831253052},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6351479291915894},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6100041270256042},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.49926328659057617},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.396496444940567},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3239631950855255},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.21179994940757751},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.14902427792549133},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1370757520198822},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.08441030979156494}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s40747-025-02062-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s40747-025-02062-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s40747-025-02062-w.pdf","source":{"id":"https://openalex.org/S3035462843","display_name":"Complex & Intelligent Systems","issn_l":"2198-6053","issn":["2198-6053","2199-4536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Complex &amp; Intelligent Systems","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-05236545v1","is_oa":false,"landing_page_url":"https://hal.science/hal-05236545","pdf_url":null,"source":{"id":"https://openalex.org/S4406922466","display_name":"SPIRE - Sciences Po Institutional REpository","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Complex & Intelligent Systems, 2025, 11 (10), pp.435. &#x27E8;10.1007/s40747-025-02062-w&#x27E9;","raw_type":"Journal articles"},{"id":"pmh:oai:doaj.org/article:c4b4dabee65544c0a62eaa480145ac47","is_oa":true,"landing_page_url":"https://doaj.org/article/c4b4dabee65544c0a62eaa480145ac47","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Complex & Intelligent Systems, Vol 11, Iss 10, Pp 1-26 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s40747-025-02062-w","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s40747-025-02062-w","pdf_url":"https://link.springer.com/content/pdf/10.1007/s40747-025-02062-w.pdf","source":{"id":"https://openalex.org/S3035462843","display_name":"Complex & Intelligent Systems","issn_l":"2198-6053","issn":["2198-6053","2199-4536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Complex &amp; Intelligent Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4413906945.pdf","grobid_xml":"https://content.openalex.org/works/W4413906945.grobid-xml"},"referenced_works_count":43,"referenced_works":["https://openalex.org/W1547421646","https://openalex.org/W1594264634","https://openalex.org/W2019185678","https://openalex.org/W2072219812","https://openalex.org/W2133703180","https://openalex.org/W2138104929","https://openalex.org/W2139559439","https://openalex.org/W2157488300","https://openalex.org/W2416022643","https://openalex.org/W2505968561","https://openalex.org/W2966219041","https://openalex.org/W3099129590","https://openalex.org/W3150257791","https://openalex.org/W3199270766","https://openalex.org/W4206751062","https://openalex.org/W4206945455","https://openalex.org/W4220790057","https://openalex.org/W4288722670","https://openalex.org/W4292414934","https://openalex.org/W4296616182","https://openalex.org/W4306957265","https://openalex.org/W4319069705","https://openalex.org/W4321254709","https://openalex.org/W4361266052","https://openalex.org/W4385075196","https://openalex.org/W4385155193","https://openalex.org/W4386702721","https://openalex.org/W4386766633","https://openalex.org/W4386804222","https://openalex.org/W4389665339","https://openalex.org/W4391228890","https://openalex.org/W4391522468","https://openalex.org/W4400412558","https://openalex.org/W4401844160","https://openalex.org/W4402833342","https://openalex.org/W4403429725","https://openalex.org/W4403907356","https://openalex.org/W4404056833","https://openalex.org/W4404517274","https://openalex.org/W4404729376","https://openalex.org/W4405912652","https://openalex.org/W4406627493","https://openalex.org/W4411552286"],"related_works":["https://openalex.org/W2736674626","https://openalex.org/W2973875853","https://openalex.org/W8302103","https://openalex.org/W3171631314","https://openalex.org/W2674584172","https://openalex.org/W2967743314","https://openalex.org/W2606825221","https://openalex.org/W2184085865","https://openalex.org/W3213722473","https://openalex.org/W2110944602"],"abstract_inverted_index":{"Efficient":[0],"task":[1,55],"allocation":[2],"and":[3,26,40,57,87,115,134,173,185],"path":[4,82],"planning":[5],"in":[6,15,177],"heterogeneous":[7,136],"multi-robot":[8],"systems":[9],"(MRS)":[10],"remains":[11],"a":[12,45,64,104,109],"significant":[13],"challenge":[14],"industrial":[16,195],"inspection":[17,132,196],"contexts,":[18],"particularly":[19],"when":[20],"robots":[21],"exhibit":[22],"diverse":[23],"sensing":[24],"capabilities":[25],"must":[27],"operate":[28],"across":[29,126],"spatially":[30],"distributed":[31],"sites.":[32],"To":[33],"address":[34],"the":[35,93,120,166,183,189],"limitations":[36],"of":[37,119,188],"exact":[38,97],"methods":[39],"conventional":[41],"heuristics,":[42],"we":[43],"propose":[44],"novel":[46],"two-phase":[47],"enhanced":[48],"genetic":[49,106],"algorithm":[50,107,124],"(EGA)":[51],"tailored":[52],"for":[53,192],"capability-constrained":[54],"assignment":[56],"route":[58],"optimization.":[59],"The":[60,75],"first":[61],"phase":[62,77,168],"employs":[63],"domain-specific":[65],"chromosome":[66],"encoding":[67],"to":[68,83,130,160,163],"assign":[69],"tasks":[70],"while":[71,154],"enforcing":[72],"robot-measurement":[73],"compatibility.":[74],"second":[76,167],"locally":[78],"refines":[79],"each":[80],"robot\u2019s":[81],"minimize":[84],"travel":[85],"distance":[86],"improve":[88],"load":[89],"balancing.":[90],"We":[91],"benchmark":[92],"EGA":[94,143],"against":[95],"an":[96,116],"mixed":[98],"integer":[99],"linear":[100],"programming":[101],"(MILP)":[102],"model,":[103],"standard":[105],"(single-phase),":[108],"particle":[110],"swarm":[111],"optimization":[112],"(PSO)":[113],"approach,":[114],"adapted":[117],"version":[118],"bi-level":[121],"surrogate-assisted":[122],"evolutionary":[123],"(BL-SAEA)":[125],"scenarios":[127],"involving":[128],"up":[129,159],"50":[131],"sites":[133],"4":[135],"robots.":[137],"Experimental":[138],"results":[139,181],"show":[140],"that":[141],"our":[142],"consistently":[144],"produces":[145],"near-optimal":[146],"solutions,":[147],"achieving":[148],"average":[149],"optimality":[150],"gaps":[151],"below":[152],"1.5%,":[153],"reducing":[155],"computation":[156],"times":[157],"by":[158],"90%":[161],"compared":[162],"MILP.":[164],"Furthermore,":[165],"significantly":[169],"enhances":[170],"convergence":[171],"stability":[172],"solution":[174],"robustness,":[175],"especially":[176],"large-scale":[178],"instances.":[179],"These":[180],"demonstrate":[182],"scalability":[184],"practical":[186],"suitability":[187],"proposed":[190],"method":[191],"real-time,":[193],"resource-constrained":[194],"missions.":[197]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-09-02T00:00:00"}
