{"id":"https://openalex.org/W2066873908","doi":"https://doi.org/10.1145/2330163.2330218","title":"An evolutionary approach for the dubins' traveling salesman problem with neighborhoods","display_name":"An evolutionary approach for the dubins' traveling salesman problem with neighborhoods","publication_year":2012,"publication_date":"2012-07-07","ids":{"openalex":"https://openalex.org/W2066873908","doi":"https://doi.org/10.1145/2330163.2330218","mag":"2066873908"},"language":"en","primary_location":{"id":"doi:10.1145/2330163.2330218","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2330163.2330218","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th annual conference on Genetic and evolutionary computation","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/A5074933369","display_name":"Douglas G. Macharet","orcid":"https://orcid.org/0000-0002-1781-7186"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Douglas Guimaraes Macharet","raw_affiliation_strings":["Universidade Federal de Minas Gerais, Belo Horizonte, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Minas Gerais, Belo Horizonte, Brazil","institution_ids":["https://openalex.org/I110200422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083656237","display_name":"Armando Alves Neto","orcid":"https://orcid.org/0000-0002-4940-0377"},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Armando Alves Neto","raw_affiliation_strings":["Universidade Federal de Minas Gerais, Belo Horizonte, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Minas Gerais, Belo Horizonte, Brazil","institution_ids":["https://openalex.org/I110200422"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112470795","display_name":"Vilar Fiuza da Camara Neto","orcid":null},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Vilar Fiuza da Camara Neto","raw_affiliation_strings":["Universidade Federal de Minas Gerais, Belo Horizonte, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Minas Gerais, Belo Horizonte, Brazil","institution_ids":["https://openalex.org/I110200422"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048341215","display_name":"Mario Montenegro Campos","orcid":null},"institutions":[{"id":"https://openalex.org/I110200422","display_name":"Universidade Federal de Minas Gerais","ror":"https://ror.org/0176yjw32","country_code":"BR","type":"education","lineage":["https://openalex.org/I110200422"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Mario Montenegro Campos","raw_affiliation_strings":["Universidade Federal de Minas Gerais, Belo Horizonte, Brazil"],"affiliations":[{"raw_affiliation_string":"Universidade Federal de Minas Gerais, Belo Horizonte, Brazil","institution_ids":["https://openalex.org/I110200422"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5074933369"],"corresponding_institution_ids":["https://openalex.org/I110200422"],"apc_list":null,"apc_paid":null,"fwci":1.3727,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.83230305,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"377","last_page":"384"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9805999994277954,"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/waypoint","display_name":"Waypoint","score":0.841171145439148},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6071187257766724},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6014529466629028},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5973854064941406},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5960090756416321},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5953887104988098},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5141873359680176},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.48001402616500854},{"id":"https://openalex.org/keywords/nonholonomic-system","display_name":"Nonholonomic system","score":0.46725934743881226},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4550240635871887},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.44272473454475403},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4138796329498291},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3242120146751404},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.24483314156532288},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.22185653448104858},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2101512849330902}],"concepts":[{"id":"https://openalex.org/C2781271823","wikidata":"https://www.wikidata.org/wiki/Q138081","display_name":"Waypoint","level":2,"score":0.841171145439148},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6071187257766724},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6014529466629028},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5973854064941406},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5960090756416321},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5953887104988098},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5141873359680176},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.48001402616500854},{"id":"https://openalex.org/C138632511","wikidata":"https://www.wikidata.org/wiki/Q2478109","display_name":"Nonholonomic system","level":4,"score":0.46725934743881226},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4550240635871887},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.44272473454475403},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4138796329498291},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3242120146751404},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.24483314156532288},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.22185653448104858},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2101512849330902},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2330163.2330218","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2330163.2330218","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 14th annual conference on Genetic and evolutionary computation","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.800000011920929,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W16274536","https://openalex.org/W206440355","https://openalex.org/W307896644","https://openalex.org/W626292722","https://openalex.org/W1492170047","https://openalex.org/W1544478599","https://openalex.org/W1966048254","https://openalex.org/W2002817007","https://openalex.org/W2016704807","https://openalex.org/W2035610952","https://openalex.org/W2104642742","https://openalex.org/W2110824994","https://openalex.org/W2131569937","https://openalex.org/W2144636407","https://openalex.org/W2145128369","https://openalex.org/W2148761022","https://openalex.org/W2168990813","https://openalex.org/W2313274380","https://openalex.org/W2323709497","https://openalex.org/W2332499306","https://openalex.org/W3121675905","https://openalex.org/W3150899403","https://openalex.org/W6681558681"],"related_works":["https://openalex.org/W2688471429","https://openalex.org/W4360939124","https://openalex.org/W2077345734","https://openalex.org/W2899287767","https://openalex.org/W2275928629","https://openalex.org/W2612848489","https://openalex.org/W2915444871","https://openalex.org/W2863424594","https://openalex.org/W2135584875","https://openalex.org/W2383775285"],"abstract_inverted_index":{"In":[0,60],"this":[1],"work":[2],"we":[3],"propose":[4],"an":[5,24],"efficient":[6],"and":[7,49,87,112,159],"simple":[8],"three-stage":[9],"evolutionary":[10],"algorithm":[11],"to":[12,43,189],"tackle":[13],"the":[14,47,50,54,61,64,67,70,73,81,91,115,127,133,139,156,178,193],"difficult":[15],"problem":[16,55],"of":[17,23,53,69,75,95,114,182],"planning":[18],"shorter":[19],"paths":[20,131,190],"through":[21],"regions":[22],"environment":[25],"which":[26],"are":[27],"feasible":[28],"for":[29,129],"a":[30,57,103,109,121,145,167,175],"nonholonomic":[31],"vehicle":[32],"with":[33,151],"curvature":[34],"constraints":[35],"(e.g.":[36],"Dubins'":[37],"vehicle).":[38],"Our":[39,172],"method":[40,65,165],"is":[41],"able":[42],"efficiently":[44],"solve":[45],"both":[46],"combinatorial":[48],"continuous":[51],"steps":[52],"in":[56,102,132,138],"combined":[58],"manner.":[59],"first":[62],"phase,":[63],"varies":[66],"position":[68],"waypoints":[71],"within":[72],"boundaries":[74],"each":[76,85],"region,":[77],"it":[78,89],"then":[79],"optimizes":[80],"path":[82,180],"orientation":[83],"at":[84],"waypoint,":[86],"finally":[88],"chooses":[90],"best":[92],"actual":[93],"sequence":[94],"visit.":[96],"Numerous":[97],"trials,":[98],"under":[99],"different":[100],"scenarios":[101],"simulated":[104],"environment,":[105],"were":[106],"executed":[107],"providing":[108],"thorough":[110],"evaluation":[111],"validation":[113],"methodology.":[116],"The":[117],"results":[118,173],"show":[119,162],"that":[120,154,163],"substantial":[122],"improvement":[123,148],"was":[124],"obtained":[125],"on":[126,177,185],"search":[128],"optimal":[130],"DTSPN":[134],"over":[135],"current":[136],"works":[137],"literature.":[140],"Numerical":[141],"simulations":[142],"also":[143,161],"exhibit":[144],"significant":[146],"performance":[147],"when":[149,187],"compared":[150,188],"classical":[152],"solutions":[153],"use":[155],"Alternating":[157],"Algorithm,":[158],"they":[160],"our":[164],"outperforms":[166],"random":[168],"sampling":[169],"based":[170],"technique.":[171],"present":[174],"reduction":[176],"final":[179],"length":[181],"about":[183],"25%":[184],"average":[186],"generated":[191],"by":[192],"aforementioned":[194],"methods.":[195]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}