We introduce and study the single-path design-balanced service network design problem.
We propose three matheuristics to solve the introduced problem.
We design a Lagrangian relaxation method to get initial solution in the three methods.
Computational results show that these approaches reach good performance.