A tabu search for the design of capacitated rooted survivable planar networks.
Alain HertzThomas RidremontPublished in: J. Heuristics (2020)
Keyphrases
- tabu search
- vehicle routing problem
- simulated annealing
- metaheuristic
- path relinking
- scheduling problem
- feasible solution
- memetic algorithm
- genetic algorithm
- quadratic assignment problem
- network design problem
- network design
- search algorithm
- job shop scheduling problem
- multi start
- scatter search
- max sat
- test problems
- np hard
- initial solution
- candidate list
- neural network
- benchmark instances
- lot sizing
- traveling salesman problem
- heuristic methods
- variable neighborhood search
- hybrid algorithm
- iterated local search