{"id":"https://openalex.org/W3033429289","doi":"https://doi.org/10.1109/itsc45102.2020.9294568","title":"Extending the Multiple Traveling Salesman Problem for Scheduling a Fleet of Drones Performing Monitoring Missions","display_name":"Extending the Multiple Traveling Salesman Problem for Scheduling a Fleet of Drones Performing Monitoring Missions","publication_year":2020,"publication_date":"2020-09-20","ids":{"openalex":"https://openalex.org/W3033429289","doi":"https://doi.org/10.1109/itsc45102.2020.9294568","mag":"3033429289"},"language":"en","primary_location":{"id":"doi:10.1109/itsc45102.2020.9294568","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc45102.2020.9294568","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2006.01473","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Emmanouil S. Rigas","orcid":null},"institutions":[{"id":"https://openalex.org/I34771391","display_name":"University of Cyprus","ror":"https://ror.org/02qjrjx09","country_code":"CY","type":"education","lineage":["https://openalex.org/I34771391"]}],"countries":["CY"],"is_corresponding":false,"raw_author_name":"Emmanouil S. Rigas","raw_affiliation_strings":["University of Cyprus"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Cyprus","institution_ids":["https://openalex.org/I34771391"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Panayiotis Kolios","orcid":null},"institutions":[{"id":"https://openalex.org/I34771391","display_name":"University of Cyprus","ror":"https://ror.org/02qjrjx09","country_code":"CY","type":"education","lineage":["https://openalex.org/I34771391"]}],"countries":["CY"],"is_corresponding":false,"raw_author_name":"Panayiotis Kolios","raw_affiliation_strings":["University of Cyprus"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Cyprus","institution_ids":["https://openalex.org/I34771391"]}]},{"author_position":"last","author":{"id":null,"display_name":"Georgios Ellinas","orcid":null},"institutions":[{"id":"https://openalex.org/I34771391","display_name":"University of Cyprus","ror":"https://ror.org/02qjrjx09","country_code":"CY","type":"education","lineage":["https://openalex.org/I34771391"]}],"countries":["CY"],"is_corresponding":false,"raw_author_name":"Georgios Ellinas","raw_affiliation_strings":["University of Cyprus"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Cyprus","institution_ids":["https://openalex.org/I34771391"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I34771391"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11133","display_name":"UAV Applications and Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11133","display_name":"UAV Applications and Optimization","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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.9990000128746033,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.7574999928474426},{"id":"https://openalex.org/keywords/drone","display_name":"Drone","score":0.718999981880188},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6373999714851379},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6241000294685364},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4936999976634979},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.461899995803833},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4271000027656555},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.40310001373291016},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4000999927520752}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.7574999928474426},{"id":"https://openalex.org/C59519942","wikidata":"https://www.wikidata.org/wiki/Q650665","display_name":"Drone","level":2,"score":0.718999981880188},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6373999714851379},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6241000294685364},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5784000158309937},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5659999847412109},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4936999976634979},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.461899995803833},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4271000027656555},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.40310001373291016},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4000999927520752},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.398499995470047},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.3774999976158142},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3671000003814697},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.34860000014305115},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.33410000801086426},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.32679998874664307},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.3125999867916107},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.3073999881744385},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.29580000042915344},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.2858000099658966},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.27559998631477356},{"id":"https://openalex.org/C168956720","wikidata":"https://www.wikidata.org/wiki/Q3123181","display_name":"Column generation","level":2,"score":0.26739999651908875},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.25200000405311584}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/itsc45102.2020.9294568","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itsc45102.2020.9294568","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 23rd International Conference on Intelligent Transportation Systems (ITSC)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2006.01473","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2006.01473","pdf_url":"https://arxiv.org/pdf/2006.01473","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:zenodo.org:4446725","is_oa":true,"landing_page_url":"https://zenodo.org/record/4446725","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"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":"","raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2006.01473","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2006.01473","pdf_url":"https://arxiv.org/pdf/2006.01473","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1518672027","https://openalex.org/W1984463987","https://openalex.org/W2025567744","https://openalex.org/W2049287714","https://openalex.org/W2050819731","https://openalex.org/W2111563176","https://openalex.org/W2597364644","https://openalex.org/W2809586641","https://openalex.org/W2810640960","https://openalex.org/W2907963738","https://openalex.org/W2910105989","https://openalex.org/W3137141854","https://openalex.org/W4213147678","https://openalex.org/W6729356381"],"related_works":[],"abstract_inverted_index":{"In":[0,121],"this":[1],"paper":[2],"we":[3],"schedule":[4],"the":[5,17,35,52,62,76,79,91,96,129,143],"travel":[6],"path":[7],"of":[8,11,34,54,64,142,155],"a":[9,14,58,106,114,122],"set":[10],"drones":[12,156],"across":[13],"graph":[15],"where":[16],"nodes":[18],"need":[19],"to":[20,67,74,151],"be":[21,45],"visited":[22],"multiple":[23,37],"times":[24],"at":[25,140],"pre-defined":[26],"points":[27],"in":[28,47,57],"time.":[29],"This":[30],"is":[31,81,93,109,126,137],"an":[32,84],"extension":[33],"well-known":[36],"traveling":[38],"salesman":[39],"problem.":[40],"The":[41],"proposed":[42,111],"formulation":[43],"can":[44,147],"applied":[46],"several":[48],"domains":[49],"such":[50],"as":[51,83,135],"monitoring":[53,63],"traffic":[55],"flows":[56],"transportation":[59],"network,":[60],"or":[61],"remote":[65],"locations":[66],"assist":[68],"search":[69,119],"and":[70,157],"rescue":[71],"missions.":[72],"Aiming":[73],"find":[75],"optimal":[77,97],"schedule,":[78],"problem":[80,92],"formulated":[82],"Integer":[85],"Linear":[86],"Program":[87],"(ILP).":[88],"Given":[89],"that":[90,112,128],"highly":[94],"combinatorial,":[95],"solution":[98],"scales":[99],"only":[100],"for":[101],"small":[102],"sized":[103],"problems.":[104],"Thus,":[105],"greedy":[107,130],"algorithm":[108,131],"also":[110],"uses":[113],"one-step":[115],"look":[116],"ahead":[117],"heuristic":[118],"mechanism.":[120],"detailed":[123],"evaluation,":[124],"it":[125,136,146],"observed":[127],"has":[132],"near-optimal":[133],"performance":[134],"on":[138],"average":[139],"92.06%":[141],"optimal,":[144],"while":[145],"potentially":[148],"scale":[149],"up":[150],"settings":[152],"with":[153],"hundreds":[154],"locations.":[158]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2020-06-12T00:00:00"}