Search results for "particle swarm optimization"

Partial joint processing with efficient backhauling using particle swarm optimization

2012

In cellular communication systems with frequency reuse factor of one, user terminals (UT) at the cell-edge are prone to intercell interference. Joint processing is one of the coordinated multipoint transmission techniques proposed to mitigate this interference. In the case of centralized joint processing, the channel state information fed back by the users need to be available at the central coordination node for precoding. The precoding weights (with the user data) need to be available at the corresponding base stations to serve the UTs. These increase the backhaul traffic. In this article, partial joint processing (PJP) is considered as a general framework that allows reducing the amount …

Frequency constrained optimal Power Flow based on Glow-worm Swarm Optimization in Islanded Microgrids

2015

This work presents an application of a swarm optimization method to solve the optimal power flow problem taking into account the constraints of frequency and line ampacity in three-phase islanded Microgrids. Each generation unit is equipped with a Power Electronics Interface. In the considered formulation, the droop control parameters are considered as variables to be adjusted by a higher control level, while the frequency is kept in rated bounds. Another typical constraint for OPF formulation, the max ampacity of each line, is also considered. Two case studies with different dimensions and electrical features have been considered and the obtained results show the efficiency of the proposed…

2021

One of the problems that hinder emergency in developing countries is the problem of monitoring a number of activities on inter-urban roadway networks. In the literature, the use of control points is proposed in the context of these countries in order to ensure efficient monitoring, by ensuring a good coverage while minimizing the installation costs as well as the number of accidents across these road networks. In this work, we propose an optimal deployment of these control points from several optimization methods based on some evolutionary multi-objective algorithms: the non-dominated sorting genetic algorithm-II (NSGA-II); the multi-objective particle swarm optimization (MOPSO); the streng…

Solving a continuous periodic review inventory-location allocation problem in vendor-buyer supply chain under uncertainty

2019

In this work, a mixed-integer binary non-linear two-echelon inventory problem is formulated for a vendor-buyer supply chain network in which lead times are constant and the demands of buyers follow a normal distribution. In this formulation, the problem is a combination of an (r, Q) and periodic review policies based on which an order of size Q is placed by a buyer in each fixed period once his/her on hand inventory reaches the reorder point r in that period. The constraints are the vendors’ warehouse spaces, production restrictions, and total budget. The aim is to find the optimal order quantities of the buyers placed for each vendor in each period alongside the optimal placement of the ve…

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 …

Wireless sensor network coverage problem using modified fireworks algorithm

2016

Wireless sensor networks are emerging technology with increasing number of applications, and consequently an active research area. One of the problems pertinent to wireless sensor networks is the coverage problem with number of definitions, depending on the assumed conditions. In this paper we consider hard optimization area coverage problem with the goal of finding optimal sensor nodes positions that maximize probabilistic coverage of the area of interest. For such type of optimization problem swarm intelligence stochastic metaheuristics have been successfully used. In this paper we propose a modified enhanced fireworks algorithm for wireless sensor network coverage problem and compare it …

Memetic Algorithms in Engineering and Design

2012

When dealing with real-world applications, one often faces non-linear and nondifferentiable optimization problems which do not allow the employment of exact methods. In addition, as highlighted in [104], popular local search methods (e.g. Hooke-Jeeves, Nelder Mead and Rosenbrock) can be ill-suited when the real-world problem is characterized by a complex and highly multi-modal fitness landscape since they tend to converge to local optima. In these situations, population based meta-heuristics can be a reasonable choice, since they have a good potential in detecting high quality solutions. For these reasons, meta-heuristics, such as Genetic Algorithms (GAs), Evolution Strategy (ES), Particle …

Applying fuzzy Particle Swarm Optimization to Multi-unit Double Auctions

2010

Abstract In the context of Quadratic Programming Problems, we use a fuzzy Particle Swarm Optimization (PSO) algorithm to analyze a Multi-unit Double Auction (MDA) market. We give also a Linear Programming (LP) based upper bound to help the decision maker in dealing with constraints in the mathematical model. In the computational study, we evaluate our algorithm and show that it is a feasible approach for processing bids and calculating assignments.

Scatter Search and Path Relinking

2011

Scatter search (SS) and path relinking (PR) are evolutionary methods that have been successfully applied to a wide range of hard optimization problems. The fundamental concepts and principles of the methods were first proposed in the 1970s and 1980s, and were based on formulations, dating back to the 1960s, for combining decision rules and problem constraints. The methods use strategies for search diversification and intensification that have proved effective in a variety of optimization problems and that have sometimes been embedded in other evolutionary methods to yield improved performance. This paper examines the scatter search and path relinking methodologies from both conceptual and p…

A Novel Artificial Neural Network (ANN) Using The Mayfly Algorithm for Classification

2021

Training of Artificial Neural Networks (ANNs) have been improved over the years using meta heuristic algorithms that introduce randomness into the training method but they might be prone to falling into a local minima in a high-dimensional space and have low convergence rate with the iterative process. To cater for the inefficiencies of training such an ANN, a novel neural network is presented in this paper using the bio-inspired algorithm of the movement and mating of the mayflies. The proposed Mayfly algorithm is explored as a means to update weights and biases of the neural network. As compared to previous meta heuristic algorithms, the proposed approach finds the global minima cost at f…