A Brief Analysis of Gravitational Search Algorithm (GSA) Publication from 2009 to May 2013

Gravitational Search Algorithm was introduced in year 2009. Since its introduction, the academic community shows a great interest on this algorith. This can be seen by the high number of publications with a short span of time. This paper analyses the publication trend of Gravitational Search Algorithm since its introduction until May 2013. The objective of this paper is to give exposure to reader the publication trend in the area of Gravitational Search Algorithm

A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms

Intelligent Decision Support Based on Integration of Fuzzy Clustering and Multi objective Optimization Problem for Non Player Character in Serious Game

Nowadays, decision support plays an important role in decision-making, errors in decisionmaking is able to lose the competition. Decision-making is very complicated especially when the problem is in multiobjective problem. To learn decision making through play a game is an interesting thing. Player plays a game but actually, he or she learns about how to make a decision. In this research, the objective is to make Non-Player Character (NPC) for serious game for electrical power production. This NPC is developed with 2 stages, the first stage is multiobjective optimization problem that uses NSGA2 method. This stage results some optimal solutions. The second stage is clustering that uses FCM method and FLVQ method to decrease number of solutions. In this stage, we compare these methods

Hybrid method for achieving Pareto front on economic emission dispatch

In this paper hybrid method, Modified Nondominated Sorted Genetic Algorithm (MNSGA-II) and Modified Population Variant Differential Evolution(MPVDE) have been placed in effect in achieving the best optimal solution of Multiobjective economic emission load dispatch optimization problem. In this technique latter, one is used to enforce the assigned percent of the population and the remaining with the former one. To overcome the premature convergence in an optimization problem diversity preserving operator is employed, from the tradeoff curve the best optimal solution is predicted using fuzzy set theory. This methodology validated on IEEE 30 bus test system with six generators, IEEE 118 bus test system with fourteen generators and with a forty generators test system. The solutions are dissimilitude with the existing metaheuristic methods like Strength Pareto Evolutionary Algorithm-II, Multiobjective differential evolution, Multi-objective Particle Swarm optimization, Fuzzy clustering particle swarm optimization, Nondominated sorting genetic algorithm-II

An Algorithmic Framework for Multiobjective Optimization

Multiobjective (MO) optimization is an emerging field which is increasingly being encountered in many fields globally. Various metaheuristic techniques such as differential evolution (DE), genetic algorithm (GA), gravitational search algorithm (GSA), and particle swarm optimization (PSO) have been used in conjunction with scalarization techniques such as weighted sum approach and the normal-boundary intersection (NBI) method to solve MO problems. Nevertheless, many challenges still arise especially when dealing with problems with multiple objectives (especially in cases more than two). In addition, problems with extensive computational overhead emerge when dealing with hybrid algorithms. This paper discusses these issues by proposing an alternative framework that utilizes algorithmic concepts related to the problem structure for generating efficient and effective algorithms. This paper proposes a framework to generate new high-performance algorithms with minimal computational overhead for MO optimization