A GRASP with path-relinking and restarts heuristic for the prize-collecting generalized minimum spanning tree problem.
Ruslán G. MarzoCelso C. RibeiroPublished in: Int. Trans. Oper. Res. (2020)
Keyphrases
- grasp with path relinking
- prize collecting
- path relinking
- solution quality
- column generation
- metaheuristic
- tabu search
- travel time
- scatter search
- simulated annealing
- traveling salesman problem
- test problems
- optimal solution
- genetic algorithm
- test instances
- feasible solution
- search procedure
- genetic programming
- linear programming
- search algorithm
- objective function