IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v82y2023i2d10.1007_s11235-022-00970-7.html
   My bibliography  Save this article

An improved parallel processing-based strawberry optimization algorithm for drone placement

Author

Listed:
  • Tamer Ahmed Farrag

    (MISR Higher Institute for Engineering and Technology)

  • M. A. Farag

    (Menoufia University
    Scientific Research Group in Egypt (SRGE))

  • Rizk M. Rizk-Allah

    (Menoufia University
    Scientific Research Group in Egypt (SRGE))

  • Aboul Ella Hassanien

    (Cairo University
    Scientific Research Group in Egypt (SRGE))

  • Mostafa A. Elhosseini

    (Mansoura University
    Taibah University)

Abstract

It is challenging to place drones in the best possible locations to monitor all sensor targets while keeping the number of drones to a minimum. Strawberry optimization (SBA) has been demonstrated to be more effective and superior to current methods in evaluating engineering functions in various engineering problems. Because the SBA is a new method, it has never been used to solve problems involving optimal drone placement. SBA is preferred for optimizing drone placement in this study due to its promising results for nonlinear, mixed, and multimodal problems. Based on the references listed below, no study has investigated the need to develop a parallelized strategy version. Several studies have been conducted on the use of drones for coverage. However, no optimization algorithms have been evaluated regarding time complexity or execution time. Despite what has been said thus far, no study has looked into the significance of a systematic framework for assessing drone coverage techniques using test suits. An optimized drone placement algorithm based on strawberry optimization is presented in the paper. The strawberry optimization algorithm will solve the drone placement problem through parallelization. In addition, the authors deploy test suits that vary in size from small to large. The dataset consists of four categories with three problems each. Results indicate that strawberry optimizers outperform Genetic algorithms (GA) and particle swarm optimization algorithms (PSO) in the number of drones, convergence, and computation time. Furthermore, the proposed approach achieves the best solution in a finite number of steps. In small-scale problems, the performance of all algorithms is convergent. As the size of the data set increases, the superiority of Strawberry optimization algorithms becomes evident. Overall, Strawberry comes out on top for eleven out of twelve comparisons.

Suggested Citation

  • Tamer Ahmed Farrag & M. A. Farag & Rizk M. Rizk-Allah & Aboul Ella Hassanien & Mostafa A. Elhosseini, 2023. "An improved parallel processing-based strawberry optimization algorithm for drone placement," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 82(2), pages 245-275, February.
  • Handle: RePEc:spr:telsys:v:82:y:2023:i:2:d:10.1007_s11235-022-00970-7
    DOI: 10.1007/s11235-022-00970-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-022-00970-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11235-022-00970-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Taifei Zhao & Hua Wang & Qianwen Ma, 2020. "The coverage method of unmanned aerial vehicle mounted base station sensor network based on relative distance," International Journal of Distributed Sensor Networks, , vol. 16(5), pages 15501477209, May.
    Full references (including those not matched with items on IDEAS)

    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.

      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:spr:telsys:v:82:y:2023:i:2:d:10.1007_s11235-022-00970-7. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.