Adaptive memory programming for the vehicle routing problem with multiple trips.
Alfredo OliveraOmar VieraPublished in: Comput. Oper. Res. (2007)
Keyphrases
- vehicle routing problem
- metaheuristic
- tabu search
- benchmark problems
- routing problem
- hybrid metaheuristic
- vehicle routing
- vehicle routing problem with time windows
- benchmark instances
- test instances
- traveling salesman problem
- np hard
- travel time
- waste collection
- particle swarm optimization
- iterated local search
- variable neighborhood search
- pick up and delivery
- information retrieval
- multi depot
- memetic algorithm
- combinatorial optimization
- simulated annealing
- search strategies
- optimization problems
- cost function
- search space
- lower bound
- optimal solution
- objective function