A simulated annealing heuristic for the hybrid vehicle routing problem.
Vincent F. YuA. A. N. Perwira RediYosi Agustina HidayatOktaviyanto Jimat WibowoPublished in: Appl. Soft Comput. (2017)
Keyphrases
- vehicle routing problem
- simulated annealing
- tabu search
- metaheuristic
- benchmark problems
- greedy randomized adaptive search procedure
- combinatorial optimization
- benchmark instances
- solution quality
- test instances
- routing problem
- multi depot
- vehicle routing
- feasible solution
- vehicle routing problem with time windows
- hybrid metaheuristic
- iterated local search
- neighborhood search
- genetic algorithm
- path relinking
- job shop scheduling problem
- search procedure
- evolutionary algorithm
- hill climbing
- heuristic methods
- tree search algorithm
- hybrid algorithm
- memetic algorithm
- solution space
- scatter search
- variable neighborhood search
- travel time
- genetic algorithm ga
- traveling salesman problem
- ant colony optimization
- scheduling problem
- search methods
- multi start
- logistics distribution
- special case
- optimal solution
- particle swarm optimization pso
- neural network
- test collection
- branch and bound
- search algorithm
- upper bound
- pick up and delivery
- optimization problems
- worst case