IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v49y2018i5p1088-1102.html
   My bibliography  Save this article

A new effective operator for the hybrid algorithm for solving global optimisation problems

Author

Listed:
  • Le Anh Duc
  • Kenli Li
  • Tien Trong Nguyen
  • Vu Minh Yen
  • Tung Khac Truong

Abstract

Hybrid algorithms have been recently used to solve complex single-objective optimisation problems. The ultimate goal is to find an optimised global solution by using these algorithms. Based on the existing algorithms (HP_CRO, PSO, RCCRO), this study proposes a new hybrid algorithm called MPC (Mean-PSO-CRO), which utilises a new Mean-Search Operator. By employing this new operator, the proposed algorithm improves the search ability on areas of the solution space that the other operators of previous algorithms do not explore. Specifically, the Mean-Search Operator helps find the better solutions in comparison with other algorithms. Moreover, the authors have proposed two parameters for balancing local and global search and between various types of local search, as well. In addition, three versions of this operator, which use different constraints, are introduced. The experimental results on 23 benchmark functions, which are used in previous works, show that our framework can find better optimal or close-to-optimal solutions with faster convergence speed for most of the benchmark functions, especially the high-dimensional functions. Thus, the proposed algorithm is more effective in solving single-objective optimisation problems than the other existing algorithms.

Suggested Citation

  • Le Anh Duc & Kenli Li & Tien Trong Nguyen & Vu Minh Yen & Tung Khac Truong, 2018. "A new effective operator for the hybrid algorithm for solving global optimisation problems," International Journal of Systems Science, Taylor & Francis Journals, vol. 49(5), pages 1088-1102, April.
  • Handle: RePEc:taf:tsysxx:v:49:y:2018:i:5:p:1088-1102
    DOI: 10.1080/00207721.2018.1432780
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2018.1432780
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/00207721.2018.1432780?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.

    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:taf:tsysxx:v:49:y:2018:i:5:p:1088-1102. 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    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.