An Interactive Regret-Based Genetic Algorithm for Solving Multi-Objective Combinatorial Optimization Problems.
Nawal BenabbouCassandre LeroyThibaut LustPublished in: AAAI (2020)
Keyphrases
- combinatorial optimization problems
- multi objective
- optimization problems
- evolutionary algorithm
- knapsack problem
- metaheuristic
- combinatorial optimization
- discrete optimization
- objective function
- ant colony optimization
- job shop scheduling
- particle swarm optimization
- multi objective optimization
- optimization algorithm
- traveling salesman problem
- multiple objectives
- online learning
- lower bound
- shortest path problem
- estimation of distribution algorithms
- conflicting objectives
- genetic algorithm
- vehicle routing problem
- continuous optimization problems
- nsga ii
- exact algorithms
- differential evolution
- fitness function
- job shop scheduling problem
- test problems
- search space
- multi objective optimization problems
- tabu search
- loss function
- genetic programming
- optimal solution
- neural network
- aco algorithms
- heuristic search
- minmax regret