Search results for "Algorithm"
showing 10 items of 4887 documents
A New ESO-Based Method to Find the Optimal Topology of Structures Subject to Multiple Load Conditions
2014
In the field of topology optimization problems, the Evolutionary Structural Optimization (ESO) method is one of the most popular and easy to use. When dealing with problems of reasonable difficulty, the ESO method is able to give very good results in reduced times and with a limited request of computational resources. Generally, main applications of this method are addressed to the definition of the optimal topology of a component subjected to a single load condition. In this work, a new methodology, based on the ESO approach, is introduced for the study of the optimal topology of a component subjected to multiple load conditions. The new procedure, entirely developed in the APDL programmin…
Combined K-Best sphere decoder based on the channel matrix condition number
2008
It is known that sphere decoding (SD) methods can provide maximum-likelihood (ML) detection over Gaussian MIMO channels with lower complexity than the exhaustive search. Channel matrix condition number represents an important influence on the performance of usual detectors. Throughout this paper, two particular cases of a SD method called K-Best carry out a combined detection in order to reduce the computational complexity with predictable performance degradation. Algorithm selection is based on channel matrix condition number thresholding. K-Best is a suboptimal SD algorithm for finding the ML solution of a detection problem. It is based on a fixed complexity tree search, set by a paramete…
Explicit Recursive and Adaptive Filtering in Reproducing Kernel Hilbert Spaces
2014
This brief presents a methodology to develop recursive filters in reproducing kernel Hilbert spaces. Unlike previous approaches that exploit the kernel trick on filtered and then mapped samples, we explicitly define the model recursivity in the Hilbert space. For that, we exploit some properties of functional analysis and recursive computation of dot products without the need of preimaging or a training dataset. We illustrate the feasibility of the methodology in the particular case of the $\gamma$ -filter, which is an infinite impulse response filter with controlled stability and memory depth. Different algorithmic formulations emerge from the signal model. Experiments in chaotic and elect…
An exact algorithm for the min-cost network containment problem
2004
A network design problem which arises in the distribution of a public utility provided by several competitive suppliers is studied. The problem addressed is that of determining minimum-cost (generalized) arc capacities in order to accommodate any demand between given source–sink pairs of nodes, where demands are assumed to fall within predetermined ranges. Feasible flows are initially considered as simply bounded by the usual arc capacity constraints. Then, more general linear constraints are introduced which may limit the weighted sum of the flows on some subsets of arcs. An exact cutting plane algorithm is presented for solving both of the above cases and some computational results are re…
A Simplified Analytical Approach for Optimal Planning of Distributed Generation in Electrical Distribution Networks
2019
DG-integrated distribution system planning is an imperative issue since the installing of distributed generations (DGs) has many effects on the network operation characteristics, which might cause significant impacts on the system performance. One of the most important characteristics that mostly varies because of the installation of DG units is the power losses. The parameters affecting the value of the power losses are number, location, capacity, and power factor of the DG units. In this paper, a new analytical approach is proposed for optimally installing DGs to minimize power loss in distribution networks. Different parameters of DG are considered and evaluated in order to achieve a hig…
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…
Interactive Inverse Modeling Based Multiobjective Evolutionary Algorithm
2018
An interactive version of the inverse modeling based multiobjective evolutionary algorithm is presented. Instead of generating a representation of the whole Pareto optimal front, the algorithm aims at producing solutions in the regions where the decision maker is interested in. This is facilitated through an interactive solution process where the decision maker iteratively evaluates a set of solutions shown to her/him and the preference information obtained is used to adapt the search process of the algorithm. peerReviewed
A fuzzy-logic based evolutionary multiobjective approach for automated distribution networks management
2004
In this paper, a methodology to treat constrained scheduling problems based on the repeated application of a fuzzy-logic-based multiobjective algorithm is presented. The application domain is that of automated distribution systems management. In particular, the problem of voltage regulation and power loses minimization is here considered. The classical formulation of the problem of optimal control of shunt capacitor banks and under load tap changers, ULTC, located at high voltage/medium voltage (HV/MV) substations has been coupled with the optimal control of tie-switches and capacitor banks on the feeders of a large radially operated meshed distribution system with the aim of attaining mini…
A Hybrid Strategic Oscillation with Path Relinking Algorithm for the Multiobjective k-Balanced Center Location Problem
2021
This paper presents a hybridization of Strategic Oscillation with Path Relinking to provide a set of high-quality nondominated solutions for the Multiobjective k-Balanced Center Location problem. The considered location problem seeks to locate k out of m facilities in order to serve n demand points, minimizing the maximum distance between any demand point and its closest facility while balancing the workload among the facilities. An extensive computational experimentation is carried out to compare the performance of our proposal, including the best method found in the state-of-the-art as well as traditional multiobjective evolutionary algorithms.
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.