the gravitational search algorithm (gsa) is a novel optimization methodbased on the law of gravity and mass interactions. it has good ability to search forthe global optimum, but its searching speed is really slow in the last iterations. sothe hybridization of particle swarm optimization (pso) and gsa can resolve theaforementioned problem. in this paper, a modified pso, which the movement ofpar...

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...

This article develops an evolutional fuzzy particle swarm optimization (FPSO) learning algorithm to self extract the near optimum codebook of vector quantization (VQ) for carrying on image compression. The fuzzy particle swarm optimization vector quantization (FPSOVQ) learning schemes, combined advantages of the adaptive fuzzy inference method (FIM), the simple VQ concept and the efficient part...

One of the main problems associated with the authoring of e-courses, for e-learning systems, is that the current composition-approaches do not support 'personalized-learning' or in other words, the current composition approaches fail to take into consideration the difference in individual learning-capabilities and the background knowledge of the individual learners and thus do not provide mater...

In view of the shortcomings of the test data generation algorithm including particle swarm optimization algorithm and ant colony algorithm, a new algorithm is proposed, which is based on the combination of particle swarm algorithm and parameter adjustment. This algorithm can dynamically adjust its search capabilities based on the fitness value of particles , combine the advantages of particle s...

The high-dimensional search space involved in markerless full-body articulated human motion tracking from multiple-views video sequences has led to a number of solutions based on metaheuristics, the most recent form of which is Particle Swarm Optimization (PSO). However, the classical PSO suffers from premature convergence and it is trapped easily into local optima, significantly affecting the ...

In this paper, we incorporate pheromone courtship mode of biology to improve particle swarm optimizer. The particle swarm optimization technique has ever since turned out to be a competitor in the field of numerical optimization. A particle swarm optimization consists of a number of individuals refining their knowledge of the given search space. Particle swarm optimizations are inspired by part...

The purpose of this paper is to show how the search algorithm known as particle swarm optimization performs. Here, particle swarm optimization is applied to structural design problems, but the method has a much wider range of possible applications. The paper's new contributions are improvements to the particle swarm optimization algorithm and conclusions and recommendations as to the utility of...

In this paper, we propose a method for solving constrained optimization problems using Interval Analysis combined with Particle Swarm Optimization. A Set Inverter Via Interval Analysis algorithm is used to handle constraints in order to reduce constrained optimization to quasi unconstrained one. The algorithm is useful in the detection of empty search spaces, preventing useless executions of th...

In this paper, we propose a dynamic, non-dominated sorting, multiobjective particle-swarm-based optimizer, named Hierarchical Non-dominated Sorting Particle Swarm Optimizer (H-NSPSO), for memory usage optimization in embedded systems. It significantly reduces the computational complexity of others MultiObjective Particle Swarm Optimization (MOPSO) algorithms. Concretely, it first uses a fast no...