A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem.
Dimitris C. ParaskevopoulosTolga BektasTeodor Gabriel CrainicChris N. PottsPublished in: Eur. J. Oper. Res. (2016)
Keyphrases
- network flow problem
- multi commodity
- network design problem
- evolutionary algorithm
- heuristic solution
- network design
- approximation algorithms
- optimization problems
- minimal cost
- mixed integer programming
- branch and bound
- simulated annealing
- transportation networks
- mixed integer
- valid inequalities
- integer programming
- genetic algorithm
- lagrangian relaxation
- neural network
- road network
- traveling salesman problem
- endpoints
- constraint satisfaction
- dynamic programming
- search algorithm