A hybrid evolutionary local search with depth first search split procedure for the heterogeneous vehicle routing problems.
Christophe DuhamelPhilippe LacommeCaroline ProdhonPublished in: Eng. Appl. Artif. Intell. (2012)
Keyphrases
- hybrid evolutionary
- metaheuristic
- depth first search
- greedy randomized adaptive search procedure
- vehicle routing problem
- routing problem
- simulated annealing
- tabu search
- evolutionary search
- search procedure
- search space
- guided local search
- combinatorial optimization
- search tree
- path relinking
- ant colony optimization
- genetic algorithm
- branch and bound
- optimization problems
- tree search
- optimal solution
- benchmark problems
- particle swarm optimization
- evolutionary algorithm
- solution space
- vehicle routing problem with time windows
- graph search
- travel time
- search algorithm
- search methods
- test problems
- hybrid algorithm
- branch and bound algorithm
- orders of magnitude
- traveling salesman problem
- spanning tree
- constraint satisfaction problems
- mathematical programming
- solution quality