On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization.
Julien RolandYves De SmetJosé Rui FigueiraPublished in: 4OR (2012)
Keyphrases
- combinatorial optimization problems
- multi objective
- optimization problems
- discrete optimization
- evolutionary algorithm
- combinatorial optimization
- optimization algorithm
- estimation of distribution algorithms
- metaheuristic
- multiple objectives
- objective function
- knapsack problem
- evolutionary optimization
- conflicting objectives
- multiobjective optimization
- traveling salesman problem
- nsga ii
- multi objective optimization
- ant colony optimization
- particle swarm optimization
- job shop scheduling
- optimum design
- particle swarm
- continuous optimization problems
- shortest path problem
- multi objective optimization problems
- evolutionary computation
- job shop scheduling problem
- optimization method
- genetic algorithm
- simulated annealing
- vehicle routing problem
- benchmark problems
- branch and bound
- differential evolution
- greedy algorithm
- optimization methods
- fitness function
- feature subset selection
- branch and bound algorithm
- tabu search
- genetic programming
- linear programming
- special case
- search strategies
- search space