A bi-objective optimisation model for the drone scheduling problem in island delivery

被引:0
|
作者
Yang, Ying [1 ]
Liu, Jiaxin [2 ]
Wang, Shuaian [1 ]
机构
[1] Hong Kong Polytech Univ, Dept Logist & Maritime Studies, Kowloon, Hong Kong 999077, Peoples R China
[2] Tsinghua Univ, Shenzhen Int Grad Sch, Dept Logist & Transportat, Shenzhen, Peoples R China
关键词
Island delivery; drone scheduling problem; bi-objective optimisation model; energy consumption; non-dominated sorting genetic algorithm II; augmented epsilon-constraint; VEHICLE-ROUTING PROBLEM; TRAVELING SALESMAN PROBLEM; EPSILON-CONSTRAINT METHOD; NSGA-II; ALGORITHM;
D O I
10.1080/00207543.2025.2496965
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Drone-assisted parcel delivery to remote islands is increasingly replacing traditional methods, offering improved efficiency and enhanced service reliability. This paper addresses the drone scheduling problem in island delivery (DSP-ID) by optimising drone delivery routes. In particular, we first introduce a bi-objective mixed-integer linear programming model that concurrently optimises delivery time and energy consumption. To address the model, both a heuristic non-dominated sorting genetic algorithm II (NSGA-II) and an exact augmented epsilon-constraint method are developed. The efficacy and robustness of the proposed model and algorithms are evaluated through experiments across various scales. Results indicate that both algorithms yield high-quality solutions for DSP-ID in small-scale scenarios. However, as the problem size expands, the performance of the augmented epsilon-constraint method wanes under time constraints, whereas the NSGA-II consistently delivers high-quality solutions. Additionally, we provide decision-makers with actionable insights for selecting the most effective drone delivery routes.
引用
收藏
页数:22
相关论文
共 50 条
  • [21] Bi-objective green ride-sharing problem: Model and exact method
    Yu, Yang
    Wu, Yuting
    Wang, Junwei
    INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2019, 208 : 472 - 482
  • [22] Solving a bi-objective unrelated parallel batch processing machines scheduling problem: A comparison study
    Shahidi-Zadeh, B.
    Tavakkoli-Moghaddam, R.
    Taheri-Moghadam, A.
    Rastgar, I.
    COMPUTERS & OPERATIONS RESEARCH, 2017, 88 : 71 - 90
  • [23] Bi-objective inventory routing problem with uncertain demand: a data-driven robust optimisation approach
    Feng, Yuqiang
    Che, Ada
    Lei, Jieyu
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2024,
  • [24] Bi-objective multi-resource scheduling problem for emergency relief operations
    Bodaghi, Behrooz
    Palaneeswaran, Ekambaram
    Abbasi, Babak
    PRODUCTION PLANNING & CONTROL, 2018, 29 (14) : 1191 - 1206
  • [25] Green parallel machines scheduling problem: A bi-objective model and a heuristic algorithm to obtain Pareto frontier
    Zandi, Arash
    Ramezanian, Reza
    Monplaisir, Leslie
    JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2020, 71 (06) : 967 - 978
  • [26] A Bi-objective optimization model for the last train timetabling problem
    Ning, Jia
    Peng, Qiyuan
    Zhu, Yongqiu
    Jiang, Yu
    Nielsen, Otto Anker
    JOURNAL OF RAIL TRANSPORT PLANNING & MANAGEMENT, 2022, 23
  • [27] A clustering search metaheuristic for the bi-objective flexible job shop scheduling problem
    Altoe, Wagner A. S.
    Bissoli, Dayan de C.
    Mauri, Geraldo R.
    Amaral, Andre R. S.
    2018 XLIV LATIN AMERICAN COMPUTER CONFERENCE (CLEI 2018), 2018, : 158 - 166
  • [28] A bi-objective robust model for berth allocation scheduling under uncertainty
    Xiang Xi
    Liu Changchun
    Miao Lixin
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2017, 106 : 294 - 319
  • [29] Heuristics for the Bi-Objective Diversity Problem
    Colmenar, J. M.
    Marti, R.
    Duarte, A.
    EXPERT SYSTEMS WITH APPLICATIONS, 2018, 108 : 193 - 205
  • [30] Bi-objective scheduling on two dedicated processors
    Kacem, Adel
    Dammak, Abdelaziz
    EUROPEAN JOURNAL OF INDUSTRIAL ENGINEERING, 2019, 13 (05) : 681 - 700