This paper proposes an extension of the Gravitational Search Algorithm (GSA) to multiobjective optimization problems. The new algorithm, called Non-dominated Sorting GSA (NSGSA), utilizes the non-dominated sorting concept to update the gravitational acceleration of the particles. An external archive is also used to store the Pareto optimal solutions and to provide some elitism. It also guides t...

this paper presents the results of a comprehensive study on the efficiency of planar parallel mechanisms, considering their kinetostatic performance and also, their workspace. this aim is approached upon proceeding single- and multi-objective optimization procedures. kinetostatic performances of ten different planar parallel mechanisms are analyzed by resorting to a recent index, kinematic sens...

Determination of optimal cutting parameters is one of the most important elements in any process planning of metal parts. This paper presents a multi-objective optimization technique, based on genetic algorithms, to optimize the cutting parameters in turning processes: cutting depth, feed and speed. Two conflicting objectives, tool life and operation time, are simultaneously optimized. The prop...

This paper proposes a new multi-objective genetic algorithm, called GAME, to solve constrained optimization problems. GAME uses an elitist archive, but it ranks the population in several Pareto fronts. Then, three types of fitness assignment methods are defined: the fitness of individuals depends on the front they belong to. The crowding distance is also used to preserve diversity. Selection is...

In this paper, we develop a novel algorithm which finds a subset of Pareto front of a Multi-Objective Distributed Constraint Optimization Problem. This algorithm utilizes the Lp-norm method, pseudo-tree, and Dynamic Programming technique. Furthermore, we show that this Lp-norm based algorithm can only guarantee to find a Pareto optimal solution, when we employ L1-norm (Manhattan norm).

In real world most of the optimization problems are multi-objective in nature. These problems take large amount of time to congregate to the true Pareto front. So the basic algorithm like non parallel NSGA II may not able to solve such problem in ?-tolerable amount of time. This paper proposes a new hybrid parallel multi-objective genetic algorithm and solve one of the real life problem i. e. ,...

Pareto local search (PLS) is an extension of iterative improvement methods for multi-objective combinatorial optimization problems and an important part of several state-of-the-art multi-objective optimizers. PLS stops when all neighbors of the solutions in its solution archive are dominated. If terminated before completion, it may produce a poor approximation to the Pareto front. This paper pr...

This paper presents a new multi-objective coupled energy and reactive power market clearing model namely the MO-CERPMC model in day-ahead competitive market environment. In proposed model, both the active and reactive power markets are considered as coupled markets and cleared in a same time frame. The multi-objective optimization problem involves the minimization of total payment functions for...

Land-use allocation is of great significance in urban development. This type of allocation is usually considered to be a complex multi-objective spatial optimization problem, whose optimized result is a set of Pareto-optimal solutions (Pareto front) reflecting different tradeoffs in several objectives. However, obtaining a Pareto front is a challenging task, and the Pareto front obtained by sta...

Low weight and high load capacity are remarkable advantages of sandwich panels with corrugated core, which make them more considerable by engineering structure designers. It’s important to consider the limitations such as yielding and buckling as design constraints for optimal design of these panels. In this paper, multi-objective optimization of sandwich panels with corrugated core is carried ...