| Algorithm 1: NSGA-II-based Solving | ||
| Input: , , other evolutionary parameters | ||
| Output: Pareto optimal solution set | ||
| 1 Initialize population; | ||
| 2 while Termination criteria not met do | ||
| 3 | ![]() |
Elitist selection technique; |
| 4 | Generic operations; | |
| 5 | Objectives evaluation; | |
| 6 | Fast nondominated sorting; | |
| 7 | Crowding distance assignment; | |
| 8 end | ||
