A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions.
Jiachen WeiMark PoonZhenzhen ZhangPublished in: Comput. Oper. Res. (2024)
Keyphrases
- combinatorial auctions
- vehicle routing problem with time windows
- cost function
- benchmark problems
- dynamic programming
- objective function
- resource allocation
- exact algorithms
- worst case
- search space
- particle swarm optimization
- decision problems
- convergence rate
- knapsack problem
- upper bound
- routing problem
- optimal solution