A variable neighborhood search algorithm with constraint relaxation for the two-echelon vehicle routing problem with simultaneous delivery and pickup demands.
Ran LiuShan JiangPublished in: Soft Comput. (2022)
Keyphrases
- vehicle routing problem with simultaneous
- vehicle routing problem
- constraint relaxation
- search algorithm
- tabu search
- constraint satisfaction
- metaheuristic
- routing problem
- heuristic search
- search strategies
- pick up and delivery
- constraint optimization
- search space
- benchmark problems
- combinatorial optimization
- particle swarm optimization
- travel time
- traveling salesman problem
- multi item
- np hard
- branch and bound
- supply chain
- constraint satisfaction problems
- search strategy
- branch and bound search
- knapsack problem
- simulated annealing
- search problems
- constraint programming
- search tree
- special case
- reinforcement learning
- computational complexity
- ant colony optimization
- optimization problems
- cost function