Combinatorial optimization problems with uncertain costs and the OWA criterion.
Adam KasperskiPawel ZielinskiPublished in: Theor. Comput. Sci. (2015)
Keyphrases
- combinatorial optimization problems
- minmax regret
- knapsack problem
- optimization criterion
- optimization problems
- combinatorial optimization
- discrete optimization
- metaheuristic
- ant colony optimization
- shortest path problem
- traveling salesman problem
- interval data
- job shop scheduling
- total cost
- continuous optimization problems
- incomplete information
- job shop scheduling problem
- aggregation operators
- min cost
- decision making
- result merging
- vehicle routing problem
- neural network
- utility function
- evolutionary algorithm
- search space
- genetic algorithm
- data structure
- classifier fusion
- objective function
- search algorithm