Two-level iterated local search for WDM network design problem with traffic grooming.
Xinyun WuZhipeng LüQi GuoTao YePublished in: Appl. Soft Comput. (2015)
Keyphrases
- network design problem
- iterated local search
- transportation networks
- metaheuristic
- tabu search
- multi start
- vehicle routing problem
- vehicle routing problem with time windows
- travel time
- traveling salesman problem
- network design
- approximation algorithms
- road network
- valid inequalities
- ant colony optimization
- branch and bound
- mixed integer programming
- simulated annealing
- mixed integer
- combinatorial optimization
- minimal cost
- lagrangian relaxation
- network traffic
- optimization problems
- flowshop
- feasible solution
- optimal solution
- global optimization
- search space
- integer programming
- particle swarm optimization
- traffic flow
- shortest path
- np hard
- search algorithm
- lower and upper bounds
- benchmark problems
- worst case
- scheduling problem
- lower bound