A hybrid simulated annealing and column generation approach for capacitated multicommodity network design.
Masoud YaghiniMohadeseh RahbarMohammad KarimiPublished in: J. Oper. Res. Soc. (2013)
Keyphrases
- column generation
- network design
- network design problem
- simulated annealing
- fixed charge
- branch and bound
- facility location
- hybrid meta heuristic
- mixed integer programming
- linear programming
- combinatorial optimization
- integer programming
- lagrangian relaxation
- valid inequalities
- grasp with path relinking
- heuristic solution
- linear program
- set partitioning
- network flow problem
- integer program
- exact solution
- optimal solution
- dantzig wolfe decomposition
- communication networks
- constraint programming
- tabu search
- cutting plane
- network architecture
- vehicle routing problem with time windows
- metaheuristic
- vehicle routing
- solution quality
- benchmark problems
- genetic algorithm
- upper bound
- evolutionary algorithm
- np hard
- routing problem
- lot sizing
- branch and bound algorithm
- intrusion detection
- search algorithm