A min-max vehicle routing problem with split delivery and heterogeneous demand.
Ertan YakiciOrhan KarasakalPublished in: Optim. Lett. (2013)
Keyphrases
- min max
- vehicle routing problem
- vehicle routing problem with simultaneous
- multiobjective optimization
- tabu search
- metaheuristic
- routing problem
- max min
- vehicle routing
- test instances
- hybrid metaheuristic
- vehicle routing problem with time windows
- pick up and delivery
- travel time
- combinatorial optimization
- traveling salesman problem
- np hard
- benchmark problems
- memetic algorithm
- logistics distribution
- multi depot
- particle swarm optimization
- benchmark instances
- iterated local search
- information retrieval
- lower bound
- knapsack problem
- search strategies
- simulated annealing
- genetic algorithm
- neural network
- greedy randomized adaptive search procedure