Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty.
Iago A. CarvalhoThiago F. NoronhaChristophe DuhamelPublished in: RAIRO Oper. Res. (2022)
Keyphrases
- interval data
- minmax regret
- integer programming problems
- artificial bee colony algorithm
- linear programming
- shortest path problem
- cutting plane
- branch and bound
- data clustering
- particle swarm optimization algorithm
- combinatorial optimization
- metaheuristic
- temporal data
- single machine scheduling problem
- tabu search
- particle swarm optimization
- optimal solution
- combinatorial optimization problems
- evolutionary algorithm
- valid inequalities
- simulated annealing
- cost function
- feasible solution
- shortest path
- column generation
- optimization problems
- artificial bee colony
- optimization criterion
- lower bound
- neural network
- objective function