Search results for "Optimization algorithm"

An Optimization Package for Electrical Distribution Network Reconfiguration

2008

Composite laminates buckling optimization through Levy based Ant Colony Optimization

2010

In this paper, the authors propose the use of the Levy probability distribution as leading mechanism for solutions differentiation in an efficient and bio-inspired optimization algorithm, ant colony optimization in continuous domains, ACOR. In the classical ACOR, new solutions are constructed starting from one solution, selected from an archive, where Gaussian distribution is used for parameter diversification. In the proposed approach, the Levy probability distributions are properly introduced in the solution construction step, in order to couple the ACOR algorithm with the exploration properties of the Levy distribution. The proposed approach has been tested on mathematical test functions…

PORE Algorithm for Object Recognition in Photo Layers based on Parametric Characteristics of the Object Edges

2016

PORE stands for Photo-Object Recognition based on the Edges. Coincidentally, PORE means to examine something carefully and with due attention, so "we pore over the object layers in search for information about their characteristics with the aim at improving image recognition process". Therefore, this study presents a novel approach to object recognition based on the pattern by using photo layers and by defining the objects' specific characteristics. We select and introduce the parameters which determine a higher efficiency of image retrieval of the image objects. In this paper, we describe how the same photos are recognized in a process of classical retrieval compared to our model by analyz…

Computing the Arrangement of Circles on a Sphere, with Applications in Structural Biology

2009

International audience; Balls and spheres are the simplest modeling primitives after affine ones, which accounts for their ubiquitousness in Computer Science and Applied Mathematics. Amongst the many applications, we may cite their prevalence when it comes to modeling our ambient 3D space, or to handle molecular shapes using Van der Waals models. If most of the applications developed so far are based upon simple geometric tests between balls, in particular the intersection test, a number of applications would obviously benefit from finer pieces of information. Consider a sphere $S_0$ and a list of circles on it, each such circle stemming from the intersection between $S_0$ and another spher…

Registration and fusion of segmented left atrium CT images with CARTO electrical maps for the ablative treatment of atrial fibrillation

2005

This study aims to extract the interior surface of the left atrium (LA) and pulmonary veins (PVs) from threedimensional tomographic data and to integrate it with LA CARTO electrical maps. The separation of LA and PVs from other overlapping structures of the heart was performed processing 3D CT data by marker-controlled watershed segmentation and surface extraction. CARTO maps were then registered on the L A internal surface by a stochastic optimization algorithm based on simulated annealing. The residual registration error resulted inferior to 3 mm. The integration between electrophysiological and high resolved anatomic information of LA results feasible and may constitute a significant sup…

Training label cleaning with ant colony optimization for classification of remote sensing imagery

2015

This paper presents an original approach for improving performances of the supervised classifiers in remote sensing imagery by proposing a technique to refine a given training set using Ant Colony Optimization (ACO). The new method called ACO-Training Label Cleaning (ACO-TLC) applies ACO model for selection of the significant training samples from a given set of labeled vectors in order to optimize the quality of a supervised classifier. This means to retain the most informative samples and to remove the uncertain or misclassified training samples, which lead to classification errors. As a result of the selection process, we can obtain a purified training set. The proposed model is implemen…

A grid ant colony algorithm for the orienteering problem

2005

In this paper we propose a distributed ant colony algorithm to solve large scale orienteering problem instances. Our approach is based on a multi-colony strategy where each colony works in an independent portion (cluster) in the original graph. This results in no need for communicating pheromones information among colonies and in increasing speedup. We have implemented our algorithm as a .NET Web services infrastructure following a grid computing philosophy and we provide some promising experimental results to show the feasibility and effectiveness of our approach

A novel identification method for generalized T-S fuzzy systems

2012

Published version of an article from the journal: Mathematical Problems in Engineering. Also available from the publisher:http://dx.doi.org/10.1155/2012/893807 In order to approximate any nonlinear system, not just affine nonlinear systems, generalized T-S fuzzy systems, where the control variables and the state variables, are all premise variables are introduced in the paper. Firstly, fuzzy spaces and rules were determined by using ant colony algorithm. Secondly, the state-space model parameters are identified by using genetic algorithm. The simulation results show the effectiveness of the proposed algorithm

Drivers-Inspired Ants for Solving the Vehicle Routing Problem with Time Windows

2016

International audience; In our study, we develop a method that merges two information sources within ants colony optimization heuristic. Namely artificial ants which occurs for short term optimization and transporter's vehicles that occurs in long term and continuous optimization toward solving the real-world vehicle routing problem. This study is supported by a transporter (Upsilon) of the region of l'Yonne in France and a transport and logistics software development company (Tedies). Our method suits for transporters that use human planners to make decisions about their tours and intending to move to computer planners without drastically upsetting the drivers habits. Hence, the pledge of …

Damage identification by Lévy ant colony optimization

2010

This paper deals with the identification of incipient damage in structural elements by non-destructive test based on experimentally measured structural dynamical response. By applycation of the Hilbert transform to the recorded signal the so-called phase of the analytical signal is recovered and a proper functional is constructed in such a way that its global minimum gives a measure of the damage level, meant as stiffness reduction. Minimization is achieved by applying a modified Ant Colony Optimization (ACO) for continuous variables, inspired by the ants’ forageing behavior. The modification consists in the application of a new perturbation operator, based on alpha stable Lévy distribution…