A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem.
Xiangyong LiStephen C. H. LeungPeng TianPublished in: Expert Syst. Appl. (2012)
Keyphrases
- vehicle routing problem
- tabu search algorithm
- tabu search
- test instances
- metaheuristic
- benchmark instances
- neighborhood search
- memetic algorithm
- routing problem
- simulated annealing
- scatter search
- vehicle routing
- feasible solution
- travel time
- scheduling problem
- logistics distribution
- traveling salesman problem
- path relinking
- np hard
- benchmark problems
- search strategies
- particle swarm optimization
- test problems
- search algorithm
- combinatorial optimization problems
- job shop scheduling problem
- heuristic methods
- genetic algorithm
- combinatorial optimization
- variable neighborhood search
- search procedure
- solution quality
- knapsack problem
- optimization problems
- lower bound
- objective function
- neural network