IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v67y2017i1d10.1007_s10898-016-0444-2.html
   My bibliography  Save this article

A diverse human learning optimization algorithm

Author

Listed:
  • Ling Wang

    (Shanghai University)

  • Lu An

    (Shanghai University)

  • Jiaxing Pi

    (University of Florida)

  • Minrui Fei

    (Shanghai University)

  • Panos M. Pardalos

    (University of Florida)

Abstract

Human Learning Optimization is a simple but efficient meta-heuristic algorithm in which three learning operators, i.e. the random learning operator, the individual learning operator, and the social learning operator, are developed to efficiently search the optimal solution by imitating the learning mechanisms of human beings. However, HLO assumes that all the individuals possess the same learning ability, which is not true in a real human population as the IQ scores of humans, one of the most important indices of the learning ability of humans, follow Gaussian distribution and increase with the development of society and technology. Inspired by this fact, this paper proposes a Diverse Human Learning Optimization algorithm (DHLO), into which the Gaussian distribution and dynamic adjusting strategy are introduced. By adopting a set of Gaussian distributed parameter values instead of a constant to diversify the learning abilities of DHLO, the robustness of the algorithm is strengthened. In addition, by cooperating with the dynamic updating operation, DHLO can adjust to better parameter values and consequently enhances the global search ability of the algorithm. Finally, DHLO is applied to tackle the CEC05 benchmark functions as well as knapsack problems, and its performance is compared with the standard HLO as well as the other eight meta-heuristics, i.e. the Binary Differential Evolution, Simplified Binary Artificial Fish Swarm Algorithm, Adaptive Binary Harmony Search, Binary Gravitational Search Algorithms, Binary Bat Algorithms, Binary Artificial Bee Colony, Bi-Velocity Discrete Particle Swarm Optimization, and Modified Binary Particle Swarm Optimization. The experimental results show that the presented DHLO outperforms the other algorithms in terms of search accuracy and scalability.

Suggested Citation

  • Ling Wang & Lu An & Jiaxing Pi & Minrui Fei & Panos M. Pardalos, 2017. "A diverse human learning optimization algorithm," Journal of Global Optimization, Springer, vol. 67(1), pages 283-323, January.
  • Handle: RePEc:spr:jglopt:v:67:y:2017:i:1:d:10.1007_s10898-016-0444-2
    DOI: 10.1007/s10898-016-0444-2
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-016-0444-2
    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/s10898-016-0444-2?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. Bahriye Akay, 2013. "Synchronous and asynchronous Pareto-based multi-objective Artificial Bee Colony algorithms," Journal of Global Optimization, Springer, vol. 57(2), pages 415-445, October.
    2. Hyoungjin Kim & Meng-Sing Liou, 2013. "New fitness sharing approach for multi-objective genetic algorithms," Journal of Global Optimization, Springer, vol. 55(3), pages 579-595, March.
    3. Ana Rocha & M. Costa & Edite Fernandes, 2014. "A filter-based artificial fish swarm algorithm for constrained global optimization: theoretical and practical issues," Journal of Global Optimization, Springer, vol. 60(2), pages 239-263, October.
    4. Massimiliano Kaucic, 2013. "A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization," Journal of Global Optimization, Springer, vol. 55(1), pages 165-188, January.
    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. Altay, Elif Varol & Alatas, Bilal, 2020. "Randomness as source for inspiring solution search methods: Music based approaches," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 537(C).
    2. Aujla, Navneet & Frost, Helen & Guthrie, Bruce & Hanratty, Barbara & Kaner, Eileen & O'Donnell, Amy & Ogden, Margaret E. & Pain, Helen G. & Shenkin, Susan D. & Mercer, Stewart W., 2023. "A comparative overview of health and social care policy for older people in England and Scotland, United Kingdom (UK)," Health Policy, Elsevier, vol. 132(C).

    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. Jonathan Oesterle & Lionel Amodeo & Farouk Yalaoui, 2019. "A comparative study of Multi-Objective Algorithms for the Assembly Line Balancing and Equipment Selection Problem under consideration of Product Design Alternatives," Journal of Intelligent Manufacturing, Springer, vol. 30(3), pages 1021-1046, March.
    2. Xiang, Yi & Zhou, Yuren & Liu, Hailin, 2015. "An elitism based multi-objective artificial bee colony algorithm," European Journal of Operational Research, Elsevier, vol. 245(1), pages 168-193.
    3. Xiaobing Yu & Yiqun Lu & Mei Cai, 2018. "Evaluating agro-meteorological disaster of China based on differential evolution algorithm and VIKOR," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 94(2), pages 671-687, November.
    4. Tapas Si & Ramkinkar Dutta, 2019. "Partial Opposition-Based Particle Swarm Optimizer in Artificial Neural Network Training for Medical Data Classification," International Journal of Information Technology & Decision Making (IJITDM), World Scientific Publishing Co. Pte. Ltd., vol. 18(05), pages 1717-1750, September.
    5. M. Joseane F. G. MacĂȘdo & Elizabeth W. Karas & M. Fernanda P. Costa & Ana Maria A. C. Rocha, 2020. "Filter-based stochastic algorithm for global optimization," Journal of Global Optimization, Springer, vol. 77(4), pages 777-805, August.
    6. C. J. Price & M. Reale & B. L. Robertson, 2016. "Stochastic filter methods for generally constrained global optimization," Journal of Global Optimization, Springer, vol. 65(3), pages 441-456, July.
    7. M. Fernanda P. Costa & Ana Maria A. C. Rocha & Edite M. G. P. Fernandes, 2018. "Filter-based DIRECT method for constrained global optimization," Journal of Global Optimization, Springer, vol. 71(3), pages 517-536, July.
    8. Morteza Ahandani & Mohammad-Taghi Vakil-Baghmisheh & Mohammad Talebi, 2014. "Hybridizing local search algorithms for global optimization," Computational Optimization and Applications, Springer, vol. 59(3), pages 725-748, December.
    9. Nien-Che Yang & Danish Mehmood & Kai-You Lai, 2021. "Multi-Objective Artificial Bee Colony Algorithm with Minimum Manhattan Distance for Passive Power Filter Optimization Problems," Mathematics, MDPI, vol. 9(24), pages 1-19, December.

    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:jglopt:v:67:y:2017:i:1:d:10.1007_s10898-016-0444-2. 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.