A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering.
Luciana S. PessoaMauricio G. C. ResendeCelso C. RibeiroPublished in: Comput. Oper. Res. (2013)
Keyphrases
- grasp with path relinking
- path relinking
- tabu search
- scatter search
- metaheuristic
- solution quality
- search procedure
- solution space
- max min
- column generation
- traveling salesman problem
- optimal solution
- nature inspired
- neighborhood search
- multi start
- simulated annealing
- feasible solution
- heuristic methods
- combinatorial optimization
- tabu search algorithm
- set covering problem
- objective function
- greedy randomized adaptive search procedure
- test instances
- vehicle routing problem
- search strategies
- linear program
- optimization problems
- scheduling problem