{"id":"https://openalex.org/W4318603277","doi":"https://doi.org/10.1109/ssci51031.2022.10022069","title":"A Meta Heuristic Genetic Algorithm for Multi-Depot Routing in Autonomous Bridge Inspection","display_name":"A Meta Heuristic Genetic Algorithm for Multi-Depot Routing in Autonomous Bridge Inspection","publication_year":2022,"publication_date":"2022-12-04","ids":{"openalex":"https://openalex.org/W4318603277","doi":"https://doi.org/10.1109/ssci51031.2022.10022069"},"language":"en","primary_location":{"id":"doi:10.1109/ssci51031.2022.10022069","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ssci51031.2022.10022069","pdf_url":null,"source":{"id":"https://openalex.org/S4363605327","display_name":"2022 IEEE Symposium Series on Computational Intelligence (SSCI)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Symposium Series on Computational Intelligence (SSCI)","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/A5088974444","display_name":"Bryan Dedeurwaerder","orcid":null},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Bryan Dedeurwaerder","raw_affiliation_strings":["University of Nevada, Reno,Dept. of Computer Science,Reno,NV,USA","Dept. of Computer Science, University of Nevada, Reno, Reno, NV, USA"],"affiliations":[{"raw_affiliation_string":"University of Nevada, Reno,Dept. of Computer Science,Reno,NV,USA","institution_ids":["https://openalex.org/I134113660"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Nevada, Reno, Reno, NV, USA","institution_ids":["https://openalex.org/I134113660"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038116123","display_name":"Sushil J. Louis","orcid":"https://orcid.org/0000-0001-6702-3950"},"institutions":[{"id":"https://openalex.org/I134113660","display_name":"University of Nevada, Reno","ror":"https://ror.org/01keh0577","country_code":"US","type":"education","lineage":["https://openalex.org/I134113660"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sushil J. Louis","raw_affiliation_strings":["University of Nevada, Reno,Dept. of Computer Science,Reno,NV,USA","Dept. of Computer Science, University of Nevada, Reno, Reno, NV, USA"],"affiliations":[{"raw_affiliation_string":"University of Nevada, Reno,Dept. of Computer Science,Reno,NV,USA","institution_ids":["https://openalex.org/I134113660"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Nevada, Reno, Reno, NV, USA","institution_ids":["https://openalex.org/I134113660"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5088974444"],"corresponding_institution_ids":["https://openalex.org/I134113660"],"apc_list":null,"apc_paid":null,"fwci":0.1798,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.54691288,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1194","last_page":"1201"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9911999702453613,"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.9911999702453613,"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/T12546","display_name":"Smart Parking Systems Research","score":0.9832000136375427,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9797000288963318,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6290355920791626},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.6275367140769958},{"id":"https://openalex.org/keywords/bridge","display_name":"Bridge (graph theory)","score":0.6096133589744568},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6091672778129578},{"id":"https://openalex.org/keywords/testbed","display_name":"Testbed","score":0.6067581176757812},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.564964771270752},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5633631944656372},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5458652377128601},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.5457209944725037},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5135195851325989},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.49881553649902344},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4736921787261963},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.44317135214805603},{"id":"https://openalex.org/keywords/truss-bridge","display_name":"Truss bridge","score":0.44215071201324463},{"id":"https://openalex.org/keywords/arc-routing","display_name":"Arc routing","score":0.41644179821014404},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3785064220428467},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3481740355491638},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.24084264039993286},{"id":"https://openalex.org/keywords/truss","display_name":"Truss","score":0.21444663405418396},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.17027047276496887},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15970122814178467},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.13069257140159607},{"id":"https://openalex.org/keywords/structural-engineering","display_name":"Structural engineering","score":0.07404366135597229}],"concepts":[{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6290355920791626},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.6275367140769958},{"id":"https://openalex.org/C100776233","wikidata":"https://www.wikidata.org/wiki/Q2532492","display_name":"Bridge (graph theory)","level":2,"score":0.6096133589744568},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6091672778129578},{"id":"https://openalex.org/C31395832","wikidata":"https://www.wikidata.org/wiki/Q1318674","display_name":"Testbed","level":2,"score":0.6067581176757812},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.564964771270752},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5633631944656372},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5458652377128601},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.5457209944725037},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5135195851325989},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.49881553649902344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4736921787261963},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.44317135214805603},{"id":"https://openalex.org/C44507003","wikidata":"https://www.wikidata.org/wiki/Q158218","display_name":"Truss bridge","level":3,"score":0.44215071201324463},{"id":"https://openalex.org/C2778536092","wikidata":"https://www.wikidata.org/wiki/Q4785038","display_name":"Arc routing","level":3,"score":0.41644179821014404},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3785064220428467},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3481740355491638},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.24084264039993286},{"id":"https://openalex.org/C173534245","wikidata":"https://www.wikidata.org/wiki/Q1328068","display_name":"Truss","level":2,"score":0.21444663405418396},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.17027047276496887},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15970122814178467},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.13069257140159607},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.07404366135597229},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.0},{"id":"https://openalex.org/C126322002","wikidata":"https://www.wikidata.org/wiki/Q11180","display_name":"Internal medicine","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ssci51031.2022.10022069","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ssci51031.2022.10022069","pdf_url":null,"source":{"id":"https://openalex.org/S4363605327","display_name":"2022 IEEE Symposium Series on Computational Intelligence (SSCI)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Symposium Series on Computational Intelligence (SSCI)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.4399999976158142,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W136762826","https://openalex.org/W1556748137","https://openalex.org/W1577583618","https://openalex.org/W1979267664","https://openalex.org/W2018236017","https://openalex.org/W2031801005","https://openalex.org/W2039677715","https://openalex.org/W2044805678","https://openalex.org/W2064284095","https://openalex.org/W2082809580","https://openalex.org/W2115114028","https://openalex.org/W2167159964","https://openalex.org/W2588727045","https://openalex.org/W2888247042","https://openalex.org/W2957478147","https://openalex.org/W2964166645","https://openalex.org/W2989572795","https://openalex.org/W3087579330","https://openalex.org/W4230410304","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W2377402383","https://openalex.org/W2380835401","https://openalex.org/W2017411971","https://openalex.org/W2172069777","https://openalex.org/W2956620057","https://openalex.org/W2384341213","https://openalex.org/W2393811661","https://openalex.org/W2362152818","https://openalex.org/W3215808204","https://openalex.org/W3019964836"],"abstract_inverted_index":{"We":[0,64],"attack":[1],"the":[2,26,30,37,53,87,114,119,121,153,161],"problem":[3,50],"of":[4,29,36,70,74,118,164],"routing":[5,159],"autonomous":[6],"climbing":[7],"robots":[8],"for":[9,83,145],"steel":[10],"truss":[11,39,75],"bridge":[12,38,68,148],"inspection":[13,149],"using":[14,77],"a":[15,81],"metaheuristic":[16,96,136],"genetic":[17,92,97,137],"algorithm.":[18],"These":[19,128],"robots,":[20],"deployed":[21],"from":[22],"four":[23,27,71,115],"depots":[24],"at":[25],"corners":[28],"bridge,":[31],"must":[32],"traverse":[33],"every":[34],"member":[35],"while":[40],"minimizing":[41],"distance":[42],"traveled":[43],"and":[44,108,151,160],"balancing":[45],"tours":[46,141],"among":[47],"robots.":[48],"This":[49],"maps":[51],"to":[52,86,155,157],"well":[54],"known":[55,89],"NP-Hard":[56],"Min-Max":[57],"Multi-Depot":[58],"k":[59],"(robot)":[60],"Chinese":[61],"Postman":[62],"Problem.":[63],"constructed":[65],"20":[66],"benchmark":[67],"instances":[69],"different":[72],"types":[73],"configurations":[76],"realistic":[78,143],"dimensions":[79],"as":[80],"testbed":[82],"comparison.":[84],"Compared":[85],"best":[88],"direct":[90],"encoded":[91],"algorithm":[93,98,138],"approach,":[94],"our":[95,131,135],"produces":[99],"routes":[100],"that":[101],"are":[102],"on":[103,123,130],"average":[104,124],"25%":[105],"better":[106],"quality,":[107],"does":[109],"so":[110],"22<tex>$x$</tex>":[111],"faster.":[112],"On":[113],"depot":[116],"version":[117],"problem,":[120],"MetaGA":[122],"performs":[125],"42%":[126],"better.":[127],"results":[129],"benchmarks":[132],"show":[133],"evidence":[134],"provides":[139],"high-quality":[140],"in":[142],"time":[144],"real-world":[146],"robot":[147],"scenarios":[150],"has":[152],"potential":[154],"generalize":[156],"vehicle":[158],"broader":[162],"class":[163],"arc-routing":[165],"problems.":[166]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-01-13T01:12:25.745995","created_date":"2025-10-10T00:00:00"}