On the Performance of Generational and Steady-State MOEA/D in the Multi-Objective 0/1 Knapsack Problem.
Saúl Zapotecas MartínezAdriana Menchaca-MendezPublished in: CEC (2020)
Keyphrases
- steady state
- knapsack problem
- multi objective
- nsga ii
- evolutionary algorithm
- optimization problems
- multi objective optimization
- markov chain
- test problems
- optimal solution
- optimization algorithm
- multiobjective evolutionary algorithm
- dynamic programming
- multiobjective optimization
- objective function
- multiple objectives
- particle swarm optimization
- multi objective evolutionary algorithms
- genetic algorithm
- product form
- explicit expressions
- np hard
- queue length
- operating conditions
- greedy algorithm
- pareto optimal
- bi objective
- queueing model
- pareto optimal solutions
- bicriteria
- queueing networks
- heavy traffic
- arrival rate
- multi objective problems
- arrival process
- service times
- metaheuristic
- queue size
- linear programming
- maximum profit
- steady states