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

Improved Hypercube Optimisation Search Algorithm for Optimisation of High Dimensional Functions

Author

Listed:
  • Mustafa Tunay
  • Rahib Abiyev
  • Guoqiang Wang

Abstract

This paper proposes a stochastic search algorithm called improved hypercube optimisation search (HOS+) to find a better solution for optimisation problems. This algorithm is an improvement of the hypercube optimisation algorithm that includes initialization, displacement-shrink and searching area modules. The proposed algorithm has a new random parameters (RP) module that uses two control parameters in order to prevent premature convergence and slow finishing and improve the search accuracy considerable. Many optimisation problems can sometimes cause getting stuck into an interior local optimal solution. HOS+ algorithm that uses a random module can solve this problem and find the global optimal solution. A set of experiments were done in order to test the performance of the algorithm. At first, the performance of the proposed algorithm is tested using low and high dimensional benchmark functions. The simulation results indicated good convergence and much better performance at the lowest of iterations. The HOS+ algorithm is compared with other meta heuristic algorithms using the same benchmark functions on different dimensions. The comparative results indicated the superiority of the HOS+ algorithm in terms of obtaining the best optimal value and accelerating convergence solutions.

Suggested Citation

  • Mustafa Tunay & Rahib Abiyev & Guoqiang Wang, 2022. "Improved Hypercube Optimisation Search Algorithm for Optimisation of High Dimensional Functions," Mathematical Problems in Engineering, Hindawi, vol. 2022, pages 1-13, April.
  • Handle: RePEc:hin:jnlmpe:6872162
    DOI: 10.1155/2022/6872162
    as

    Download full text from publisher

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

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

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