Balancing Pareto Front exploration of Non-dominated Tournament Genetic Algorithm (B-NTGA) in solving multi-objective NP-hard problems with constraints.
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
- nsga ii
- optimization algorithm
- graph coloring
- objective function
- multiobjective optimization
- particle swarm optimization
- combinatorial problems
- knapsack problem
- np hard
- multiple objectives
- search heuristics
- global constraints
- fitness function
- pareto optimal
- pareto optimal solutions
- constrained optimization
- genetic algorithm ga
- constraint satisfaction
- constraint satisfaction problems
- simulated annealing
- dynamic programming
- artificial bee colony
- combinatorial optimization
- integer programming
- evolutionary computation
- constraint solver
- neural network
- optimal solution
- multi objective evolutionary algorithms
- constraint propagation
- search strategies
- ant colony optimization
- state space
- search algorithm