Relaxing Time Windows by Partial Orders in Routing Problems With Stacking Constraints.
Chen WeiZhi-Hua HuWen-Wen GaoPublished in: IEEE Access (2019)
Keyphrases
- partial order
- routing problem
- vehicle routing problem
- vehicle routing
- resource constraints
- partially ordered
- total order
- traveling salesman problem
- metaheuristic
- stable marriage
- travel time
- lattice structure
- multi depot
- neural network
- cutting plane algorithm
- valid inequalities
- routing algorithm
- benchmark problems
- search strategies
- constraint satisfaction
- tabu search
- np hard