Corrigendum to "Balancing Pareto Front exploration of Non-dominated Tournament Genetic Algorithm (B-NTGA) in solving multi-objective NP-hard problems with constraints" [Inform. Sci., 667 (2024) 120400].
Michal AntkiewiczPawel B. MyszkowskiPublished in: Inf. Sci. (2024)
Keyphrases
- multi objective
- np hard problems
- genetic algorithm
- constraint programming
- multi objective optimization
- evolutionary algorithm
- combinatorial search
- optimization algorithm
- graph coloring
- combinatorial problems
- multiobjective optimization
- objective function
- particle swarm optimization
- multiple objectives
- nsga ii
- np hard
- knapsack problem
- evolutionary computation
- pareto optimal
- differential evolution
- constraint solver
- search heuristics
- genetic programming
- constrained optimization
- constraint satisfaction
- fitness function
- pareto optimal solutions
- constraint solving
- multi objective problems
- global constraints
- tabu search
- constraint satisfaction problems
- multi objective evolutionary algorithms
- search strategies
- search strategy
- particle swarm optimization pso
- combinatorial optimization
- optimization problems
- simulated annealing