-hub location routing problem: a Lagrangian relaxation and a hyper-heuristic approach.
Kassem DanachShahin GelarehRahimeh Neamatian MonemiPublished in: EURO J. Transp. Logist. (2019)
Keyphrases
- lagrangian relaxation
- hyper heuristics
- genetic programming
- metaheuristic
- vehicle routing problem
- evolutionary algorithm
- feasible solution
- integer programming
- timetabling problem
- examination timetabling
- difficult problems
- constraint satisfaction problems
- np hard
- branch and bound algorithm
- column generation
- tabu search
- dynamic programming
- search procedure
- lower bound
- heuristic search
- linear programming
- lower and upper bounds
- heuristic methods
- dual decomposition
- optimal solution
- constraint programming
- optimization problems
- search heuristics
- genetic algorithm
- evolutionary computation
- fitness function
- grasp with path relinking
- branch and bound
- relaxation algorithm
- routing problem
- memetic algorithm
- ant colony optimization
- simulated annealing
- upper bound
- subgradient method
- differential evolution
- constraint satisfaction
- cutting plane algorithm
- multi objective
- lagrangian heuristic