Search results for "methodologies"
showing 10 items of 2106 documents
Towards Multilevel Ant Colony Optimisation for the Euclidean Symmetric Traveling Salesman Problem
2015
Ant Colony Optimization ACO metaheuristic is one of the best known examples of swarm intelligence systems in which researchers study the foraging behavior of bees, ants and other social insects in order to solve combinatorial optimization problems. In this paper, a multilevel Ant Colony Optimization MLV-ACO for solving the traveling salesman problem is proposed, by using a multilevel process operating in a coarse-to-fine strategy. This strategy involves recursive coarsening to create a hierarchy of increasingly smaller and coarser versions of the original problem. The heart of the approach is grouping the variables that are part of the problem into clusters, which is repeated until the size…
A New Crowded Comparison Operator in Constrained Multiobjective Optimization for Capacitors Sizing and Siting in Electrical Distribution Systems
2005
This paper presents a new Crowded Comparison Operator (CCO) for NSGA-II to solve the Multiobjective and constrained problem of optimal capacitors placement in electrical distribution systems.
Performance modeling of epidemic routing
2006
In this paper, we develop a rigorous, unified framework based on ordinary differential equations (ODEs) to study epidemic routing and its variations. These ODEs can be derived as limits of Markovian models under a natural scaling as the number of nodes increases. While an analytical study of Markovian models is quite complex and numerical solution impractical for large networks, the corresponding ODE models yield closed-form expressions for several performance metrics of interest, and a numerical solution complexity that does not increase with the number of nodes. Using this ODE approach, we investigate how resources such as buffer space and the number of copies made for a packet can be tra…
Controller Design Under Fuzzy Pole-Placement Specifications: An Interval Arithmetic Approach
2006
This paper discusses fuzzy specifications for robust controller design, as a way to define different specification levels for different plants in a family and allow the control of performance degradation. Controller synthesis will be understood as mapping a fuzzy plant onto a desired fuzzy set of closed-loop specifications. In this context, a fuzzy plant is considered as a possibility distribution on a given plant space. In particular, pole placement in linear plants with fuzzy parametric uncertainty is discussed, although the basic idea is general and could be applied to other settings. In the case under consideration, the controller coefficients are the solution of a fuzzy linear system o…
Mathematical Morphology Based on Fuzzy Operators
1993
A vision procedure may be considered as the repeated application of image operators until the vision goal is reached. The type of these operators and the spaces on which they are defined and act depends on the specific problem and on what we are searching on the image. Morphological operations, as filtering, edge detection, skeletonizing, and so on, are mainly required at low and medium levels of the vision procedure, where local and global knowledge is used to enhance the image information content, before a final decision about the image is taken.
G1 rational blend interpolatory schemes: a comparative study
2012
Interpolation of triangular meshes is a subject of great interest in many computer graphics related applications, as, for example, gaming and realtime rendering. One of the main approaches to interpolate the positions and normals of the mesh vertices is the use of parametric triangular Bezier patches. As it is well known, any method aiming at constructing a parametric, tangent plane (G^1) continuous surface has to deal with the vertex consistency problem. In this article, we propose a comparison of three methods appeared in the nineties that use a particular technique called rational blend to avoid this problem. Together with these three methods we present a new scheme, a cubic Gregory patc…
An exact algorithm for the fuzzy p-median problem
1999
In this paper we propose a fuzzy version of the classical p-median problem. We consider a fuzzy set of constraints so that the decision-maker will be able to take into account solutions which provide significantly lower costs by leaving a part of the demand uncovered. We propose an algorithm for solving the problem which is based on Hakimi's works and we compare the crisp and the fuzzy approach by means of an example.
COMPUTATION OF LOCAL VOLATILITIES FROM REGULARIZED DUPIRE EQUATIONS
2005
We propose a new method to calibrate the local volatility function of an asset from observed option prices of the underlying. Our method is initialized with a preprocessing step in which the given data are smoothened using cubic splines before they are differentiated numerically. In a second step the Dupire equation is rewritten as a linear equation for a rational expression of the local volatility. This equation is solved with Tikhonov regularization, using some discrete gradient approximation as penalty term. We show that this procedure yields local volatilities which appear to be qualitatively correct.
A novel abstraction for swarm intelligence: particle field optimization
2016
Particle swarm optimization (PSO) is a popular meta-heuristic for black-box optimization. In essence, within this paradigm, the system is fully defined by a swarm of "particles" each characterized by a set of features such as its position, velocity and acceleration. The consequent optimized global best solution is obtained by comparing the personal best solutions of the entire swarm. Many variations and extensions of PSO have been developed since its creation in 1995, and the algorithm remains a popular topic of research. In this work we submit a new, abstracted perspective of the PSO system, where we attempt to move away from the swarm of individual particles, but rather characterize each …
Error bounds for a convexity-preserving interpolation and its limit function
2008
AbstractError bounds between a nonlinear interpolation and the limit function of its associated subdivision scheme are estimated. The bounds can be evaluated without recursive subdivision. We show that this interpolation is convexity preserving, as its associated subdivision scheme. Finally, some numerical experiments are presented.