Planning and scheduling are as decision making processes which they have important roles in production systems and industries. According that, job shop scheduling is one of NPhard problems to solve multi-objective decision making approaches. So, the problem is known as uncertain with many variables in optimal solution view. Finding optimal solutions are essential task in scheduling of jobs betw...

Marriage in Honey Bees Optimization (MBO) is a new swarm-intelligence method, but existing researches concentrate more on its application in single-objective optimization. In this paper, we focus on improving the algorithm to solve the multi-objective problem and increasing its convergence speed. The proposed algorithm is named as multi-objective Particle Swarm Marriage in Honey Bees Optimizati...

Antenna design problems often require the optimization of several conflicting objectives such as gain maximization, sidelobe level (SLL) reduction and input impedance matching. Multiobjective Evolutionary Algorithms (MOEAs) are suitable optimization techniques for solving such problems. An efficient algorithm is Generalized Differential Evolution (GDE3), which is a multi-objective extension of ...

Two multi-objective genetic algorithms, an elitist version of MOGA and NSGA-II, were applied to solve two linear control design problems. The first was a H2 problem with a PI controller structure, for a first order stable plant. The second was a mixed H2/H4 control problem. In both cases, three indicators were used to evaluate each algorithm performance: Set coverage, spread and hypervolume. It...

In this paper we propose a novel approach for solving constrained multi-objective optimization problems using a steady state GA and reduced models. Our method called Objective Exchange Genetic Algorithm for Design optimization (OEGADO) is intended for solving real-world application problems that have many constraints and very small feasible regions. OEGADO runs several GAs concurrently with eac...

One way to cope with a huge design space formed by several parameters is using methods for Automatic Design Space Exploration (ADSE). Recently we developed a Framework for Automatic Design Space Explorations focused on micro-architectural optimizations. In this article we evaluate the influence of three different evolutionary algorithms on the performance of design space explorations. More prec...

We propose a new multi-objective genetic programming (MOGP) for automatic construction of image feature extraction programs (FEPs). The proposed method was originated from a well known multiobjective evolutionary algorithm (MOEA), i.e., NSGA-II. The key differences are that redundancy-regulation mechanisms are applied in three main processes of the MOGP, i.e., population truncation, sampling, a...

In this paper, a new genetic algorithm for multi-objective optimization problems is introduced. That is called ”Neighborhood Cultivation GA (NCGA)”. In the recent studies such as SPEA2 or NSGA-II, it is demonstrated that some mechanisms are important; the mechanisms of placement in an archive of the excellent solutions, sharing without parameters, assign of fitness, selection and reflection the...

Non-dominated Sorting Genetic Algorithm (NSGA) has established itself as a benchmark algorithm for Multiobjective Optimization. The determination of pareto-optimal solutions is the key to its success. However the basic algorithm suffers from a high order of complexity, which renders it less useful for practical applications. Among the variants of NSGA, several attempts have been made to reduce ...

Multiobjective cellular genetic algorithms (MOcGAs) are variants of evolutionary computation algorithms by organizing the population into grid structures, which are usually 2D grids. This paper proposes a new MOcGA, namely cosine multiobjective cellular genetic algorithm (C-MCGA), for continuous multiobjective optimization. The CMCGA introduces two new components: a 3D grid structure and a cosi...