A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints.
Tian LiuZhixing LuoHu QinAndrew LimPublished in: Eur. J. Oper. Res. (2018)
Keyphrases
- detection algorithm
- preprocessing
- theoretical analysis
- optimal solution
- optimization algorithm
- np hard
- dynamic programming
- experimental evaluation
- learning algorithm
- similarity measure
- matching algorithm
- computational complexity
- k means
- recognition algorithm
- benchmark problems
- convergence rate
- high accuracy
- graph partitioning
- lower and upper bounds
- linear constraints
- lp relaxation
- multiple constraints
- times faster
- ant colony optimization
- computational cost
- cost function
- search algorithm
- objective function
- image sequences
- decision trees