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

We apply the NSGA-II algorithm and its controlled elitist version NSGA-IIc for the intensity modulated beam radiotherapy dose optimization problem. We compare the performance of the algorithms with objectives for which deterministic optimization methods provide global optimal solutions. The number of parameters to be optimized can be up to a few thousands and the number of objectives varies fro...

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

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