IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v14y2022i5p2555-d756218.html
   My bibliography  Save this article

Research on Multi Unmanned Aerial Vehicles Emergency Task Planning Method Based on Discrete Multi-Objective TLBO Algorithm

Author

Listed:
  • Miao Tang

    (College of Civil Aviation, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China)

  • Minghua Hu

    (College of Civil Aviation, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China)

  • Honghai Zhang

    (College of Civil Aviation, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China)

  • Long Zhou

    (College of Civil Aviation, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
    Nanjing Intelligent Aviation Research Institute Co., Ltd., Nanjing 210007, China)

Abstract

The outbreak of unexpected events such as floods and geological disasters often produces a large number of emergency material requirements, and when common logistics methods are often ineffective, emergency logistics unmanned aerial vehicles (UAVs) become an important means. How to rationally plan multiple UAVs to quickly complete the emergency logistics tasks in many disaster-stricken areas has become an urgent problem to be solved. In this paper, an optimization model is established with the goal of minimizing the task completion time and the penalty cost of advance/delay, and a discrete multi-objective teaching–learning-based optimization (DMOTLBO) algorithm is proposed. The Pareto frontier approximation problem is transformed into a set of single objective sub-problems by the decomposition mechanism of the algorithm, and each sub-problem is solved by the improved discrete TLBO algorithm. According to the characteristics of the problem, TLBO algorithm is improved by discretization, and an individual update method is constructed based on probability fusion of various mutation evolution operators. At the same time, variable neighborhood descent search is introduced to enhance the local search ability. Based on the multi-level comparative experiment, the improvement measures and effectiveness of DMOTLBO are verified. Finally, combined with specific case analysis, the practicability and efficiency of the DMOTLBO algorithm in solving the multi-objective emergency logistics task planning problem of multiple UAVs are further verified.

Suggested Citation

  • Miao Tang & Minghua Hu & Honghai Zhang & Long Zhou, 2022. "Research on Multi Unmanned Aerial Vehicles Emergency Task Planning Method Based on Discrete Multi-Objective TLBO Algorithm," Sustainability, MDPI, vol. 14(5), pages 1-21, February.
    • Handle: RePEc:gam:jsusta:v:14:y:2022:i:5:p:2555-:d:756218
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/14/5/2555/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/14/5/2555/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Shih-Wei Lin & Kuo-Ching Ying, 2015. "A multi-point simulated annealing heuristic for solving multiple objective unrelated parallel machine scheduling problems," International Journal of Production Research, Taylor & Francis Journals, vol. 53(4), pages 1065-1076, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Dagui Liu & Weiqing Wang & Huie Zhang & Wei Shi & Caiqing Bai & Huimin Zhang, 2023. "Day-Ahead and Intra-Day Optimal Scheduling Considering Wind Power Forecasting Errors," Sustainability, MDPI, vol. 15(14), pages 1-17, July.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Norelhouda Sekkal & Fayçal Belkaid, 0. "A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-37.
    2. Wang, Haibo & Alidaee, Bahram, 2019. "Effective heuristic for large-scale unrelated parallel machines scheduling problems," Omega, Elsevier, vol. 83(C), pages 261-274.
    3. Norelhouda Sekkal & Fayçal Belkaid, 2020. "A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints," Journal of Combinatorial Optimization, Springer, vol. 40(3), pages 660-696, October.
    4. Rui Zhang, 2017. "Sustainable Scheduling of Cloth Production Processes by Multi-Objective Genetic Algorithm with Tabu-Enhanced Local Search," Sustainability, MDPI, vol. 9(10), pages 1-26, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jsusta:v:14:y:2022:i:5:p:2555-:d:756218. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.