On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study.
Andrzej JaszkiewiczPublished in: Eur. J. Oper. Res. (2004)
Keyphrases
- knapsack problem
- multiple objectives
- computational efficiency
- case study
- optimization problems
- optimal solution
- combinatorial optimization problems
- vehicle routing problem
- metaheuristic
- test problems
- multidimensional knapsack problem
- computationally efficient
- evolutionary algorithm
- np hard
- shortest path problem
- linear programming problems
- bi objective
- exact algorithms
- combinatorial optimization
- solution quality
- dynamic programming
- continuous relaxation
- particle swarm optimization
- linear programming relaxation
- simulated annealing
- greedy heuristic
- objective function
- decision variables
- bicriteria
- lower bound
- computational complexity
- greedy algorithm
- tabu search
- linear programming
- cost function
- maximum profit
- efficient solutions
- combinatorial problems
- neural network
- randomly generated test instances