A General Interactive Approach for Solving Multi-Objective Combinatorial Optimization Problems with Imprecise Preferences.
Nawal BenabbouThibaut LustPublished in: SOCS (2019)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- multi objective
- discrete optimization
- continuous optimization problems
- optimization problems
- evolutionary algorithm
- knapsack problem
- job shop scheduling
- shortest path problem
- traveling salesman problem
- job shop scheduling problem
- metaheuristic
- multiple objectives
- special case
- ant colony optimization
- multi objective optimization
- genetic algorithm
- branch and bound algorithm
- optimization algorithm
- nsga ii
- exact algorithms
- particle swarm optimization
- linear programming
- decision makers
- estimation of distribution algorithms
- simulated annealing
- decision making