IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/7759968.html
   My bibliography  Save this article

The Opposition-Based Learning Parameter Adjusting Harmony Search Algorithm Research on Radars Optimal Deployment

Author

Listed:
  • Yujuan Cui
  • Hang He
  • Wenhan Dong
  • Liguo Liu
  • Haibo Liu
  • Diego Oliva

Abstract

In order to solve the problem of maximizing the utilization of resources through reasonable deployment under limited resources, this paper studies from two aspects: one is to establish the mathematical model of maximum coverage of space detection, and the other is to improve the harmony algorithm. The exploration performance and convergence performance of the harmony search algorithm are analyzed theoretically, and the more general formulas of exploration performance and convergence performance are proved. Based on theoretical analysis, the algorithm called opposition-based learning parameter adjusting harmony search is proposed. By using the algorithm to test the functions of different properties, the value range of key control parameters of the algorithm are given. The proposed algorithm is applied to optimize the problem of radar deployment. This paper takes a certain area of the Shandong Peninsula as the deployment scope. The simulation results show that the proposed algorithm is effective and practical. Although there is a large amount of calculation, it provides ideas and ways for other problems, such as the site selection of new observation and communication post, the deployment of maneuvering radar stations, and the track planning of fleet.

Suggested Citation

  • Yujuan Cui & Hang He & Wenhan Dong & Liguo Liu & Haibo Liu & Diego Oliva, 2022. "The Opposition-Based Learning Parameter Adjusting Harmony Search Algorithm Research on Radars Optimal Deployment," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-30, June.
  • Handle: RePEc:hin:jnlmpe:7759968
    DOI: 10.1155/2022/7759968
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/mpe/2022/7759968.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/mpe/2022/7759968.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2022/7759968?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
    ---><---

    More about this item

    Statistics

    Access and download statistics

    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:hin:jnlmpe:7759968. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.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.