Approximating the Pareto frontier for a challenging real-world bi-objective covering problem.
Nils-Hassan QuttinehUledi NguloTorbjörn LarssonPublished in: INFOR Inf. Syst. Oper. Res. (2022)
Keyphrases
- bi objective
- challenging real world
- pareto frontier
- multi objective
- efficient solutions
- multi objective optimization
- multiple objectives
- ant colony optimization
- network design
- shortest path problem
- neural network
- nsga ii
- knapsack problem
- multiobjective optimization
- evolutionary algorithm
- particle swarm optimization
- shortest path
- dynamic programming
- genetic algorithm
- real world