Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2022 Apr 30:2022:5699472.
doi: 10.1155/2022/5699472. eCollection 2022.

Differential Human Learning Optimization Algorithm

Affiliations

Differential Human Learning Optimization Algorithm

Pinggai Zhang et al. Comput Intell Neurosci. .

Abstract

Human Learning Optimization (HLO) is an efficient metaheuristic algorithm in which three learning operators, i.e., the random learning operator, the individual learning operator, and the social learning operator, are developed to search for optima by mimicking the learning behaviors of humans. In fact, people not only learn from global optimization but also learn from the best solution of other individuals in the real life, and the operators of Differential Evolution are updated based on the optima of other individuals. Inspired by these facts, this paper proposes two novel differential human learning optimization algorithms (DEHLOs), into which the Differential Evolution strategy is introduced to enhance the optimization ability of the algorithm. And the two optimization algorithms, based on improving the HLO from individual and population, are named DEHLO1 and DEHLO2, respectively. The multidimensional knapsack problems are adopted as benchmark problems to validate the performance of DEHLOs, and the results are compared with the standard HLO and Modified Binary Differential Evolution (MBDE) as well as other state-of-the-art metaheuristics. The experimental results demonstrate that the developed DEHLOs significantly outperform other algorithms and the DEHLO2 achieves the best overall performance on various problems.

PubMed Disclaimer

Conflict of interest statement

The authors declare that they have no conflicts of interest.

Figures

Figure 1
Figure 1
The flowchart of DEHLO1.
Figure 2
Figure 2
The flowchart of DEHLO2.
Figure 3
Figure 3
The convergence curves of the MKP (maximum generation = 5000).
Algorithm 1
Algorithm 1
Pseudocode of HLO.

Similar articles

Cited by

References

    1. Elsawy M. M. R., Lanteri S., Duvigneau R., Fan J. A., Genevet P. Numerical optimization methods for Metasurfaces. Laser & Photonics Reviews . 2020;14(10) doi: 10.1002/lpor.201900445.1900445 - DOI
    1. Dokeroglu T., Sevinc E., Kucukyilmaz T., Cosar A. A survey on new generation metaheuristic algorithms. Computers & Industrial Engineering . 2019;137 doi: 10.1016/j.cie.2019.106040.106040 - DOI
    1. Hansen P., Mladenović N., Moreno Pérez J. A. Variable neighbourhood search: methods and applications. Annals of Operations Research . 2010;175(1):367–407. doi: 10.1007/s10479-009-0657-6. - DOI
    1. Holland J. H. Genetic algorithms. Scientific American . 1992;267(1):66–72. doi: 10.1038/scientificamerican0792-66. - DOI
    1. Kennedy J., Eberhart R. Particle swarm optimization. Proceedings of the ICNN’95-international conference on neural networks; August 1995; Perth, Australia. IEEE; pp. 1942–1948.

LinkOut - more resources