The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic.
Broderick CrawfordRicardo SotoWenceslao PalmaFernando ParedesFranklin JohnsonEnrique NoreroPublished in: MCO (2) (2015)
Keyphrases
- metaheuristic
- set covering problem
- ant colony optimization
- combinatorial optimization
- bi objective
- branch and bound algorithm
- column generation
- optimal solution
- integer program
- set partitioning
- optimization problems
- set covering
- tabu search
- branch and bound
- scatter search
- combinatorial optimization problems
- simulated annealing
- integer programming
- ant colony optimization metaheuristic
- mip solver
- swarm intelligence
- aco algorithm
- search space
- genetic algorithm
- traveling salesman problem
- path relinking
- nature inspired
- vehicle routing problem
- lp relaxation
- particle swarm optimization
- exact solution
- linear program
- mixed integer program
- ant colony optimization algorithm
- ant colony optimisation
- variable neighborhood search
- benchmark instances
- feasible solution
- linear programming
- valid inequalities
- single machine scheduling problem
- aco algorithms
- test problems
- mathematical programming
- lower bound
- hybrid metaheuristic
- memetic algorithm
- mixed integer
- exact algorithms
- lagrangian relaxation
- heuristic search
- objective function