{"id":"https://openalex.org/W3037970841","doi":"https://doi.org/10.3390/a13060153","title":"Novel Graph Model for Solving Collision-Free Multiple-Vehicle Traveling Salesman Problem Using Ant Colony Optimization","display_name":"Novel Graph Model for Solving Collision-Free Multiple-Vehicle Traveling Salesman Problem Using Ant Colony Optimization","publication_year":2020,"publication_date":"2020-06-26","ids":{"openalex":"https://openalex.org/W3037970841","doi":"https://doi.org/10.3390/a13060153","mag":"3037970841"},"language":"en","primary_location":{"id":"doi:10.3390/a13060153","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13060153","pdf_url":"https://www.mdpi.com/1999-4893/13/6/153/pdf?version=1593515821","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.mdpi.com/1999-4893/13/6/153/pdf?version=1593515821","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001622651","display_name":"Anugrah K. Pamosoaji","orcid":"https://orcid.org/0000-0002-1676-3980"},"institutions":[{"id":"https://openalex.org/I4210114028","display_name":"Atma Jaya University Yogyakarta","ror":"https://ror.org/01gmyr425","country_code":"ID","type":"education","lineage":["https://openalex.org/I4210114028"]}],"countries":["ID"],"is_corresponding":true,"raw_author_name":"Anugrah K. Pamosoaji","raw_affiliation_strings":["Fakultas Teknologi Industri, Universitas Atma Jaya Yogyakarta, Yogyakarta 55281, Indonesia"],"affiliations":[{"raw_affiliation_string":"Fakultas Teknologi Industri, Universitas Atma Jaya Yogyakarta, Yogyakarta 55281, Indonesia","institution_ids":["https://openalex.org/I4210114028"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072619734","display_name":"Djoko Budiyanto Setyohadi","orcid":"https://orcid.org/0000-0003-0797-2083"},"institutions":[{"id":"https://openalex.org/I4210114028","display_name":"Atma Jaya University Yogyakarta","ror":"https://ror.org/01gmyr425","country_code":"ID","type":"education","lineage":["https://openalex.org/I4210114028"]}],"countries":["ID"],"is_corresponding":false,"raw_author_name":"Djoko Budiyanto Setyohadi","raw_affiliation_strings":["Magister Informatika, Universitas Atma Jaya Yogyakarta, Yogyakarta 55281, Indonesia"],"affiliations":[{"raw_affiliation_string":"Magister Informatika, Universitas Atma Jaya Yogyakarta, Yogyakarta 55281, Indonesia","institution_ids":["https://openalex.org/I4210114028"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001622651"],"corresponding_institution_ids":["https://openalex.org/I4210114028"],"apc_list":{"value":1400,"currency":"CHF","value_usd":1515},"apc_paid":{"value":1400,"currency":"CHF","value_usd":1515},"fwci":0.5862,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.68652954,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"13","issue":"6","first_page":"153","last_page":"153"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9973999857902527,"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/T11942","display_name":"Transportation and Mobility Innovations","score":0.9803000092506409,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.9067039489746094},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6556342840194702},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.6402339935302734},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6168846487998962},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5387061834335327},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.49933528900146484},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.4980654716491699},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.4936843812465668},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4433631896972656},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4126276969909668},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3460199534893036},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2714442312717438},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.25075775384902954},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09148713946342468}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9067039489746094},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6556342840194702},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.6402339935302734},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6168846487998962},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5387061834335327},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.49933528900146484},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4980654716491699},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.4936843812465668},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4433631896972656},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4126276969909668},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3460199534893036},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2714442312717438},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25075775384902954},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09148713946342468},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.3390/a13060153","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13060153","pdf_url":"https://www.mdpi.com/1999-4893/13/6/153/pdf?version=1593515821","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:e-journal.uajy.ac.id:21805","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400229","display_name":"UAJY Repository (University of Southampton)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I43439940","host_organization_name":"University of Southampton","host_organization_lineage":["https://openalex.org/I43439940"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:doaj.org/article:3d62f5afb48d49c9b48ebf1ac5f0447a","is_oa":true,"landing_page_url":"https://doaj.org/article/3d62f5afb48d49c9b48ebf1ac5f0447a","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-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms, Vol 13, Iss 6, p 153 (2020)","raw_type":"article"},{"id":"pmh:oai:mdpi.com:/1999-4893/13/6/153/","is_oa":true,"landing_page_url":"http://dx.doi.org/10.3390/a13060153","pdf_url":null,"source":{"id":"https://openalex.org/S4306400947","display_name":"MDPI (MDPI AG)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210097602","host_organization_name":"Multidisciplinary Digital Publishing Institute (Switzerland)","host_organization_lineage":["https://openalex.org/I4210097602"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithms","raw_type":"Text"}],"best_oa_location":{"id":"doi:10.3390/a13060153","is_oa":true,"landing_page_url":"https://doi.org/10.3390/a13060153","pdf_url":"https://www.mdpi.com/1999-4893/13/6/153/pdf?version=1593515821","source":{"id":"https://openalex.org/S190629608","display_name":"Algorithms","issn_l":"1999-4893","issn":["1999-4893"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310310987","host_organization_name":"Multidisciplinary Digital Publishing Institute","host_organization_lineage":["https://openalex.org/P4310310987"],"host_organization_lineage_names":["Multidisciplinary Digital Publishing Institute"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithms","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W3037970841.pdf"},"referenced_works_count":39,"referenced_works":["https://openalex.org/W653441760","https://openalex.org/W1208385249","https://openalex.org/W1551740464","https://openalex.org/W1975913439","https://openalex.org/W1978354018","https://openalex.org/W1979743043","https://openalex.org/W2009803313","https://openalex.org/W2043636596","https://openalex.org/W2050819731","https://openalex.org/W2095546721","https://openalex.org/W2097639646","https://openalex.org/W2104635975","https://openalex.org/W2122575721","https://openalex.org/W2154929945","https://openalex.org/W2204983333","https://openalex.org/W2265063340","https://openalex.org/W2461269952","https://openalex.org/W2606715786","https://openalex.org/W2735772617","https://openalex.org/W2777790503","https://openalex.org/W2790268363","https://openalex.org/W2802408425","https://openalex.org/W2810664546","https://openalex.org/W2889773273","https://openalex.org/W2890540194","https://openalex.org/W2905301715","https://openalex.org/W2921200099","https://openalex.org/W2925063426","https://openalex.org/W2927317032","https://openalex.org/W2927874028","https://openalex.org/W2963575907","https://openalex.org/W2986020234","https://openalex.org/W2987374881","https://openalex.org/W2996626223","https://openalex.org/W3000498189","https://openalex.org/W3003532379","https://openalex.org/W3007476780","https://openalex.org/W3011436878","https://openalex.org/W4294358747"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W4376138746","https://openalex.org/W2359992618","https://openalex.org/W2171568915","https://openalex.org/W1595757466","https://openalex.org/W2361554335","https://openalex.org/W4200179302","https://openalex.org/W8433631","https://openalex.org/W4220987199","https://openalex.org/W2362402143"],"abstract_inverted_index":{"In":[0,17],"this":[1,18],"paper,":[2],"a":[3,20,84,173],"novel":[4,85],"graph":[5,31,87,117,188],"model":[6,88],"to":[7,56,80,121,124],"figure":[8],"Collision-Free":[9],"Multiple":[10],"Traveling":[11,43],"Salesman":[12,44],"Problem":[13,45],"(CFMTSP)":[14],"is":[15,55,112,141],"proposed.":[16,113],"problem,":[19],"group":[21],"of":[22,68,99,108,163,177,182,186],"vehicles":[23,111,183],"start":[24],"from":[25],"different":[26],"nodes":[27,100],"in":[28,37],"an":[29],"undirected":[30],"and":[32,83,101,130,179,184],"must":[33],"visit":[34],"each":[35,61,81],"node":[36],"the":[38,41,65,69,97,106,110,144,151,155,164,168,175,180,187],"graph,":[39],"following":[40],"well-known":[42],"(TSP)":[46],"fashion":[47],"without":[48],"any":[49],"collision.":[50],"This":[51,72,92],"paper\u2019s":[52],"main":[53,156],"objective":[54],"obtain":[57],"free-collision":[58],"routes":[59,129],"for":[60,132],"vehicle":[62],"while":[63],"minimizing":[64],"traveling":[66],"time":[67,171],"slowest":[70],"vehicle.":[71],"problem":[73],"can":[74,89,153],"be":[75,119,122],"approached":[76],"by":[77],"applying":[78],"speed":[79,107],"vehicle,":[82],"augmented":[86,116,146],"perform":[90,125],"it.":[91],"approach":[93],"accommodates":[94],"not":[95],"only":[96],"position":[98],"inter-node":[102],"distances,":[103],"but":[104],"also":[105,190],"all":[109,133],"The":[114],"proposed":[115,145],"should":[118],"able":[120],"used":[123,142],"optimal":[126],"trajectories,":[127],"i.e.,":[128,167],"speeds,":[131],"vehicles.":[134],"An":[135],"ant":[136],"colony":[137],"optimization":[138],"(ACO)":[139],"algorithm":[140,152],"on":[143,172],"graph.":[147],"Simulations":[148],"show":[149],"that":[150],"satisfy":[154],"objective.":[157],"Considered":[158],"factors,":[159],"such":[160],"as":[161],"limitation":[162],"mission":[165],"successfulness,":[166],"inter-vehicle":[169],"arrival":[170],"node,":[174],"number":[176],"vehicles,":[178],"numbers":[181],"edges":[185],"are":[189],"discussed.":[191]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-01-15T23:16:33.117629","created_date":"2025-10-10T00:00:00"}