A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem.
Theodoros P. GevezesLeonidas S. PitsoulisPublished in: J. Comb. Optim. (2015)
Keyphrases
- path relinking
- scatter search
- tabu search
- metaheuristic
- max min
- search procedure
- traveling salesman problem
- nature inspired
- multi start
- shortest path
- combinatorial optimization
- grasp with path relinking
- solution space
- simulated annealing
- neighborhood search
- search space
- optimal solution
- ant colony optimization
- test problems
- search algorithm
- genetic algorithm
- solution quality
- particle swarm optimization
- evolutionary algorithm
- tabu search algorithm