A teaching-learning-based optimization (TLBO) algorithm is a new population-based algorithm applied in some applications in the literature successfully. Moreover, a genetic algorithm (GA) is a popular tool employed widely in many disciplines of engineering. In this paper, a hybrid GA-TLBO algorithm is proposed for the capacitated three-stage supply chain network design (SCND) problem. The SCND problem as a strategic level decision-making problem in supply chain management is an NP-hard class of computational complexity. To escape infeasible solutions emerged in the problem of interest due to realistic constraints, combination of a random key and priority-base encoding scheme is also used. To assess the quality of the proposed hybrid GA-TLBO algorithm, some numerical examples are conducted. Then, the results are compared with the GA, TLBO, differential evolution (DE) and branch-and -bound algorithms. Finally, the conclusion is provided.