An Analysis of Multiobjective Evolutionary Algorithms for Optimization Problems With Time Constraints

Problems encountered in real manufacturing environments are complex to solve optimally, and they are expected to fulfill multiple objectives. Such problems are called multi-objective optimization problems(MOPs) involving conflicting objectives. The use of multi-objective evolutionary algorithms (MOEAs) to find solutions for these problems has increased over the last decade. It has been shown that MOEAs are well-suited to search solutions for MOPs having multiple objectives. In this chapter, in addition to comprehensive information, two different MOEAs are implemented to solve a MOP for comparison purposes. One of these algorithms is the non-dominated sorting genetic algorithm (NSGA-II), the effectiveness of which has already been demonstrated in the literature for solving complex MOPs. The other algorithm is fast Pareto genetic algorithm (FastPGA), which has population regulation operator to adapt the population size. These two algorithms are used to solve a scheduling problem in a Hybrid Manufacturing System (HMS). Computational results indicate that FastPGA outperforms NSGA-II.

show abstract

An Analysis of Multiobjective Evolutionary Algorithms for Optimization Problems With Time Constraints

Cited by 3 publications

References 23 publications

Multiobjective Optimization

Multiobjective Optimization

Feature selection in high-dimensional EEG data by parallel multi-objective optimization

Evolutionary Algorithms for Multi-Objective Scheduling in a Hybrid Manufacturing System

Contact Info

Product

Resources

About