A variable neighborhood search approach for solving a real-world hierarchical multi-echelon vehicle routing problem involving HCT vehicles.
Marduch TadarosAngelo SifalerasAthanasios MigdalasPublished in: Comput. Oper. Res. (2024)
Keyphrases
- vehicle routing problem
- variable neighborhood search
- travel time
- combinatorial optimization
- pick up and delivery
- metaheuristic
- tabu search
- benchmark instances
- routing problem
- hybrid metaheuristic
- traveling salesman problem
- neighborhood search
- test instances
- memetic algorithm
- benchmark problems
- combinatorial optimization problems
- knapsack problem
- np hard
- simulated annealing
- heuristic methods
- particle swarm optimization
- hybrid method
- single machine scheduling problem
- path relinking
- minimum spanning tree
- search strategies
- ant colony optimization
- optimal solution
- special case
- constraint satisfaction
- scatter search
- search space