An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: A computational study and comparison with meta-heuristics.
George MavrotasKostas FloriosJosé Rui FigueiraPublished in: Appl. Math. Comput. (2015)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- multi dimensional
- optimization problems
- optimal solution
- metaheuristic
- multi objective
- ant colony optimization
- optimization algorithm
- dynamic programming
- np hard
- cost function
- test problems
- simulated annealing
- computational complexity
- combinatorial optimization
- implicit enumeration
- benchmark problems
- multiple objectives
- exact algorithms
- greedy heuristic
- learning algorithm
- particle swarm optimization
- linear programming
- evolutionary algorithm
- search space
- objective function
- cutting plane
- bicriteria
- traveling salesman problem
- job shop scheduling problem
- genetic algorithm