Network design problem with relays: A genetic algorithm with a path-based crossover and a set covering formulation.
Abdullah KonakPublished in: Eur. J. Oper. Res. (2012)
Keyphrases
- set covering
- network design problem
- genetic algorithm
- integer programming
- valid inequalities
- heuristic solution
- column generation
- integer program
- mixed integer
- set covering problem
- mixed integer programming
- branch and bound
- approximation algorithms
- crossover operator
- np hard
- lagrangian relaxation
- network design
- simulated annealing
- evolutionary algorithm
- lp relaxation
- linear programming
- fitness function
- cutting plane
- transportation networks
- multi objective
- linear program
- minimal cost
- network flow
- optimal solution
- production planning
- ant colony optimization
- metaheuristic
- constraint programming
- combinatorial auctions
- neural network
- branch and bound algorithm
- objective function
- tabu search
- artificial neural networks
- feasible solution
- supply chain
- special case
- multi objective optimization
- upper bound
- differential evolution
- traveling salesman problem