Bi-level multi-objective combinatorial optimization using reference approximation of the lower level reaction.
Malek AbbassiAbir ChaabaniLamjed Ben SaidNabil AbsiPublished in: KES (2020)
Keyphrases
- combinatorial optimization
- lower level
- bi level
- multi objective
- higher level
- evolutionary algorithm
- simulated annealing
- combinatorial optimization problems
- optimization problems
- low level
- upper level
- metaheuristic
- gray scale
- optimization algorithm
- traveling salesman problem
- multi objective optimization
- high level
- combinatorial problems
- particle swarm optimization
- genetic algorithm
- pricing model
- optimality conditions
- mathematical programming
- branch and bound
- objective function
- branch and bound algorithm
- submodular functions
- image compression
- hard combinatorial optimization problems
- nsga ii
- estimation of distribution algorithms
- exact algorithms
- multi objective evolutionary algorithms
- quadratic assignment problem
- vehicle routing problem
- evolutionary computation
- max flow min cut
- approximation algorithms
- solution quality
- benchmark problems
- graph cuts
- markov random field
- color images
- image processing