Identifying preferred solutions to Multi-Objective Binary Optimisation problems, with an application to the Multi-Objective Knapsack Problem.
Nikolaos ArgyrisJosé Rui FigueiraAlec MortonPublished in: J. Glob. Optim. (2011)
Keyphrases
- multi objective
- knapsack problem
- optimisation problems
- particle swarm
- multiple objectives
- bi objective
- evolutionary algorithm
- optimization problems
- optimal solution
- benchmark problems
- multi objective optimization problems
- multidimensional knapsack problem
- nsga ii
- optimization algorithm
- multi objective optimization
- objective function
- evolutionary computation
- genetic algorithm
- particle swarm optimization
- combinatorial optimization problems
- exact algorithms
- optimisation algorithm
- test problems
- multi objective evolutionary algorithms
- particle swarm optimisation
- ant colony optimisation
- differential evolution
- dynamic programming
- np hard
- search capabilities
- metaheuristic
- integer variables
- linear programming relaxation
- maximum profit
- neural network
- ant colony
- solution quality
- greedy algorithm
- optimization method
- linear programming
- lower bound