An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem.

•The two-echelon capacitated vehicle routing problem is considered.•A new route-based formulation for the problem is proposed.•A new family of satellite supply inequalities for the problem is proposed.•Our exact algorithm solves to optimality all literature instances.•New set of larger instances for the problem is proposed.