A meta-heuristic approach for solving the Urban Network Design Problem.
Mariano GalloLuca D'AciernoBruno MontellaPublished in: Eur. J. Oper. Res. (2010)
Keyphrases
- metaheuristic
- network design problem
- combinatorial optimization
- branch and bound
- transportation networks
- ant colony optimization
- traveling salesman problem
- simulated annealing
- tabu search
- optimal solution
- optimization problems
- mip solver
- network design
- approximation algorithms
- search space
- combinatorial problems
- genetic algorithm
- mixed integer
- minimal cost
- travel time
- mixed integer programming
- vehicle routing problem
- column generation
- branch and bound algorithm
- integer programming
- mathematical programming
- particle swarm optimization
- np hard
- neural network
- lp relaxation
- evolutionary algorithm