A metaheuristic approach to the discrete network design problem based on the demand uncertainty.
Lang FanXinxin YuChangzhi BianHuapu LuPublished in: ICNC (2011)
Keyphrases
- metaheuristic
- network design problem
- branch and bound
- combinatorial optimization
- tabu search
- search space
- simulated annealing
- optimization problems
- network design
- approximation algorithms
- optimal solution
- ant colony optimization
- mixed integer programming
- genetic algorithm
- mixed integer
- vehicle routing problem
- particle swarm optimization
- column generation
- branch and bound algorithm
- integer programming
- np hard
- search algorithm
- service level
- production cost
- valid inequalities
- evolutionary algorithm
- lot sizing
- linear program
- multistage
- lagrangian relaxation
- cost function