The multi-compartment vehicle routing problem with flexible compartment sizes.
Tino HenkeM. Grazia SperanzaGerhard WäscherPublished in: Eur. J. Oper. Res. (2015)
Keyphrases
- vehicle routing problem
- tabu search
- benchmark problems
- metaheuristic
- routing problem
- vehicle routing problem with time windows
- vehicle routing
- test instances
- travel time
- particle swarm optimization
- np hard
- hybrid metaheuristic
- memetic algorithm
- iterated local search
- combinatorial optimization
- traveling salesman problem
- neural network
- pick up and delivery
- information retrieval
- search strategies
- optimization problems
- simulated annealing
- multi objective
- neighborhood search
- lower bound
- genetic algorithm
- multi depot