Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms.
Kostas FloriosGeorge MavrotasDanae DiakoulakiPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- mathematical programming
- evolutionary algorithm
- multi objective
- knapsack problem
- optimization problems
- combinatorial optimization
- nsga ii
- metaheuristic
- combinatorial optimization problems
- simulated annealing
- multi objective optimization
- traveling salesman problem
- optimization algorithm
- test problems
- nonlinear programming
- multiple objectives
- multiobjective evolutionary algorithms
- multiobjective optimization
- implicit enumeration
- genetic algorithm
- vehicle routing problem
- exact algorithms
- linear programming
- differential evolution
- particle swarm optimization
- multiobjective evolutionary algorithm
- branch and bound
- optimization methods
- ant colony optimization
- linear programming relaxation
- fitness function
- conflicting objectives
- optimal solution
- production planning
- mixed integer linear
- branch and bound algorithm
- cutting plane
- differential evolution algorithm
- crossover operator
- genetic algorithm ga
- objective function
- search algorithm
- tabu search
- multi objective evolutionary algorithms
- dynamic programming
- neural network