{"id":"https://openalex.org/W4417004043","doi":"https://doi.org/10.1109/tvt.2025.3639763","title":"Scheduling UAV-Based Deliveries With an Approximation Algorithm","display_name":"Scheduling UAV-Based Deliveries With an Approximation Algorithm","publication_year":2025,"publication_date":"2025-12-04","ids":{"openalex":"https://openalex.org/W4417004043","doi":"https://doi.org/10.1109/tvt.2025.3639763"},"language":"en","primary_location":{"id":"doi:10.1109/tvt.2025.3639763","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tvt.2025.3639763","pdf_url":null,"source":{"id":"https://openalex.org/S10936095","display_name":"IEEE Transactions on Vehicular Technology","issn_l":"0018-9545","issn":["0018-9545","1939-9359"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Vehicular Technology","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1109/tvt.2025.3639763","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5092543587","display_name":"Giulio Attenni","orcid":"https://orcid.org/0009-0004-7430-2308"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giulio Attenni","raw_affiliation_strings":["Computer Science Department, Sapienza University of Rome, Rome, Italy"],"raw_orcid":"https://orcid.org/0009-0004-7430-2308","affiliations":[{"raw_affiliation_string":"Computer Science Department, Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014863005","display_name":"Viviana Arrigoni","orcid":"https://orcid.org/0000-0002-1411-9091"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Viviana Arrigoni","raw_affiliation_strings":["Computer Science Department, Sapienza University of Rome, Rome, Italy"],"raw_orcid":"https://orcid.org/0000-0002-1411-9091","affiliations":[{"raw_affiliation_string":"Computer Science Department, Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5099178356","display_name":"Matteo Finelli","orcid":null},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Matteo Finelli","raw_affiliation_strings":["Computer Science Department, Sapienza University of Rome, Rome, Italy"],"raw_orcid":"https://orcid.org/0009-0009-9559-1491","affiliations":[{"raw_affiliation_string":"Computer Science Department, Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081384199","display_name":"Novella Bartolini","orcid":"https://orcid.org/0000-0002-1278-4549"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Novella Bartolini","raw_affiliation_strings":["Computer Science Department, Sapienza University of Rome, Rome, Italy"],"raw_orcid":"https://orcid.org/0000-0002-1278-4549","affiliations":[{"raw_affiliation_string":"Computer Science Department, Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.43380809,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"75","issue":"6","first_page":"9144","last_page":"9156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11133","display_name":"UAV Applications and Optimization","score":0.9882000088691711,"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.9882000088691711,"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.0026000000070780516,"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/T11489","display_name":"Air Traffic Management and Optimization","score":0.0017000000225380063,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/drone","display_name":"Drone","score":0.784600019454956},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6280999779701233},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5825999975204468},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.3871000111103058},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.36800000071525574},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.31049999594688416},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.2962999939918518}],"concepts":[{"id":"https://openalex.org/C59519942","wikidata":"https://www.wikidata.org/wiki/Q650665","display_name":"Drone","level":2,"score":0.784600019454956},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6280999779701233},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6256999969482422},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5825999975204468},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5681999921798706},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.3871000111103058},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3869999945163727},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.36800000071525574},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.33570000529289246},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.33550000190734863},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.31049999594688416},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.2809999883174896},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C116537","wikidata":"https://www.wikidata.org/wiki/Q2169973","display_name":"Service provider","level":3,"score":0.2745000123977661},{"id":"https://openalex.org/C166961238","wikidata":"https://www.wikidata.org/wiki/Q221395","display_name":"Air traffic control","level":2,"score":0.25949999690055847},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2515000104904175},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.250900000333786},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tvt.2025.3639763","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tvt.2025.3639763","pdf_url":null,"source":{"id":"https://openalex.org/S10936095","display_name":"IEEE Transactions on Vehicular Technology","issn_l":"0018-9545","issn":["0018-9545","1939-9359"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Vehicular Technology","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-05429159v1","is_oa":false,"landing_page_url":"https://hal.science/hal-05429159","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Transactions on Vehicular Technology, 2025","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:iris.uniroma1.it:11573/1771749","is_oa":false,"landing_page_url":"https://hdl.handle.net/11573/1771749","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1109/tvt.2025.3639763","is_oa":true,"landing_page_url":"https://doi.org/10.1109/tvt.2025.3639763","pdf_url":null,"source":{"id":"https://openalex.org/S10936095","display_name":"IEEE Transactions on Vehicular Technology","issn_l":"0018-9545","issn":["0018-9545","1939-9359"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Vehicular Technology","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"need":[1],"for":[2,27,92],"environmentally":[3],"conscious":[4],"alternatives":[5],"to":[6,17,34,110,132,211,215,219],"traditional":[7],"road":[8,36],"transport":[9],"is":[10,30],"progressively":[11],"growing":[12],"as":[13,109],"digital":[14],"marketplaces":[15],"continue":[16],"integrate":[18],"more":[19],"deeply":[20],"into":[21],"our":[22,151,155,189],"daily":[23],"lives.":[24],"Employing":[25],"drones":[26,89],"parcel":[28],"delivery":[29,45,56,75,117,166,202,206],"a":[31,73,79,86,129,142,193],"possible":[32],"solution":[33],"mitigating":[35],"traffic":[37],"and":[38,58,119,136,146,169,173,204,213],"pollution.":[39],"Nevertheless,":[40],"designing":[41],"an":[42,121],"efficient":[43,53],"drone":[44,74,105],"system":[46],"comes":[47],"with":[48,60,164,217],"numerous":[49,158],"challenges,":[50],"including":[51,161],"planning":[52],"scheduling":[54,103],"of":[55,82,88,102,115,188],"tasks":[57,118],"coping":[59],"the":[61,100,104,112,116,175,185,197,200,220],"strong":[62],"impact":[63],"that":[64,85,147],"weather":[65],"conditions":[66],"have":[67],"on":[68,78,141],"drones'":[69],"mobility.":[70],"We":[71,98,153],"consider":[72,133],"service":[76,83],"based":[77,140],"distributed":[80],"infrastructure":[81],"stations":[84],"fleet":[87],"can":[90],"use":[91],"battery":[93],"replacement,":[94],"allowing":[95],"long-distance":[96],"deliveries.":[97],"formulate":[99],"problem":[101],"fleet's":[106],"operations":[107],"so":[108],"minimize":[111],"completion":[113,207],"time":[114],"propose":[120],"approximation":[122],"algorithm":[123,127],"called":[124],"REDMAT.":[125],"Our":[126,182],"enables":[128],"straightforward":[130],"extension":[131],"real-time":[134],"demands":[135],"variable":[137,170],"wind":[138,171],"conditions,":[139,172],"thorough":[143],"mathematical":[144],"model,":[145],"we":[148],"simulate":[149,154],"in":[150,196],"experiments.":[152],"solutions":[156],"under":[157],"experimental":[159],"settings,":[160],"dynamic":[162],"scenarios":[163],"online":[165],"demand":[167],"arrivals,":[168],"compare":[174],"achieved":[176],"performance":[177],"against":[178],"other":[179],"existing":[180],"solutions.":[181,222],"experiments":[183],"show":[184],"superior":[186],"efficiency":[187],"algorithm,":[190],"which":[191],"provides":[192],"remarkable":[194],"improvement":[195],"makespan":[198],"(i.e.,":[199],"maximum":[201],"time)":[203],"average":[205],"time,":[208],"respectively":[209],"up":[210,214],"40%":[212],"24.5%":[216],"respect":[218],"state-of-the-art":[221]},"counts_by_year":[],"updated_date":"2026-07-26T07:53:14.480251","created_date":"2025-12-04T00:00:00"}