Tabu search embedded simulated annealing for the shortest route cut and fill problem.
Andrew LimBrian RodriguesJ. ZhangPublished in: J. Oper. Res. Soc. (2005)
Keyphrases
- tabu search
- simulated annealing
- metaheuristic
- shortest path
- path relinking
- genetic algorithm
- feasible solution
- hybrid algorithm
- search procedure
- benchmark problems
- solution quality
- test problems
- heuristic methods
- evolutionary algorithm
- genetic algorithm ga
- vehicle routing problem
- job shop scheduling problem
- memetic algorithm
- combinatorial optimization
- solution space
- optimization method
- travel time
- iterated local search
- multidimensional knapsack problem
- tabu search algorithm
- scatter search
- scheduling problem
- hill climbing
- benchmark instances
- quadratic assignment problem
- search algorithm
- multi objective
- computational complexity
- neural network
- search heuristics
- neighborhood search
- starting point
- routing protocol