Search

Many multi-objective evolutionary algorithms (MOEAs) can converge to the Pareto optimal front and work well on two or three objectives, but they deteriorate when faced with many-objective problems. Indicator-based MOEAs, which adopt various indicators to evaluate the fitness values (instead of the Pareto-dominance relation to select candidate solutions), have been regarded as promising schemes that yield more satisfactory results than well-known algorithms, such as non-dominated sorting genetic algorithm (NSGA-II) and strength Pareto evolutionary algorithm (SPEA2). However, they can suffer from having a slow convergence speed. This paper proposes a new indicator-based multi-objective optimization algorithm, namely, the multi-objective shuffled frog leaping algorithm based on the ε indicator (ε-MOSFLA). This algorithm adopts a memetic meta-heuristic, namely, the SFLA, which is characterized by the powerful capability of global search and quick convergence as an evolutionary strategy and a simple and effective ε-indicator as a fitness assignment scheme to conduct the search procedure. Experimental results, in comparison with other representative indicator-based MOEAs and traditional Pareto-based MOEAs on several standard test problems with up to 50 objectives, show that ε-MOSFLA is the best algorithm for solving many-objective optimization problems in terms of the solution quality as well as the speed of convergence. [ABSTRACT FROM AUTHOR]

Optimization of architecture design has recently drawn research interest. System deployment optimization (SDO) refers to the process of optimizing systems that are being deployed to activities. This paper first formulates a mathematical model to theorize and operationalize the SDO problem and then identifies optimal solutions to solve the SDO problem. In the solutions, the success rate of the combat task is maximized, whereas the execution time of the task and the cost of changes in the system structure are minimized. The presented optimized algorithm generates an optimal solution without the need to check the entire search space. A novel method is finally proposed based on the combination of heuristic method and genetic algorithm (HGA), as well as the combination of heuristic method and particle swarm optimization (HPSO). Experiment results show that the HPSO method generates solutions faster than particle swarm optimization (PSO) and genetic algorithm (GA) in terms of execution time and performs more efficiently than the heuristic method in terms of determining the best solution. [ABSTRACT FROM AUTHOR]