the markowitz’s optimization problem is considered as a standard quadratic programming problem that has exact mathematical solutions. considering real world limits and conditions, the portfolio optimization problem is a mixed quadratic and integer programming problem for which efficient algorithms do not exist. therefore, the use of meta-heuristic methods such as neural networks and evolutionar...

Abstract—In real world applications, optimization is an inevitable stage in any engineering design. In recent days the optimization theory is also fused into other sciences which require precision in its final result. This topic sounds like a promising domain for research almost in all areas of science and technology. Perhaps several solution methods are proposed for solving problems that requi...

We propose a novel generalized algorithmic framework to utilize particle filter for optimization incorporated with the swarm move method in particle swarm optimization (PSO). In this way, the PSO update equation is treated as the system dynamic in the state space model, while the objective function in optimization problem is designed as the observation/measurement in the state space model. Part...

Inspired by observing fireworks explosion, a novel swarm intelligence algorithm, called Fireworks Algorithm (FA), is proposed for global optimization of complex functions. In the proposed FA, two types of explosion (search) processes are employed, and the mechanisms for keeping diversity of sparks are also well designed. In order to demonstrate the validation of the FA, a number of experiments ...

We investigate the runtime of the Binary Particle Swarm Optimization (PSO) algorithm introduced by Kennedy and Eberhart (1997). The Binary PSO maintains a global best solution and a swarm of particles. Each particle consists of a current position, an own best position and a velocity vector used in a probabilistic process to update the particle’s position. We present lower bounds for a broad cla...

In this paper we present a comparison between six novel approaches to the fundamental problem of cyclic instability in Ambient Intelligence. These approaches are based on different optimization algorithms, Particle Swarm Optimization (PSO), Bee Swarm Optimization (BSO), micro Particle Swarm Optimization (μ-PSO), Artificial Immune System (AIS), Genetic Algorithm (GA) and Mutual Information Maxim...

Short term hydrothermal scheduling (STHTS) is a very complex, dynamic large-scale non-linear optimization problem. There are many algorithms and powerful optimization methods used to address this issue. Evolutionary algorithms have been effectively employed to obtain a global optimized solution of non linear problems like STHTS. Particle Swarm Optimization (PSO) is an evolutionary method. It ca...

Particle Swarm Optimization (PSO) is one of the most powerful algorithms for optimization. Traditional PSO algorithm tends to suffer from slow convergence and trapping into local optimum. In this paper, an improved PSO algorithm is proposed by combining dynamic fractional order technology and the wavelet mutation strategy. In the proposed method, a dynamic fractional order velocity update equat...

In the present study, the computational performance of the particle swarm optimization (PSO) harmony search (HS) and firefly algorithm (FA), as popular metaheuristics, is investigated for size and shape optimization of truss structures. The PSO was inspired by the social behavior of organisms such as bird flocking. The HS imitates the musical performance process which takes place when a musicia...

In this paper, a well known NP-hard problem, the Constrained Shortest Path problem, is studied. As efficient metaheuristic approaches are required for its solution, a new hybridized version of Particle Swarm Optimization algorithm with Variable Neighborhood Search is proposed for solving this significant combinatorial optimization problem. Particle Swarm Optimization (PSO) is a population-based...