A branch-and-price-and-cut for the manpower allocation and vehicle routing problem with staff qualifications and time windows.
Xinxin SuGangyan XuNan HuangHu QinPublished in: Adv. Eng. Informatics (2023)
Keyphrases
- vehicle routing problem
- metaheuristic
- vehicle routing
- tabu search
- benchmark problems
- vehicle routing problem with time windows
- routing problem
- traveling salesman problem
- test instances
- travel time
- hybrid metaheuristic
- combinatorial optimization
- memetic algorithm
- iterated local search
- logistics distribution
- np hard
- knapsack problem
- particle swarm optimization
- benchmark instances
- multi depot
- simulated annealing
- neural network
- variable neighborhood search
- neighborhood search
- greedy randomized adaptive search procedure
- integer programming
- search strategies
- search algorithm