Solving Multiobjective Knapsack Problem Using Scalarizing Function Based Local Search.
Imen Ben MansourInès AlayaMoncef TaginaPublished in: ICSOFT (Selected Papers) (2017)
Keyphrases
- knapsack problem
- multi objective
- multiple objectives
- search heuristics
- optimal solution
- evolutionary algorithm
- optimization problems
- implicit enumeration
- combinatorial optimization
- randomly generated test instances
- genetic algorithm
- objective function
- combinatorial optimization problems
- optimization algorithm
- linear programming problems
- multi objective optimization
- dynamic programming
- bi objective
- test problems
- integer variables
- nsga ii
- particle swarm optimization
- multiobjective optimization
- np hard
- lp relaxation
- selection operator
- multidimensional knapsack problem
- exact algorithms
- greedy algorithm
- search space
- metaheuristic
- branch and bound
- tabu search
- search algorithm
- cost function
- linear programming relaxation
- decision variables
- artificial bee colony
- learning algorithm
- fitness function
- lower bound
- job shop scheduling problem
- traveling salesman problem
- vehicle routing problem
- continuous relaxation
- machine learning