A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem.
Viet-Phuong NguyenChristian PrinsCaroline ProdhonPublished in: Eng. Appl. Artif. Intell. (2012)
Keyphrases
- path relinking
- multi start
- iterated local search
- tabu search
- vehicle routing problem
- metaheuristic
- tabu search algorithm
- simulated annealing
- scatter search
- vehicle routing problem with time windows
- search procedure
- memetic algorithm
- feasible solution
- routing problem
- benchmark instances
- lead time
- test problems
- variable neighborhood descent
- search algorithm
- scheduling problem
- genetic algorithm
- test instances
- combinatorial optimization
- travel time
- ant colony optimization
- combinatorial optimization problems
- heuristic methods
- optimization problems
- search space
- flowshop
- search heuristics
- neural network
- particle swarm optimization
- hill climbing
- max sat
- optimal solution
- evolutionary algorithm
- solution space