A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem.
Christos D. TarantilisChris T. KiranoudisVassilios S. VassiliadisPublished in: Eur. J. Oper. Res. (2004)
Keyphrases
- vehicle routing problem
- metaheuristic
- threshold accepting
- tabu search
- simulated annealing
- harmony search
- scatter search
- optimization problems
- ant colony optimization
- vehicle routing
- routing problem
- combinatorial optimization
- combinatorial optimization problems
- vehicle routing problem with time windows
- hybrid metaheuristic
- particle swarm optimization
- genetic algorithm
- search space
- test instances
- optimal solution
- path relinking
- iterated local search
- travel time
- memetic algorithm
- search methods
- solution space
- benchmark instances
- guided local search
- optimization method
- variable neighborhood search
- job shop scheduling problem
- hyper heuristics
- feasible solution
- nature inspired
- test problems
- branch and bound algorithm
- neural network
- traveling salesman problem
- multi start
- constraint satisfaction
- optimization algorithm
- greedy randomized adaptive search procedure