Local search-based metaheuristics for the split delivery vehicle routing problem.
Ulrich DerigsB. LiUlrich VogelPublished in: J. Oper. Res. Soc. (2010)
Keyphrases
- vehicle routing problem
- tabu search
- vehicle routing problem with simultaneous
- memetic algorithm
- iterated local search
- greedy randomized adaptive search procedure
- metaheuristic
- combinatorial optimization
- neighborhood search
- simulated annealing
- hybrid metaheuristic
- benchmark instances
- routing problem
- test instances
- vehicle routing problem with time windows
- guided local search
- benchmark problems
- genetic algorithm
- vehicle routing
- search space
- combinatorial optimization problems
- multi start
- path relinking
- traveling salesman problem
- pick up and delivery
- job shop scheduling problem
- travel time
- logistics distribution
- search procedure
- search algorithm
- scheduling problem
- np hard
- optimization problems
- variable neighborhood search
- search strategies
- feasible solution
- optimal solution
- multi depot
- particle swarm optimization
- scatter search
- search heuristics
- branch and bound
- hybrid algorithm
- ant colony optimization
- nature inspired
- heuristic methods
- evolutionary algorithm
- search strategy
- fitness function
- search methods
- multi objective
- special case
- hill climbing