Heuristic Initialization and Knowledge-based Mutation for Large-Scale Multi-Objective 0-1 Knapsack Problems.
Cheng GongYang NanLie Meng PangHisao IshibuchiQingfu ZhangPublished in: GECCO (2024)
Keyphrases
- knapsack problem
- multi objective
- evolutionary algorithm
- optimization problems
- nsga ii
- exact algorithms
- optimal solution
- linear programming relaxation
- mutation operator
- greedy heuristic
- randomly generated test instances
- genetic algorithm
- multiple objectives
- multi objective optimization
- dynamic programming
- simulated annealing
- optimization algorithm
- test problems
- objective function
- combinatorial optimization problems
- maximum profit
- differential evolution
- bi objective
- combinatorial optimization
- production planning
- fitness function
- crossover operator
- particle swarm optimization
- tabu search
- np hard
- candidate solutions
- metaheuristic
- conflicting objectives
- genetic programming
- multi objective optimization problems
- greedy algorithms
- solution quality
- greedy algorithm
- search algorithm
- cutting plane
- feasible solution
- column generation
- multi objective evolutionary algorithms
- bicriteria
- branch and bound
- traveling salesman problem
- machine learning
- genetic algorithm ga
- constraint satisfaction
- population size
- branch and bound algorithm
- heuristic methods
- search space
- vehicle routing problem