Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem.
Amir SalehipourKenneth SörensenPeter GoosOlli BräysyPublished in: 4OR (2011)
Keyphrases
- tabu search
- metaheuristic
- multi start
- variable neighborhood search
- grasp with path relinking
- iterated local search
- path relinking
- simulated annealing
- genetic algorithm
- scheduling problem
- cost effective
- combinatorial optimization
- neural network
- traveling salesman problem
- solution quality
- data sets
- lower bound
- search algorithm