{"id":"https://openalex.org/W2045275371","doi":"https://doi.org/10.1109/cec.2014.6900280","title":"Hybrid ACO/EA algorithms applied to the multi-agent patrolling problem","display_name":"Hybrid ACO/EA algorithms applied to the multi-agent patrolling problem","publication_year":2014,"publication_date":"2014-07-01","ids":{"openalex":"https://openalex.org/W2045275371","doi":"https://doi.org/10.1109/cec.2014.6900280","mag":"2045275371"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2014.6900280","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900280","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 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/A5082374448","display_name":"Fabrice Lauri","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Fabrice Lauri","raw_affiliation_strings":["IRTES-SeT, Rue Thiery-Mieg, Belfort, FRANCE","IRTES-SeT, Rue Thiery-Mieg, 90010 Belfort, France"],"affiliations":[{"raw_affiliation_string":"IRTES-SeT, Rue Thiery-Mieg, Belfort, FRANCE","institution_ids":[]},{"raw_affiliation_string":"IRTES-SeT, Rue Thiery-Mieg, 90010 Belfort, France","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022466993","display_name":"Abderraf\u00ec\u00e2a Koukam","orcid":"https://orcid.org/0000-0002-7383-5143"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Abderrafiaa Koukam","raw_affiliation_strings":["IRTES-SeT, Rue Thiery-Mieg, Belfort, FRANCE","IRTES-SeT, Rue Thiery-Mieg, 90010 Belfort, France"],"affiliations":[{"raw_affiliation_string":"IRTES-SeT, Rue Thiery-Mieg, Belfort, FRANCE","institution_ids":[]},{"raw_affiliation_string":"IRTES-SeT, Rue Thiery-Mieg, 90010 Belfort, France","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082374448"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7194,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.75532673,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"250","last_page":"257"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9972000122070312,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.994700014591217,"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/patrolling","display_name":"Patrolling","score":0.993658185005188},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.7165842056274414},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6968980431556702},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6199191808700562},{"id":"https://openalex.org/keywords/core","display_name":"Core (optical fiber)","score":0.533771276473999},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49689510464668274},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.49260765314102173},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32618510723114014},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2677561938762665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1344638168811798},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11445817351341248}],"concepts":[{"id":"https://openalex.org/C110698143","wikidata":"https://www.wikidata.org/wiki/Q651389","display_name":"Patrolling","level":2,"score":0.993658185005188},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.7165842056274414},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6968980431556702},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6199191808700562},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.533771276473999},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49689510464668274},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.49260765314102173},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32618510723114014},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2677561938762665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1344638168811798},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11445817351341248},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cec.2014.6900280","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2014.6900280","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.724.4225","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.724.4225","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.multiagent.fr/extensions/ICAPManager/pdf/LauriKoukam2014_1.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W197844793","https://openalex.org/W1516838788","https://openalex.org/W1543672909","https://openalex.org/W1586765580","https://openalex.org/W1603050797","https://openalex.org/W2042986967","https://openalex.org/W2099515255","https://openalex.org/W2108052711","https://openalex.org/W2125298348","https://openalex.org/W2128862550","https://openalex.org/W2167914138","https://openalex.org/W2171233306","https://openalex.org/W2256169618","https://openalex.org/W2295841927","https://openalex.org/W4232693667","https://openalex.org/W4296951101","https://openalex.org/W6607973403","https://openalex.org/W6632495983","https://openalex.org/W6679022538","https://openalex.org/W6685322295","https://openalex.org/W6842909931"],"related_works":["https://openalex.org/W170273588","https://openalex.org/W2337788814","https://openalex.org/W2092973197","https://openalex.org/W2404411151","https://openalex.org/W2163146706","https://openalex.org/W3206391274","https://openalex.org/W167683769","https://openalex.org/W2332242917","https://openalex.org/W2095900292","https://openalex.org/W2374340569"],"abstract_inverted_index":{"Patrolling":[0],"an":[1],"environment":[2],"consists":[3],"in":[4,14,50],"visiting":[5],"as":[6,8],"frequently":[7],"possible":[9],"its":[10],"most":[11],"relevant":[12],"areas":[13,65],"order":[15],"to":[16,34],"supervise,":[17],"control":[18],"or":[19,149],"protect":[20],"it.":[21],"This":[22],"task":[23],"is":[24],"commonly":[25],"performed":[26],"by":[27,156],"a":[28,89,105],"team":[29],"of":[30,47,71,88,152],"agents":[31,54,124],"that":[32],"need":[33],"coordinate":[35],"their":[36],"actions":[37],"for":[38,96],"achieving":[39],"optimal":[40],"performance.":[41],"We":[42],"address":[43],"here":[44],"the":[45,76,80,116,127,153],"problem":[46],"multiagent":[48],"patrolling":[49,72],"known":[51],"environments":[52],"where":[53],"may":[55,66,145],"move":[56,125],"at":[57,126],"different":[58],"speeds":[59,129],"and":[60,79,85,130],"visit":[61,132],"priorities":[62,133],"on":[63],"some":[64],"be":[67],"specified.":[68],"Two":[69],"classes":[70],"strategies":[73,78,122],"are":[74,94,101,140],"studied:":[75],"single-cycle":[77,110],"partition-based":[81,98],"strategies.":[82,99,111],"Several":[83],"single-core":[84,138,157],"multi-core":[86,142],"variants":[87,139],"template":[90],"state-of-the-art":[91,106],"hybrid":[92,143],"algorithm":[93,108,118],"proposed":[95],"generating":[97,109],"These":[100],"experimentally":[102],"compared":[103],"with":[104],"heuristic-based":[107,117],"Experimental":[112],"results":[113],"show":[114],"that:":[115],"only":[119],"generates":[120],"efficient":[121],"when":[123],"same":[128],"no":[131],"have":[134],"been":[135],"defined;":[136],"all":[137],"equivalent;":[141],"algorithms":[144],"improve":[146],"overall":[147],"quality":[148],"reduce":[150],"variance":[151],"solutions":[154],"obtained":[155],"algorithms.":[158]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}