Purpose: The purpose of this paper is to propose an enhanced elephant herding optimization (EEHO) algorithm by improving the exploration phase to overcome the fast-unjustified convergence toward the origin of the native EHO. The exploration and exploitation of the proposed EEHO are achieved by updating both clan and separation operators.Design/methodology/approach: The original EHO shows fast unjustified convergence toward the origin specifically, a constant function is used as a benchmark for inspecting the biased convergence of evolutionary algorithms. Furthermore, the star discrepancy measure is adopted to quantify the quality of the exploration phase of evolutionary algorithms in general.Findings: In experiments, EEHO has shown a better performance of convergence rate compared with the original EHO. Reasons behind this performance are: EEHO proposes a more exploitative search method than the one used in EHO and the balanced control of exploration and exploitation based on fixing clan updating operator and separating operator. Operatorγis added to EEHO assists to escape from local optima, which commonly exist in the search space. The proposed EEHO controls the convergence rate and the random walk independently. Eventually, the quantitative and qualitative results revealed that the proposed EEHO outperforms the original EHO.Research limitations/implications: Therefore, the pros and cons are reported as follows: pros of EEHO compared to EHO – 1) unbiased exploration of the whole search space thanks to the proposed update operator that fixed the unjustified convergence of the EHO toward the origin and the proposed separating operator that fixed the tendency of EHO to introduce new elephants at the boundary of the search space; and 2) the ability to control exploration–exploitation trade-off by independently controverting the convergence rate and the random walk using different parameters – cons EEHO compared to EHO: 1) suitable values for three parameters (rather than two only) have to be found to use EEHO.Originality/value: As the original EHO shows fast unjustified convergence toward the origin specifically, the search method adopted in EEHO is more exploitative than the one used in EHO because of the balanced control of exploration and exploitation based on fixing clan updating operator and separating operator. Further, the star discrepancy measure is adopted to quantify the quality of exploration phase of evolutionary algorithms in general. Operatorγthat added EEHO allows the successive local and global searching (exploration and exploitation) and helps escaping from local minima that commonly exist in the search space.
In this paper, we introduce a computational framework for studying dynamical systems. This framework can be used to prove the existence of certain behaviour in a given dynamical system at any finite (limited) resolution automatically. The proposed framework is based on approximating the phase space topology of a given dynamical system at a finite resolution by adaptively partitioning it at rational points. Dyadic rationals and partition elements with disjoint interiors are employed to build a transparent partition that enables constructing an ideal combinatorial representation of a given dynamical system. Moreover, we introduce a new algorithmic strategy that overcomes the dependence on initial conditions, supports deriving ubiquitous conclusions, enables finding bifurcation points up to certain precision, and (most importantly) is computationally efficient. A set of simple yet powerful dynamic graph algorithms that were developed to support the new strategy are described in details. As an application, invariant sets and bifurcation points of the logistic map were computed.
1 January 2014 in Lecture Notes in Computer Science
A polygon with n nodes can be divided into two subpolygons by an internal diagonal through node n. Splitting the polygon along diagonal and diagonal , results in mirror images. Obviously, there are pairs of these reflectively symmetrical images. The influence of the observed symmetry on polygon triangulation is studied. The central result of this research is the construction of an efficient algorithm used for generating convex polygon triangulations in minimal time and without generating repeat triangulations. The proposed algorithm uses the diagonal values of the Catalan triangle to avoid duplicate triangulations with negligible computational costs and provides significant speedups compared to known methods.
1 January 2018 in Applicable Analysis and Discrete Mathematics
Finding all possible triangulations of convex polygon is a highly time and memory space consuming combinatorial problem. Therefore, it is very important to develop algorithms for generating triangulations as efficiently as possible. This paper presents a new method for generating triangulations of a convex polygon, called Orbiting triangle method (OTM). The method is based on using the set of (n-1)-gon triangulations during the set of n-gon triangulations creation. The main feature of the OTM algorithm is the use of the Catalan triangle to identify valid triangulations, so that the algorithm spends almost no time to eliminate duplicates. In this way, the method possesses small complexity and saves the computational time required for detecting and eliminating duplicates.