A hybrid simulated annealing for capacitated vehicle routing problems with the independent route length.
Reza Tavakkoli-MoghaddamNima SafaeiY. GholipourPublished in: Appl. Math. Comput. (2006)
Keyphrases
- vehicle routing problem
- simulated annealing
- tabu search
- metaheuristic
- travel time
- benchmark problems
- pick up and delivery
- vehicle routing problem with simultaneous
- routing problem
- combinatorial optimization
- greedy randomized adaptive search procedure
- vehicle routing problem with time windows
- evolutionary algorithm
- test instances
- benchmark instances
- memetic algorithm
- neighborhood search
- genetic algorithm
- hill climbing
- feasible solution
- solution quality
- path relinking
- solution space
- ant colony optimization
- traveling salesman problem
- multi depot
- search procedure
- job shop scheduling problem
- optimization problems
- hybrid algorithm
- genetic algorithm ga
- scatter search
- scheduling problem
- np hard
- search space
- particle swarm optimization pso
- knapsack problem
- multi objective
- heuristic methods
- max sat
- particle swarm optimization
- waste collection