Iterated Local Search and Column Generation to solve Arc-Routing as a permutation set-covering problem.
Daniel PorumbelGilles GoncalvesHamid AllaouiTienté HsuPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- column generation
- set covering problem
- vehicle routing problem with time windows
- iterated local search
- integer program
- exact solution
- set covering
- multi start
- branch and bound
- linear programming
- integer programming
- linear program
- cutting plane
- optimal solution
- metaheuristic
- constraint programming
- lagrangian relaxation
- tabu search
- routing problem
- mixed integer programming
- branch and bound algorithm
- vehicle routing problem
- upper bound
- neural network
- mathematical programming
- ad hoc networks
- bi objective
- feasible solution
- valid inequalities
- shortest path