Approximation algorithms for drone delivery scheduling with a fixed number of drones
The coordination among drones and ground vehicles for last-mile delivery has gained significant interest in recent years. In this paper, we study multiple drone delivery scheduling problem (MDSP) [1] for last-mile delivery, where we have a set of drones with an identical battery budget and a set of...
Saved in:
| Published in: | Theoretical computer science Vol. 991; p. 114442 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
12.04.2024
|
| Subjects: | |
| ISSN: | 0304-3975 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | The coordination among drones and ground vehicles for last-mile delivery has gained significant interest in recent years. In this paper, we study multiple drone delivery scheduling problem (MDSP) [1] for last-mile delivery, where we have a set of drones with an identical battery budget and a set of delivery locations; along with profit for delivery, cost, and delivery time intervals. The objective of the MDSP is to find conflict-free schedules for each drone such that the total profit gained is maximum subject to the battery constraint of the drones. This paper proposes an optimal pseudo-polynomial algorithm and a fully polynomial time approximation scheme (FPTAS) for the single drone delivery scheduling problem (SDSP). Also, we propose two approximation algorithms of factor 13 for the MDSP with some constraints on the number of drones. We formulate the problem for the heterogeneous case, where the drones have non-identical battery capacities, and propose a 16ρ-approximation algorithm, where ρ is the ratio between the minimum and maximum battery capacity of the drones.
•An optimal pseudo-polynomial algorithm and FPTAS for the single drone delivery scheduling problem is proposed.•Two approximation algorithms for the multiple drone delivery scheduling problem are proposed.•An approximation algorithm for the multiple heterogeneous drone delivery scheduling problem is proposed.•We analyzed the approximation factors of all the aforementioned proposed algorithms and time complexities. |
|---|---|
| AbstractList | The coordination among drones and ground vehicles for last-mile delivery has gained significant interest in recent years. In this paper, we study multiple drone delivery scheduling problem (MDSP) [1] for last-mile delivery, where we have a set of drones with an identical battery budget and a set of delivery locations; along with profit for delivery, cost, and delivery time intervals. The objective of the MDSP is to find conflict-free schedules for each drone such that the total profit gained is maximum subject to the battery constraint of the drones. This paper proposes an optimal pseudo-polynomial algorithm and a fully polynomial time approximation scheme (FPTAS) for the single drone delivery scheduling problem (SDSP). Also, we propose two approximation algorithms of factor 13 for the MDSP with some constraints on the number of drones. We formulate the problem for the heterogeneous case, where the drones have non-identical battery capacities, and propose a 16ρ-approximation algorithm, where ρ is the ratio between the minimum and maximum battery capacity of the drones.
•An optimal pseudo-polynomial algorithm and FPTAS for the single drone delivery scheduling problem is proposed.•Two approximation algorithms for the multiple drone delivery scheduling problem are proposed.•An approximation algorithm for the multiple heterogeneous drone delivery scheduling problem is proposed.•We analyzed the approximation factors of all the aforementioned proposed algorithms and time complexities. |
| ArticleNumber | 114442 |
| Author | Mandal, Partha Sarathi Jana, Saswata |
| Author_xml | – sequence: 1 givenname: Saswata surname: Jana fullname: Jana, Saswata email: saswatajana@iitg.ac.in – sequence: 2 givenname: Partha Sarathi orcidid: 0000-0002-8632-5767 surname: Mandal fullname: Mandal, Partha Sarathi email: psm@iitg.ac.in |
| BookMark | eNp9kL1uwjAUhT1QqUD7AN38Akltx3ESdUKofxJSFzpbiX0NRiFGtqHw9nWbTh24y1nud6TzzdBkcAMg9EBJTgkVj7s8qpAzwnhOKeecTdCUFIRnRVOVt2gWwo6kKysxRevF4eDd2e7baN2A237jvI3bfcDGeax9asYaensCf8FBbUEfezts8Fd6wi029gwaD8d9Bx47MwLhDt2Ytg9w_5dz9PnyvF6-ZauP1_flYpUp1lQxq3lNqW60EGVDO05FaZhQmhGjgAldM6aAm6rslGjKxhSmA86ruiCKMl0IKOaoGnuVdyF4MFLZ-Dsk-tb2khL5I0TuZBIif4TIUUgi6T_y4JMDf7nKPI0MpEknC14GZWFQoK0HFaV29gr9DYlSfgA |
| CitedBy_id | crossref_primary_10_1007_s10586_024_04992_5 crossref_primary_10_1007_s00607_025_01417_y crossref_primary_10_1080_00207543_2025_2496965 |
| Cites_doi | 10.1016/j.trc.2015.03.005 10.1016/j.pmcj.2022.101700 10.1016/j.procs.2019.09.158 10.1504/IJOR.2018.093509 10.22271/chemi.2020.v8.i5d.10529 10.1108/JMTM-03-2019-0099 10.1016/j.trc.2019.11.003 10.1002/net.21847 10.1007/s10846-022-01632-1 10.1007/s00291-020-00607-8 10.3390/drones5030084 10.7155/jgaa.00186 |
| ContentType | Journal Article |
| Copyright | 2024 Elsevier B.V. |
| Copyright_xml | – notice: 2024 Elsevier B.V. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.tcs.2024.114442 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| ExternalDocumentID | 10_1016_j_tcs_2024_114442 S0304397524000574 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 0SF 123 1B1 1RT 1~. 1~5 4.4 457 4G. 5VS 7-5 71M 8P~ 9JN AABNK AACTN AAEDW AAFTH AAIKJ AAKOC AALRI AAOAW AAQFI AAXKI AAXUO AAYFN ABAOU ABBOA ABJNI ABMAC ABVKL ACDAQ ACGFS ACRLP ACZNC ADBBV ADEZE AEBSH AEKER AENEX AFJKZ AFKWA AFTJW AGUBO AGYEJ AHHHB AHZHX AIALX AIEXJ AIKHN AITUG AJOXV AKRWK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ARUGR AXJTR BKOJK BLXMC CS3 DU5 EBS EFJIC EO8 EO9 EP2 EP3 F5P FDB FEDTE FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HVGLF IHE IXB J1W KOM LG9 M26 M41 MHUIS MO0 N9A O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 RIG ROL RPZ SCC SDF SDG SES SEW SPC SPCBC SSV SSW T5K TN5 WH7 YNT ZMT ~G- 29Q 9DU AAEDT AAQXK AATTM AAYWO AAYXX ABDPE ABEFU ABFNM ABWVN ABXDB ACLOT ACNNM ACRPL ACVFH ADCNI ADMUD ADNMO ADVLN AEIPS AEUPX AEXQZ AFPUW AGHFR AGQPQ AIGII AIIUN AKBMS AKYEP ANKPU APXCP ASPBG AVWKF AZFZN CITATION EFKBS EFLBG EJD FGOYB G-2 HZ~ R2- SSZ TAE WUQ ZY4 ~HD |
| ID | FETCH-LOGICAL-c297t-84811d9d66591b4165f26cd20fce26d822ce4f75bc6959f3fbe447830c12d36e3 |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001186842500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0304-3975 |
| IngestDate | Tue Nov 18 22:32:56 EST 2025 Sat Nov 29 05:49:20 EST 2025 Sat Nov 23 15:55:07 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Drone delivery scheduling Complexity analysis Approximation algorithm Optimization Last-mile delivery system |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c297t-84811d9d66591b4165f26cd20fce26d822ce4f75bc6959f3fbe447830c12d36e3 |
| ORCID | 0000-0002-8632-5767 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_tcs_2024_114442 crossref_primary_10_1016_j_tcs_2024_114442 elsevier_sciencedirect_doi_10_1016_j_tcs_2024_114442 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-04-12 |
| PublicationDateYYYYMMDD | 2024-04-12 |
| PublicationDate_xml | – month: 04 year: 2024 text: 2024-04-12 day: 12 |
| PublicationDecade | 2020 |
| PublicationTitle | Theoretical computer science |
| PublicationYear | 2024 |
| Publisher | Elsevier B.V |
| Publisher_xml | – name: Elsevier B.V |
| References | Kardasz, Doskocz (br0060) Jan 2016; 6 Vazirani (br0190) 2001 Boysen, Briskorn, Fedtke, Schwerdfeger (br0160) 2018; 72 Boysen, Fedtke, Schwerdfeger (br0030) 2021; 43 Jana, Mandal (br0170) 2023 Daknama, Kraus (br0140) 2017 Maghazei, Netland (br0080) Sep 2019; 31 Murray, Chu (br0090) 2015; 54 West (br0210) 1996 Crişan, Nechita (br0130) 2019; 159 Chekuri, Khanna (br0120) 2000 Basnet (br0180) 2018; 32 Betti Sorbelli, Corò, Das, Palazzetti, Pinotti (br0100) 2022; 87 Dutta, Goswami (br0040) 2020; 8 Betti Sorbelli, Corò, Das, Palazzetti, Pinotti (br0010) 2022 Jana, Mandal (br0020) 2023 Park, Mirjalili, Côté, Lim (br0050) Jun 2022; 105 Pferschy, Schauer (br0110) 2009; 13 Sibanda, Mutanga, Chimonyo, Clulow, Shoko, Mazvimavi, Dube, Mabhaudhi (br0070) 2021; 5 Murray, Raj (br0150) 2020; 110 Kleinberg, Tardos (br0200) 2006 Kleinberg (10.1016/j.tcs.2024.114442_br0200) 2006 Crişan (10.1016/j.tcs.2024.114442_br0130) 2019; 159 Basnet (10.1016/j.tcs.2024.114442_br0180) 2018; 32 Kardasz (10.1016/j.tcs.2024.114442_br0060) 2016; 6 Daknama (10.1016/j.tcs.2024.114442_br0140) Murray (10.1016/j.tcs.2024.114442_br0090) 2015; 54 Park (10.1016/j.tcs.2024.114442_br0050) 2022; 105 Murray (10.1016/j.tcs.2024.114442_br0150) 2020; 110 Maghazei (10.1016/j.tcs.2024.114442_br0080) 2019; 31 Betti Sorbelli (10.1016/j.tcs.2024.114442_br0100) 2022; 87 Boysen (10.1016/j.tcs.2024.114442_br0160) 2018; 72 Pferschy (10.1016/j.tcs.2024.114442_br0110) 2009; 13 Dutta (10.1016/j.tcs.2024.114442_br0040) 2020; 8 Boysen (10.1016/j.tcs.2024.114442_br0030) 2021; 43 Jana (10.1016/j.tcs.2024.114442_br0170) 2023 Vazirani (10.1016/j.tcs.2024.114442_br0190) 2001 West (10.1016/j.tcs.2024.114442_br0210) 1996 Betti Sorbelli (10.1016/j.tcs.2024.114442_br0010) 2022 Sibanda (10.1016/j.tcs.2024.114442_br0070) 2021; 5 Jana (10.1016/j.tcs.2024.114442_br0020) 2023 Chekuri (10.1016/j.tcs.2024.114442_br0120) 2000 |
| References_xml | – volume: 6 year: Jan 2016 ident: br0060 article-title: Drones and possibilities of their using publication-title: J. Civ. Environ. Eng. – volume: 5 year: 2021 ident: br0070 article-title: Application of drone technologies in surface water resources monitoring and assessment: A systematic review of progress, challenges, and opportunities in the global south publication-title: Drones – volume: 13 start-page: 233 year: 2009 end-page: 249 ident: br0110 article-title: The knapsack problem with conflict graphs publication-title: J. Graph Algorithms Appl. – volume: 110 start-page: 368 year: 2020 end-page: 398 ident: br0150 article-title: The multiple flying sidekicks traveling salesman problem: Parcel delivery with multiple drones publication-title: Transp. Res., Part C, Emerg. Technol. – start-page: 31 year: 2022 end-page: 39 ident: br0010 article-title: Greedy algorithms for scheduling package delivery with multiple drones publication-title: ICDCN 2022 – volume: 159 start-page: 38 year: 2019 end-page: 47 ident: br0130 article-title: On a cooperative truck-and-drone delivery system publication-title: Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 23rd International Conference KES2019 – year: 1996 ident: br0210 article-title: Introduction to Graph Theory – volume: 54 start-page: 86 year: 2015 end-page: 109 ident: br0090 article-title: The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery publication-title: Transp. Res., Part C, Emerg. Technol. – year: 2001 ident: br0190 article-title: Approximation Algorithms – volume: 105 year: Jun 2022 ident: br0050 article-title: Scheduling diagnostic testing kit deliveries with the mothership and drone routing problem publication-title: J. Intell. Robot. Syst. – volume: 31 start-page: 1237 year: Sep 2019 end-page: 1259 ident: br0080 article-title: Drones in manufacturing: Exploring opportunities for research and practice publication-title: Int. J. Manuf. Technol. Manag. – start-page: 125 year: 2023 end-page: 140 ident: br0020 article-title: Approximation algorithms for drone delivery scheduling problem publication-title: Networked Systems – volume: 8 start-page: 181 year: 2020 end-page: 187 ident: br0040 article-title: Application of drone in agriculture: A review publication-title: Int. J. Chem. Stud. – volume: 32 start-page: 514 year: 2018 end-page: 525 ident: br0180 article-title: Heuristics for the multiple knapsack problem with conflicts publication-title: Int. J. Oper. Res. – volume: 43 start-page: 1 year: 2021 end-page: 58 ident: br0030 article-title: Last-mile delivery concepts: a survey from an operational research perspective publication-title: OR Spektrum – year: 2006 ident: br0200 article-title: Algorithm Design – volume: 87 year: 2022 ident: br0100 article-title: On the scheduling of conflictual deliveries in a last-mile delivery scenario with truck-carried drones publication-title: Pervasive Mob. Comput. – start-page: 213 year: 2000 end-page: 222 ident: br0120 article-title: A PTAS for the multiple knapsack problem publication-title: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms – volume: 72 start-page: 506 year: 2018 end-page: 527 ident: br0160 article-title: Drone delivery from trucks: Drone scheduling for given truck routes publication-title: Networks – year: 2017 ident: br0140 article-title: Vehicle routing with drones – start-page: 262 year: 2023 end-page: 269 ident: br0170 article-title: Approximation algorithms for drone delivery packing problem publication-title: Proceedings of the 24th International Conference on Distributed Computing and Networking – start-page: 31 year: 2022 ident: 10.1016/j.tcs.2024.114442_br0010 article-title: Greedy algorithms for scheduling package delivery with multiple drones – volume: 54 start-page: 86 year: 2015 ident: 10.1016/j.tcs.2024.114442_br0090 article-title: The flying sidekick traveling salesman problem: Optimization of drone-assisted parcel delivery publication-title: Transp. Res., Part C, Emerg. Technol. doi: 10.1016/j.trc.2015.03.005 – volume: 87 year: 2022 ident: 10.1016/j.tcs.2024.114442_br0100 article-title: On the scheduling of conflictual deliveries in a last-mile delivery scenario with truck-carried drones publication-title: Pervasive Mob. Comput. doi: 10.1016/j.pmcj.2022.101700 – start-page: 213 year: 2000 ident: 10.1016/j.tcs.2024.114442_br0120 article-title: A PTAS for the multiple knapsack problem – volume: 159 start-page: 38 year: 2019 ident: 10.1016/j.tcs.2024.114442_br0130 article-title: On a cooperative truck-and-drone delivery system publication-title: Proc. Comput. Sci. doi: 10.1016/j.procs.2019.09.158 – volume: 32 start-page: 514 year: 2018 ident: 10.1016/j.tcs.2024.114442_br0180 article-title: Heuristics for the multiple knapsack problem with conflicts publication-title: Int. J. Oper. Res. doi: 10.1504/IJOR.2018.093509 – volume: 8 start-page: 181 year: 2020 ident: 10.1016/j.tcs.2024.114442_br0040 article-title: Application of drone in agriculture: A review publication-title: Int. J. Chem. Stud. doi: 10.22271/chemi.2020.v8.i5d.10529 – volume: 31 start-page: 1237 year: 2019 ident: 10.1016/j.tcs.2024.114442_br0080 article-title: Drones in manufacturing: Exploring opportunities for research and practice publication-title: Int. J. Manuf. Technol. Manag. doi: 10.1108/JMTM-03-2019-0099 – volume: 110 start-page: 368 year: 2020 ident: 10.1016/j.tcs.2024.114442_br0150 article-title: The multiple flying sidekicks traveling salesman problem: Parcel delivery with multiple drones publication-title: Transp. Res., Part C, Emerg. Technol. doi: 10.1016/j.trc.2019.11.003 – volume: 72 start-page: 506 year: 2018 ident: 10.1016/j.tcs.2024.114442_br0160 article-title: Drone delivery from trucks: Drone scheduling for given truck routes publication-title: Networks doi: 10.1002/net.21847 – volume: 105 issue: 2 year: 2022 ident: 10.1016/j.tcs.2024.114442_br0050 article-title: Scheduling diagnostic testing kit deliveries with the mothership and drone routing problem publication-title: J. Intell. Robot. Syst. doi: 10.1007/s10846-022-01632-1 – year: 2006 ident: 10.1016/j.tcs.2024.114442_br0200 – volume: 43 start-page: 1 year: 2021 ident: 10.1016/j.tcs.2024.114442_br0030 article-title: Last-mile delivery concepts: a survey from an operational research perspective publication-title: OR Spektrum doi: 10.1007/s00291-020-00607-8 – start-page: 262 year: 2023 ident: 10.1016/j.tcs.2024.114442_br0170 article-title: Approximation algorithms for drone delivery packing problem – year: 2001 ident: 10.1016/j.tcs.2024.114442_br0190 – year: 1996 ident: 10.1016/j.tcs.2024.114442_br0210 – volume: 6 year: 2016 ident: 10.1016/j.tcs.2024.114442_br0060 article-title: Drones and possibilities of their using publication-title: J. Civ. Environ. Eng. – start-page: 125 year: 2023 ident: 10.1016/j.tcs.2024.114442_br0020 article-title: Approximation algorithms for drone delivery scheduling problem – ident: 10.1016/j.tcs.2024.114442_br0140 – volume: 5 issue: 3 year: 2021 ident: 10.1016/j.tcs.2024.114442_br0070 article-title: Application of drone technologies in surface water resources monitoring and assessment: A systematic review of progress, challenges, and opportunities in the global south publication-title: Drones doi: 10.3390/drones5030084 – volume: 13 start-page: 233 year: 2009 ident: 10.1016/j.tcs.2024.114442_br0110 article-title: The knapsack problem with conflict graphs publication-title: J. Graph Algorithms Appl. doi: 10.7155/jgaa.00186 |
| SSID | ssj0000576 |
| Score | 2.4333549 |
| Snippet | The coordination among drones and ground vehicles for last-mile delivery has gained significant interest in recent years. In this paper, we study multiple... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 114442 |
| SubjectTerms | Approximation algorithm Complexity analysis Drone delivery scheduling Last-mile delivery system Optimization |
| Title | Approximation algorithms for drone delivery scheduling with a fixed number of drones |
| URI | https://dx.doi.org/10.1016/j.tcs.2024.114442 |
| Volume | 991 |
| WOSCitedRecordID | wos001186842500001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: ScienceDirect database issn: 0304-3975 databaseCode: AIEXJ dateStart: 20211207 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://www.sciencedirect.com omitProxy: false ssIdentifier: ssj0000576 providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Pb9MwFLZg4wAHfgwmtgHygRNRUOM4cX2s0CZAYkJakXqLnOeYdqrSqQms--_3_CNJ2QABEpeoimon8ufY33t-732EvIZEgsi1jpMMxjGH0sSyRMNVSVbaI8W8TI0TmxCnp-PZTH4Own-NkxMQdT3ebOTFf4Ua7yHYNnX2L-DuO8Ub-BtBxyvCjtc_An5iq4RvFj4lMVLLryu0_-e-7kKk16vaZkotbTjGVYSmLW41y94hqyKz2LiAAKsTYomka9BsU9jpVuojBE2IKGykfTyO8qlmZ6q59Mlvwe1da-U1k_HF58r5o9v5Ytv1wFzESjIYqrdzYnwelj1rkV4PpVtjpZfkurVee9fB-dsWbOl0xm3pYu7Lbd0og31m-7Xd2qBXJJn8LtllIpO4ku1OPhzPPg77byb8CXV4j-4s20X13XjQz9nIFsOYPiYPg2lAJx7SJ-ROVe-RR53sBg2r8B558Kkvtds8JdMf8KYD3hTxpg4-2uFNB7ypxZsq6vCmHm-6Mr5B84x8OTmevnsfB6mMGJgUbWxFERItdZ5nMimRZGeG5aDZyEDFco0sECpuRFZCLjNpUlNWnItxOoKE6TSv0n2yU2P_zwmFkZLIKkFWquJa4LdsNPLiXGjQApQ6IKNuyAoIdeStnMmy6AIGzwsc5cKOcuFH-YC86Ztc-CIqv_sz73AowuT17K7ASfPrZof_1uyI3B9m9guy066_VS_JPfjeLpr1qzC1rgGju4OT |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Approximation+algorithms+for+drone+delivery+scheduling+with+a+fixed+number+of+drones&rft.jtitle=Theoretical+computer+science&rft.au=Jana%2C+Saswata&rft.au=Mandal%2C+Partha+Sarathi&rft.date=2024-04-12&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.volume=991&rft_id=info:doi/10.1016%2Fj.tcs.2024.114442&rft.externalDocID=S0304397524000574 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon |