A modified ant colony optimization algorithm modeled on tabu-search methods

An earlier model underlying the foraging strategy of a pachycodyla apicalis ant is modified. The proposed algorithm incorporates key features of the tabu-search method in the development of a relatively simple but robust global ant colony optimization algorithm. Numerical results are reported to validate and demonstrate the feasibility and effectiveness of the proposed algorithm in solving electromagnetic (EM) design problems.

ALTERNATIVE SAMPLING STRATEGY FOR A RANDOM OPTIMIZATION ALGORITHM

Alternative sampling procedures are compared to the pure random search method. It is shown that the efficiency of the algorithm can be improved with respect to the expected number of steps to reach an epsilon-neighborhood of the optimal point.

A common Tabu search algorithm for the global optimization of engineering problems

A novel common Tabu algorithm for global optimizations of engineering problems is presented. The robustness and efficiency of the presented method are evaluated by using standard mathematical functions and hy solving a practical engineering problem. The numerical results show that the proposed method is (i) superior to the conventional Tabu search algorithm in robustness, and (ii) superior to the simulated annealing algorithm in efficiency. (C) 2001 Elsevier B.V. B.V. All rights reserved.

A hybrid image restoration algorithm based on Projections onto Convex Sets and Harmony Search

Image restoration is a research field that attempts to recover a blurred and noisy image. Since it can be modeled as a linear system, we propose in this paper to use the meta-heuristics optimization algorithm Harmony Search (HS) to find out near-optimal solutions in a Projections Onto Convex Sets-based formulation to solve this problem. The experiments using HS and four of its variants have shown that we can obtain near-optimal and faster restored images than other evolutionary optimization approach. © 2013 IEEE.

BBA: A binary bat algorithm for feature selection

Feature selection aims to find the most important information from a given set of features. As this task can be seen as an optimization problem, the combinatorial growth of the possible solutions may be in-viable for a exhaustive search. In this paper we propose a new nature-inspired feature selection technique based on the bats behaviour, which has never been applied to this context so far. The wrapper approach combines the power of exploration of the bats together with the speed of the Optimum-Path Forest classifier to find the set of features that maximizes the accuracy in a validating set. Experiments conducted in five public datasets have demonstrated that the proposed approach can outperform some well-known swarm-based techniques. © 2012 IEEE.

Discovering promising regions to help global numerical optimization algorithms

We have developed an algorithm using a Design of Experiments technique for reduction of search-space in global optimization problems. Our approach is called Domain Optimization Algorithm. This approach can efficiently eliminate search-space regions with low probability of containing a global optimum. The Domain Optimization Algorithm approach is based on eliminating non-promising search-space regions, which are identifyed using simple models (linear) fitted to the data. Then, we run a global optimization algorithm starting its population inside the promising region. The proposed approach with this heuristic criterion of population initialization has shown relevant results for tests using hard benchmark functions.

Search for randall-sundrum gravitons in dilepton and diphoton final states

We report the first direct search for the Kaluza-Klein (KK) modes of Randall-Sundrum gravitons using dielectron, dimuon, and diphoton events observed with the D0 detector operating at the Fermilab Tevatron p (p) over bar Collider at root s = 1: 96 TeV. No evidence for resonant production of gravitons has been found in the data corresponding to an integrated luminosity of approximate to 260 pb(-1). Lower limits on the mass of the first KK mode at the 95% C. L. have been set between 250 and 785 GeV, depending on its coupling to standard model particles.

Search for stopped gluinos from p(p)over-bar collisions at root s=1.96 TeV

Long-lived, heavy particles are predicted in a number of models beyond the standard model of particle physics. We present the first direct search for such particles' decays, occurring up to 100 h after their production and not synchronized with an accelerator bunch crossing. We apply the analysis to the gluino (g), predicted in split supersymmetry, which after hadronization can become charged and lose enough momentum through ionization to come to rest in dense particle detectors. Approximately 410 pb(-1) of p (p) over bar collisions at root s = 1.96 TeV collected with the D0 detector during Run II of the Fermilab Tevatron collider are analyzed in search of such stopped gluinos decaying into a gluon and a neutralino ((chi) over tilde (0)(1)). Limits are placed on the (gluino cross section) x (probability to stop) x [BR((g) over tilde -> g (chi) over tilde (0)(1))] as a function of the gluino and (chi) over tilde (0)(1) masses, for gluino lifetimes from 30 mu s-100 h.

Search for single top quarks in the tau plus jets channel using 4.8 fb(-1) of p(p)over-bar collision data

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Optimum-Path Forest pruning parameter estimation through Harmony Search

Pattern recognition in large amount of data has been paramount in the last decade, since that is not straightforward to design interactive and real time classification systems. Very recently, the Optimum-Path Forest classifier was proposed to overcome such limitations, together with its training set pruning algorithm, which requires a parameter that has been empirically set up to date. In this paper, we propose a Harmony Search-based algorithm that can find near optimal values for that. The experimental results have showed that our algorithm is able to find proper values for the OPF pruning algorithm parameter. © 2011 IEEE.

Perfil de índices de refração do cristalino humano: simulação computacional

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Reconstrução de contornos e cumeeiras de telhados de edifícios a partir de imagens aéreas de alta-resolução e poliedros representativos de edifícios extraídos de dados LASER

Pós-graduação em Ciências Cartográficas - FCT

Sistemas autônomos de iluminacão pública em corrente contínua

Pós-graduação em Engenharia Elétrica - FEIS

Semiautomatic object-space road extraction combining a stereoscopic image pair and a TIN-Based DTM

In this letter, a semiautomatic method for road extraction in object space is proposed that combines a stereoscopic pair of low-resolution aerial images with a digital terrain model (DTM) structured as a triangulated irregular network (TIN). First, we formulate an objective function in the object space to allow the modeling of roads in 3-D. In this model, the TIN-based DTM allows the search for the optimal polyline to be restricted along a narrow band that is overlaid upon it. Finally, the optimal polyline for each road is obtained by optimizing the objective function using the dynamic programming optimization algorithm. A few seed points need to be supplied by an operator. To evaluate the performance of the proposed method, a set of experiments was designed using two stereoscopic pairs of low-resolution aerial images and a TIN-based DTM with an average resolution of 1 m. The experimental results showed that the proposed method worked properly, even when faced with anomalies along roads, such as obstructions caused by shadows and trees.

Planning and Projects of Secondary Electric Power Distribution Systems

This paper proposes a methodology to achieve integrated planning and projects for secondary distribution circuits. The planning model is formulated as a mixed integer nonlinear programming problem (MINLP). In order to resolve this problem, a tabu search (TS) algorithm is used, with a neighborhood structure developed to explore the physical characteristics of specific geographies included in the planning and expansion of secondary networks, thus obtaining effective solutions as well as low operating costs and investments. The project stage of secondary circuits consists of calculating the mechanical efforts to determine the support structures of the primary and secondary distribution systems and determining the types of structures that should be used in the system according to topological and electrical parameters of the network and, therefore, accurately assessing the costs involved in the construction and/or reform of secondary systems. A constructive heuristic based on information of the electrical and topological conditions between the medium voltage and low voltage systems is used to connect the primary systems and secondary circuits. The results obtained from planning and design simulations of a real secondary system of electric energy distribution are presented.