Combination of Metaheuristic and Exact Algorithms for Solving Set Covering-Type Optimization Problems.
Ibrahim MuterS. Ilker BirbilGüvenç SahinPublished in: INFORMS J. Comput. (2010)
Keyphrases
- metaheuristic
- exact algorithms
- combinatorial optimization
- optimization problems
- set covering
- combinatorial optimization problems
- combinatorial problems
- knapsack problem
- nonlinear programming
- benchmark instances
- traveling salesman problem
- ant colony optimization
- simulated annealing
- evolutionary algorithm
- tabu search
- column generation
- vehicle routing problem with time windows
- exact solution
- mathematical programming
- vehicle routing problem
- branch and bound
- branch and bound algorithm
- integer programming
- objective function
- optimal solution
- search space
- search methods
- integer program
- mip solver
- particle swarm optimization
- test problems
- max sat
- benchmark problems
- exact methods
- neural network
- combinatorial auctions
- dynamic programming
- cost function
- genetic algorithm
- lower bound
- suboptimal solutions