Routing foreseeable lightpath demands using a tabu search meta-heuristic.
Josué KuriNicolas PuechMaurice GagnaireEmmanuel DotaroPublished in: GLOBECOM (2002)
Keyphrases
- tabu search
- metaheuristic
- simulated annealing
- vehicle routing problem
- routing problem
- optimization problems
- path relinking
- ant colony optimization
- scatter search
- genetic algorithm
- combinatorial optimization
- search space
- iterated local search
- feasible solution
- routing algorithm
- memetic algorithm
- combinatorial optimization problems
- test problems
- benchmark instances
- combinatorial problems
- optimal solution
- hybrid algorithm
- solution space
- search procedure
- job shop scheduling problem
- heuristic methods
- quadratic assignment problem
- routing protocol
- shortest path
- multi start
- particle swarm optimization
- evolutionary algorithm
- guided local search
- tabu search algorithm
- max sat
- simulated annealing and tabu search
- initial solution
- variable neighborhood search
- search heuristics
- candidate list
- solution quality
- flowshop
- genetic programming
- aco algorithm
- test instances