Next Article in Journal
Informative Nature and Nonlinearity of Lagged Poincaré Plots Indices in Analysis of Heart Rate Variability
Next Article in Special Issue
Using Entropy in Web Usage Data Preprocessing
Previous Article in Journal
Analysis of Entropy Generation in Flow of Methanol-Based Nanofluid in a Sinusoidal Wavy Channel
Article Menu
Issue 10 (October) cover image

Export Article

Open AccessArticle
Entropy 2017, 19(10), 533;

Cross Entropy Method Based Hybridization of Dynamic Group Optimization Algorithm

Department of Computer and Information Science, University of Macau, Macau, China
Department of Information Technology, Techno India College of Technology, Kalkata 700156, India
School of Computer Science & Engineering, University of New South Wales, Sydney 00098G, Australia
School of Computer Science, Lakehead University, Thunder Bay, ON P7B 5E1, Canada
Author to whom correspondence should be addressed.
Received: 7 August 2017 / Revised: 21 September 2017 / Accepted: 29 September 2017 / Published: 9 October 2017
(This article belongs to the Special Issue Entropy-based Data Mining)
Full-Text   |   PDF [793 KB, uploaded 9 October 2017]   |  


Recently, a new algorithm named dynamic group optimization (DGO) has been proposed, which lends itself strongly to exploration and exploitation. Although DGO has demonstrated its efficacy in comparison to other classical optimization algorithms, DGO has two computational drawbacks. The first one is related to the two mutation operators of DGO, where they may decrease the diversity of the population, limiting the search ability. The second one is the homogeneity of the updated population information which is selected only from the companions in the same group. It may result in premature convergence and deteriorate the mutation operators. In order to deal with these two problems in this paper, a new hybridized algorithm is proposed, which combines the dynamic group optimization algorithm with the cross entropy method. The cross entropy method takes advantage of sampling the problem space by generating candidate solutions using the distribution, then it updates the distribution based on the better candidate solution discovered. The cross entropy operator does not only enlarge the promising search area, but it also guarantees that the new solution is taken from all the surrounding useful information into consideration. The proposed algorithm is tested on 23 up-to-date benchmark functions; the experimental results verify that the proposed algorithm over the other contemporary population-based swarming algorithms is more effective and efficient. View Full-Text
Keywords: entropy-based; meta-heuristics; dynamic group optimization algorithm entropy-based; meta-heuristics; dynamic group optimization algorithm

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Tang, R.; Fong, S.; Dey, N.; Wong, R.K.; Mohammed, S. Cross Entropy Method Based Hybridization of Dynamic Group Optimization Algorithm. Entropy 2017, 19, 533.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Entropy EISSN 1099-4300 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top