An iterated metaheuristic for the directed network design problem with relays.
Xiangyong LiShaochong LinSi ChenYash P. AnejaPeng TianYouzhi CuiPublished in: Comput. Ind. Eng. (2017)
Keyphrases
- metaheuristic
- network design problem
- branch and bound
- combinatorial optimization
- search space
- network design
- approximation algorithms
- tabu search
- optimization problems
- optimal solution
- simulated annealing
- ant colony optimization
- transportation networks
- genetic algorithm
- minimal cost
- mixed integer
- integer programming
- valid inequalities
- mixed integer programming
- traveling salesman problem
- vehicle routing problem
- np hard
- particle swarm optimization
- lagrangian relaxation
- evolutionary algorithm
- exact solution
- travel time
- special case
- branch and bound algorithm
- worst case
- neural network