An optimization algorithm for solving the rich vehicle routing problem based on Variable Neighborhood Search and Tabu Search metaheuristics.
Juan Antonio SiciliaCarlos QuemadaBeatriz RoyoDavid EscuínPublished in: J. Comput. Appl. Math. (2016)
Keyphrases
- optimization algorithm
- variable neighborhood search
- tabu search
- vehicle routing problem
- metaheuristic
- benchmark instances
- combinatorial optimization
- simulated annealing
- multi objective
- hybrid metaheuristic
- neighborhood search
- path relinking
- routing problem
- optimization method
- scheduling problem
- memetic algorithm
- feasible solution
- search algorithm
- genetic algorithm
- heuristic methods
- hybrid algorithm
- differential evolution
- vehicle routing problem with time windows
- iterated local search
- test instances
- combinatorial optimization problems
- job shop scheduling problem
- search procedure
- travel time
- particle swarm optimization pso
- scatter search
- evolutionary algorithm
- search space
- initial solution
- traveling salesman problem
- test problems
- particle swarm optimization
- artificial bee colony
- combinatorial problems
- optimization problems
- hill climbing
- np hard
- benchmark problems
- constraint satisfaction
- nature inspired
- knapsack problem
- single machine