A Comparison between Two Modified NSGA-II Algorithms for Solving the Multi-objective Flexible Job Shop Scheduling Problem

Abstract

Many evolutionary algorithms have been used to solve multi-objective scheduling problems. NSGA-II is one of them that is based on the Pareto optimality concept and generally obtains good results. However, it is possible to improve its performance with some modifications. In this paper, two modified NSGA-II algorithms have been suggested for solving the multi-objective flexible job shop scheduling problem. The neighborhood structures defined for the problem are integrated into the algorithms to create better generations during the iterations. Also, their initial populations are created with an effective heuristic. In the first modified NSGA-II, after the creation of the offspring population, a neighbor of each individual in the parent population is constructed, and then one of them is selected according to the domination state of the solutions. Then the populations are merged to create a new population. In the second modified NSGA-II, only the solutions on the first and second fronts of the parent population and also their neighbors are merged with the offspring population. Other operators of the algorithms like the non-dominated sorting and calculating the crowding distances are as the classic NSGA-II. A comparison is done with a classic NSGA-II based on two metrics. The results show that as it is in the first modified NSGA-II, including neighbors of more individuals of the population provides better results because it increases diversity and intensity of the search. The performance of the second modified NSGA-II is almost similar to the NSGA-II. So, it can be concluded that although integrating the neighborhood structures can improve the performance of search, it is better to define that the structures should be applied to how many and which solutions, in otherwise the quality of search may not increase.

A Monte Carlo Simulation-Based Approach to Solve Dynamic Sectorization Problem

“…The models of this study were single-objective ones. Real SPs, like many other problems, are generally multiobjective [16,17]. In future studies, a more comprehensive multi-objective model will be proposed, which also will cover both single-objective models of this study.…”

An Adaptive Multi-Objective Evolutionary Algorithm with Two-Stage Local Search for Flexible Job-Shop Scheduling

“…The survived individuals will be participated in the next time's genetic operation. For environment selection, fitness-based [7] and dominance-based [25] selection methods have been developed and widely used in scheduling problem. Due to the advantage of dominance-based method in term of considering the tradeoff among multi-objectives, it is adopted in this paper.…”

“…In dominance-based method, crowding distance [25] is commonly used to select certain individuals from the subpopulation with the same rank. It is effective to the optimization problem with two objectives, but with three objectives it is insufficient to some extent.…”

Review on flexible job shop scheduling

“…To generate Pareto-fronts, the algorithm uses the mechanism of variable weights and random selection to change directions in search spaces. Teymourifar et al [95] proposed two modified NSGA-II algorithms to solve the MOFJSP. The neighbourhood structures in the algorithms are designed to create better offspring during the evolutionary process.…”