Hybrid adaptive memory programming to optimise the multi-commodity many to many vehicle routing problem.
Jalel EuchiPublished in: Int. J. Math. Oper. Res. (2020)
Keyphrases
- vehicle routing problem
- multi commodity
- heuristic solution
- metaheuristic
- tabu search
- routing problem
- facility location
- greedy randomized adaptive search procedure
- benchmark problems
- max min
- knapsack problem
- np hard
- traveling salesman problem
- network flow problem
- travel time
- combinatorial optimization
- feasible solution
- pick up and delivery
- minimum cost
- vehicle routing problem with simultaneous
- search strategies
- simulated annealing
- state space
- evolutionary algorithm
- genetic algorithm