Two metaheuristic approaches for solving the multi-compartment vehicle routing problem.
Hiba YahyaouiIslem KaabachiSaoussen KrichenAbdulkader DekdoukPublished in: Oper. Res. (2020)
Keyphrases
- vehicle routing problem
- metaheuristic
- combinatorial optimization
- tabu search
- hybrid metaheuristic
- simulated annealing
- combinatorial optimization problems
- search methods
- iterated local search
- optimization problems
- vehicle routing problem with time windows
- ant colony optimization
- benchmark instances
- genetic algorithm
- routing problem
- travel time
- greedy randomized adaptive search procedure
- search space
- optimal solution
- traveling salesman problem
- path relinking
- scatter search
- test instances
- variable neighborhood search
- particle swarm optimization
- benchmark problems
- combinatorial problems
- memetic algorithm
- np hard
- hybrid algorithm
- nature inspired
- vehicle routing problem with simultaneous
- knapsack problem
- multi objective
- evolutionary algorithm