{"id":"https://openalex.org/W1998777403","doi":"https://doi.org/10.1080/019697202753306497","title":"AN APPROACH TO TRIP- AND ROUTE-PLANNING PROBLEMS","display_name":"AN APPROACH TO TRIP- AND ROUTE-PLANNING PROBLEMS","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1998777403","doi":"https://doi.org/10.1080/019697202753306497","mag":"1998777403"},"language":"en","primary_location":{"id":"doi:10.1080/019697202753306497","is_oa":false,"landing_page_url":"https://doi.org/10.1080/019697202753306497","pdf_url":null,"source":{"id":"https://openalex.org/S117436046","display_name":"Cybernetics & Systems","issn_l":"0196-9722","issn":["0196-9722","1087-6553"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cybernetics and Systems","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/A5043549411","display_name":"Georgii Khachaturov","orcid":null},"institutions":[{"id":"https://openalex.org/I200362191","display_name":"Universidad Aut\u00f3noma Metropolitana","ror":"https://ror.org/02kta5139","country_code":"MX","type":"education","lineage":["https://openalex.org/I200362191"]}],"countries":["MX"],"is_corresponding":true,"raw_author_name":"Georgii Khachaturov","raw_affiliation_strings":["Departamento de Sistemas, Universidad Aut\u00f3noma Metropolitana-Azc., Av. San Pablo 180, Col. ReynosaTamaulipas, C.P. 02200, D.F.,Mexico"],"affiliations":[{"raw_affiliation_string":"Departamento de Sistemas, Universidad Aut\u00f3noma Metropolitana-Azc., Av. San Pablo 180, Col. ReynosaTamaulipas, C.P. 02200, D.F.,Mexico","institution_ids":["https://openalex.org/I200362191"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5043549411"],"corresponding_institution_ids":["https://openalex.org/I200362191"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.10650249,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"33","issue":"1","first_page":"43","last_page":"67"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T12288","display_name":"Optimization and Search Problems","score":0.9987000226974487,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.6832932233810425},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6713502407073975},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.603261411190033},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5616057515144348},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5273193717002869},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4871666133403778},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4257645010948181},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3420245051383972},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.274331271648407},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.233521968126297},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.19417688250541687}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6832932233810425},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6713502407073975},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.603261411190033},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5616057515144348},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5273193717002869},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4871666133403778},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4257645010948181},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3420245051383972},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.274331271648407},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.233521968126297},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.19417688250541687},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/019697202753306497","is_oa":false,"landing_page_url":"https://doi.org/10.1080/019697202753306497","pdf_url":null,"source":{"id":"https://openalex.org/S117436046","display_name":"Cybernetics & Systems","issn_l":"0196-9722","issn":["0196-9722","1087-6553"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cybernetics and Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W29820467","https://openalex.org/W1516027685","https://openalex.org/W1526396946","https://openalex.org/W2084224084","https://openalex.org/W2169528473","https://openalex.org/W2914443076","https://openalex.org/W6630827198"],"related_works":["https://openalex.org/W3049557657","https://openalex.org/W3150915502","https://openalex.org/W2111158727","https://openalex.org/W2024668666","https://openalex.org/W3118505512","https://openalex.org/W2132826624","https://openalex.org/W4281385974","https://openalex.org/W2112736381","https://openalex.org/W1990568201","https://openalex.org/W2045659398"],"abstract_inverted_index":{"Some":[0],"practical":[1],"planning":[2,145,159],"problems":[3],"can":[4],"be":[5],"interpreted":[6],"as":[7,16],"set-to-set":[8,73,127],"shortest":[9,20],"path":[10,21],"problem":[11,42,142,157],"(":[12],"spp":[13,50,74,128],"),":[14],"i.e.,":[15],"search":[17,45],"of":[18,25,31,39,46,78,93,126,143,158,165,169,172],"a":[19,32,41,62,69,103,120,147,152,160],"between":[22],"two":[23,136],"sets":[24],"nodes,":[26],"A":[27,36,81],"and":[28,82,155],"B":[29,83],",":[30,84],"graph":[33,96,100],"G":[34,64,107],".":[35,65,98,108,129],"straightforward":[37],"reduction":[38],"such":[40],"to":[43,72,119],"the":[44,55,76,141,156],"solutions":[47],"for":[48,61,75,113,123,133,146],"point-to-point":[49],"s":[51],"is":[52,58],"impractical":[53],"because":[54],"computational":[56],"complexity":[57],"too":[59],"high":[60],"huge":[63],"This":[66],"paper":[67],"presents":[68],"new":[70],"approach":[71,117],"case":[77],"not":[79],"arbitrary":[80],"but":[85],"those":[86],"which":[87],"are":[88,138],"represented":[89],"by":[90,163],"some":[91,110],"nodes":[92],"an":[94],"additional":[95],"T":[97,101],"The":[99],"simulates":[102],"\"geographic":[104],"system\"":[105],"on":[106],"Under":[109],"assumptions":[111],"natural":[112],"many":[114],"applications,":[115],"this":[116,124,134],"leads":[118],"competitive":[121],"algorithm":[122],"kind":[125],"As":[130],"prospective":[131],"areas":[132],"technique,":[135],"applications":[137],"discussed":[139],"-":[140],"route":[144],"visually":[148],"guided":[149],"robot":[150],"in":[151],"static":[153],"environment,":[154],"fastest":[161],"trip":[162],"means":[164],"all":[166,170],"available":[167],"timetables":[168],"kinds":[171],"transport.":[173]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}