In this paper, a GPGPU (general purpose graphics processing unit) compatible Archived based Stochastic Ranking Evolutionary Algorithm (G-ASREA) is proposed, that ranks the population with respect to an archive of non-dominated solutions. It reduces the complexity of the deterministic ranking operator from O(mn) to O(man) and further speeds up ranking on GPU. Experiments compare G-ASREA with a C...

Obtaining a well distributed non-dominated Pareto front is one of the key issues in multi-objective optimization algorithms. This paper proposes a new variant for the elitist selection operator to the NSGA-II algorithm, which promotes well distributed non-dominated fronts. The basic idea is to replace the crowding distance method by a maximin technique. The proposed technique is deployed in wel...

An improved harmony search algorithm for constrained multi-objective optimization problems is proposed in this paper. Inspired by Particle Swarm Optimization, an inductor particle is introduced to speed up the convergence rate of the CMOHS. Two populations are adopted to increase the opportunity of finding the optimal solutions. Numerical experiments are divided into two parts: the first one co...

In this paper, we propose a novel approach based on NSGA-II to address the problem of optimizing the aggregation of three different basic similarity measures (syntactic measure, linguistic measure and taxonomy-based measure) and get a single similarity metric. Comparing with conventional genetic algorithm, the proposed method is able to realize three goals simultaneously, i.e., maximizing the a...

A kind of unrelated parallel machines scheduling problem is discussed. The memberships of fuzzy due dates denote the grades of satisfaction with respect to completion times with jobs. Objectives of scheduling are to maximize the minimum grade of satisfaction while makespan is minimized in the meantime. Two kind of genetic algorithms are employed to search optimal solution set of the problem. Bo...

In this paper, we propose a new genetic algorithm for multi-objective optimization problems. That is called “Neighborhood Cultivation Genetic Algorithm (NCGA)”. NCGA includes the mechanisms of other methods such as SPEA2 and NSGA-II. Moreover, NCGA has the mechanism of neighborhood crossover. Because of the neighborhood crossover, the effective search can be performed and good results can be de...

Most multiobjective evolutionary algorithms are based on Pareto dominance for measuring the quality of solutions during their search, among them NSGA-II is well-known. A very few algorithms are based on decomposition and implicitly or explicitly try to optimize aggregations of the objectives. MOEA/D is a very recent such an algorithm. One of the major advantages of MOEA/D is that it is very eas...

An improved harmony search algorithm for constrained multi-objective optimization problems is proposed in this paper. Inspired by Particle Swarm Optimization, an inductor particle is introduced to speed up the convergence rate of the CMOHS. Two populations are adopted to increase the opportunity of finding the optimal solutions. Numerical experiments are divided into two parts: the first one co...

Cooperative coevolutionary evolutionary algorithms differ from standard evolutionary algorithms architecture in that the population is split into subpopulations, each of them optimising only a subvector of the global solution vector. All subpopulations cooperate by broadcasting their local partial solutions such that each subpopulation can evaluate complete solutions. Cooperative coevolution ha...

In an emergency situation (e.g., tsunami, chemical spill, fire) it may be necessary to displace people to safer locations. Evacuation plans must be prepared so that these movements are properly organized. Based on the ACO (ant colony optimization) meta-heuristic we design a computational model to optimize a multi-objective path-finding associated to an evacuation planning problem. The results a...