NSGA-II algorithm and application for multi-objective flexible workshop scheduling

Abstract

Based on the study of multi-objective flexible workshop scheduling problem and the learning of traditional genetic algorithm, a non-dominated sorting genetic algorithm is proposed to solve and optimize the scheduling model with the objective functions of processing cycle, advance/delay penalty and processing cost. In the process of optimization, non-dominated fast ranking operator and competition operator are used to select the descendant operator, which improves the computational efficiency and optimization ability of the algorithm. Non-repetitive non-dominant solutions and frontier sets are found in the iteration operation to retain the optimal results. Finally, taking a manufacturing workshop as an example, the practicability of the proposed algorithm is verified by the simulation operation of the workshop scheduling information and the comparison with other algorithms. The results show that the algorithm can obtain the optimal solution more quickly than the unimproved algorithm. The improved algorithm is faster and more effective in searching, and has certain feasibility in solving the job shop scheduling problem, which is more suitable for industrial processing and production.

Managing Interdependence-Induced Systemic Risks in Infrastructure Projects

“…As a stochastic procedure, metaheuristic optimization presents a powerful technique for computing near-optimal solutions to such problems (Elbeltagi et al 2005;Zhang et al 2006;Bozorg-Haddad et al 2017). Within metaheuristic techniques, genetic algorithms have been shown to be very efficient (Owais 2014) and have been utilized to solve challenging multiobjective optimization problems (Yusoff et al 2011;Rajkumar et al 2014;Yahui et al 2020). The nondominated sorting genetic algorithm (NSGA-II) is an example of such techniques where it has been employed to solve multiobjective schedule optimization-related problems (Vanucci et al 2012;Polat et al 2015).…”

Optimization of Image Processing Algorithms for Character Recognition in Cultural Typewritten Documents

“…NSGA-II is the standard metaheuristic for solving multi-objective optimization problems [29]. It has been applied to various search and optimization problems, such as scheduling problems [45], resource allocation problems [19], and optimal parameter selection problems [39]. The algorithm modifies the processes of mating and survival selection of individuals.…”

Flexible job-shop rescheduling based multi-agent system considering TOU electricity price

“…For example, Tang et al [9] proposed the use of a HTLBO algorithm, which has been shown to perform better than other traditional heuristic algorithms. Wang et al [10] proposed a non-dominated sorting genetic algorithm to solve the multi-objective flexible job-shop scheduling problem and optimize the scheduling model with periodicity. Other algorithms include Particle Swarm Optimization (PSO) and Artificial Bee Colony optimization (ABC).…”