A population-based optimization method using Newton fractal

Department of Mathematical SciencesMetaheuristic is a general procedure to draw an agreement in a group based on the decision making of each individual beyond heuristic. For last decade, there have been many attempts to develop metaheuristic methods based on swarm intelligence to solve global optimization such as particle swarm optimizer, ant colony optimizer, firefly optimizer. These methods are mostly stochastic and independent on specific problems. Since metaheuristic methods based on swarm intelligence require no central coordination (or minimal, if any), they are especially well-applicable to those problems which have distributed or parallel structures. Each individual follows few simple rules, keeping the searching cost at a decent level. Despite its simplicity, the methods often yield a fast approximation in good precision, compared to conventional methods. Exploration and exploitation are two important features that we need to consider to find a global optimum in a high dimensional domain, especially when prior information is not given. Exploration is to investigate the unknown space without using the information from history to find undiscovered optimum. Exploitation is to trace the neighborhood of the current best to improve it using the information from history. Because these two concepts are at opposite ends of spectrum, the tradeoff significantly affects the performance at the limited cost of search. In this work, we develop a chaos-based metaheuristic method, ???Newton Particle Optimization(NPO)???, to solve global optimization problems. The method is based on the Newton method which is a well-established mathematical root-finding procedure. It actively utilizes the chaotic nature of the Newton method to place a proper balance between exploration and exploitation. While most current population-based methods adopt stochastic effects to maximize exploration, they often suffer from weak exploitation. In addition, stochastic methods generally show poor reproducing ability and premature convergence. It has been argued that an alternative approach using chaos may mitigate such disadvantages. The unpredictability of chaos is correspondent with the randomness of stochastic methods. Chaos-based methods are deterministic and therefore easy to reproduce the results with less memory. It has been shown that chaos avoids local optimum better than stochastic methods and buffers the premature convergence issue. Newton method is deterministic but shows chaotic movements near the roots. It is such complexity that enables the particles to search the space for global optimization. We initialize the particle???s position randomly at first and choose the ???leading particles??? to attract other particles near them. We can make a polynomial function whose roots are those leading particles, called ???a guiding function???. Then we update the positions of particles using the guiding function by Newton method. Since the roots are not updated by Newton method, the leading particles survive after update. For diverse movements of particles, we use modified newton method, which has a coefficient $m$ in the variation of movements for each particle. Efficiency in local search is closely related to the value of m which determines the convergence rate of the Newton method. We can control the balance between exploration and exploitation by choice of leading particles. It is interesting that selection of excellent particles as leading particles not always results in the best result. Including mediocre particles in the roots of guiding function maintains the diversity of particles in position. Though diversity seems to be inefficient at first, those particles contribute to the exploration for global search finally. We study the conditions for the convergence of NPO. NPO enjoys the well-established analysis of the Newton method. This contrasts with other ???nature-inspired??? algorithms which have often been criticized for lack of rigorous mathematical ground. We compare the results of NPO with those of two popular metaheuristic methods, particle swarm optimizer(PSO) and firefly optimizer(FO). Though it has been shown that there are no such algorithms superior to all problems by no free lunch theorem, that is why the researchers are concerned about adaptable global optimizer for specific problems. NPO shows good performance to CEC 2013 competition test problems comparing to PSO and FO.ope

Artificial Immune Systems - Models, algorithms and applications

Copyright © 2010 Academic Research Publishing Agency.This article has been made available through the Brunel Open Access Publishing Fund.Artificial Immune Systems (AIS) are computational paradigms that belong to the computational intelligence family and are inspired by the biological immune system. During the past decade, they have attracted a lot of interest from researchers aiming to develop immune-based models and techniques to solve complex computational or engineering problems. This work presents a survey of existing AIS models and algorithms with a focus on the last five years.This article is available through the Brunel Open Access Publishing Fun

Recoverable DTN Routing based on a Relay of Cyclic Message-Ferries on a MSQ Network

An interrelation between a topological design of network and efficient algorithm on it is important for its applications to communication or transportation systems. In this paper, we propose a design principle for a reliable routing in a store-carry-forward manner based on autonomously moving message-ferries on a special structure of fractal-like network, which consists of a self-similar tiling of equilateral triangles. As a collective adaptive mechanism, the routing is realized by a relay of cyclic message-ferries corresponded to a concatenation of the triangle cycles and using some good properties of the network structure. It is recoverable for local accidents in the hierarchical network structure. Moreover, the design principle is theoretically supported with a calculation method for the optimal service rates of message-ferries derived from a tandem queue model for stochastic processes on a chain of edges in the network. These results obtained from a combination of complex network science and computer science will be useful for developing a resilient network system.Comment: 6 pages, 12 figures, The 3rd Workshop on the FoCAS(Fundamentals of Collective Adaptive Systems) at The 9th IEEE International Conference on SASO(Self-Adaptive and Self-Organizing systems), Boston, USA, Sept.21, 201

Finding optimal reactive power dispatch solutions by using a novel improved stochastic fractal search optimization algorithm

In this paper, a novel improved Stochastic Fractal Search optimization algorithm (ISFSOA) is proposed for finding effective solutions of a complex optimal reactive power dispatch (ORPD) problem with consideration of all constraints in transmission power network. Three different objectives consisting of total power loss (TPL), total voltage deviation (TVD) and voltage stabilization enhancement index are independently optimized by running the proposed ISFSOA and standard Stochastic Fractal Search optimization algorithm (SFSOA). The potential search of the proposed ISFSOA can be highly improved since diffusion process of SFSOA is modified. Compared to SFSOA, the proposed method can explore large search zones and exploit local search zones effectively based on the comparison of solution quality. One standard IEEE 30-bus system with three study cases is employed for testing the proposed method and compared to other so far applied methods. For each study case, the proposed method together with SFSOA are run fifty run and three main results consisting of the best, mean and standard deviation fitness function are compared. The indication is that the proposed method can find more promising solutions for the three cases and its search ability is always more stable than those of SFSOA. The comparison with other methods also give the same evaluation that the proposed method can be superior to almost all compared methods. As a result, it can conclude that the proposed modification is really appropriate for SFSOA in dealing with ORPD problem and the method can be used for other engineering optimization problems

Optic nerve head segmentation

Reliable and efficient optic disk localization and segmentation are important tasks in automated retinal screening. General-purpose edge detection algorithms often fail to segment the optic disk due to fuzzy boundaries, inconsistent image contrast or missing edge features. This paper presents an algorithm for the localization and segmentation of the optic nerve head boundary in low-resolution images (about 20 /spl mu//pixel). Optic disk localization is achieved using specialized template matching, and segmentation by a deformable contour model. The latter uses a global elliptical model and a local deformable model with variable edge-strength dependent stiffness. The algorithm is evaluated against a randomly selected database of 100 images from a diabetic screening programme. Ten images were classified as unusable; the others were of variable quality. The localization algorithm succeeded on all bar one usable image; the contour estimation algorithm was qualitatively assessed by an ophthalmologist as having Excellent-Fair performance in 83% of cases, and performs well even on blurred image

Numerical validation of a population balance model describing cement paste rheology

Rheology control is essential during the period in which cement and concrete pastes are encountered in the fresh state, due to the fact that it directly affects workability, initial placement and the structural performance of the hardened material. Optimizations of clinker formulations and reductions in cement-to-water ratios induced by economic and environmental considerations have a significant effect in rheology, which invokes the need for mechanistic models capable of describing the effect of multiple relevant phenomena on the observed paste flow. In this work, the population balance framework was implemented to develop a model able to relate the transient microstructural evolution of cement pastes under typical experimental conditions with its macroscopic rheological responses. Numerical details and performance are assessed and discussed. It was found that the model is capable of reproducing experimentally observed flow curves by using measured cluster size distribution information. It is also able to predict the complex rheological characteristics typically found in cement pastes. Furthermore, a spatially resolved scheme was proposed to investigate the nature of flow inside a parallel-plates rheometer geometry with the objective of assessing the ability of the model of qualitatively predicting experimentally observed behavior and to gain insight into the effect of possible secondary flows

DYNAMICAL CONTACT PARAMETER IDENTIFICATION OF SPINDLE-HOLDER-TOOL ASSEMBLIES USING SOFT COMPUTING TECHNIQUES

In industry, the capability to predict the tool point frequency response function (FRF) is an essential matter in order to ensure the stability of cutting processes. Fast and accurate identification of contact parameters in spindle-holder-tool assemblies is very important issue in machining dynamics analysis. This work is an attempt to illustrate the utility of soft computing techniques in identification and prediction contact parameters of spindle-holder-tool assemblies. In this paper, three soft computing techniques, namely, genetic algorithm (GA), simulated annealing (SA), and particle swarm optimization (PSO) were used for identification of contact dynamics in spindle-holder-tool assemblies. In order to verify the proposed identification approaches, numerical and experimental analysis of the spindle-holder-tool assembly was carried out and the results are presented. Finally, a model based on the adaptive neural fuzzy inference system (ANFIS) was used to predict the dynamical contact parameters at the holder-tool interface of a spindle-holder-tool assembly. Accuracy and performance of the ANFIS model has been found to be satisfactory while validated with experimental results

The test-retest reliability of centre of pressure measures in bipedal static task conditions - A systematic review of the literature

Summary of background data: The analysis of centre of pressure (COP) excursions is used as an index of postural stability in standing. Conflicting data have been reported over the past 20 years regarding the reliability of COP measures and no standard procedure for COP measure use in study design has been established. Search methods: Six online databases (January 1980 to February 2009) were systematically searched followed by a manual search of retrieved papers. Results: Thirty-two papers met the inclusion criteria. The majority of the papers (26/32, 81.3%) demonstrated acceptable reliability. While COP mean velocity (mVel) demonstrated variable but generally good reliability throughout the different studies (r= 0.32-0.94), no single measurement of COP appeared significantly more reliable than the others. Regarding data acquisition duration, a minimum of 90 s is required to reach acceptable reliability for most COP parameters. This review further suggests that while eyes closed readings may show slightly higher reliability coefficients, both eyes open and closed setups allow acceptable readings under the described conditions (r≥0.75). Also averaging the results of three to five repetitions on firm surface is necessary to obtain acceptable reliability. A sampling frequency of 100. Hz with a cut-off frequency of 10. Hz is also recommended. No final conclusion regarding the feet position could be reached. Conclusions: The studies reviewed show that bipedal static COP measures may be used as a reliable tool for investigating general postural stability and balance performance under specific conditions. Recommendations for maximizing the reliability of COP data are provided