We consider a fixed-charge capacitated relay network design problem (CRNDP), which has widespread applications in the design of telecommunication and transportation networks, where relay points are presented as signal regenerators, truckload driver and/or tractor exchange stations or electrical vehicle recharging station. Our CRNDP integrates the key features of single allocation hub location problem (SAHLP) and capacitated network design problem (CNDP). Typical range restrictions in truckload transportation, electrical vehicles as well as for keeping signal strength in telecommunications, and further limitations of flow on the links of an underlying network in these mediums motivate the use of distance constraints and link capacity constraints in the design of a relay network for this diverse set of applications. To efficiently solve our model, we propose a Lagrangean relaxation algorithm, where the upper bounds are enhanced by a heuristic during the iterations and the lower bound is improved by the introduction of surrogate constraints. The extensive computational studies are conducted to examine the performance of the algorithm and the results show that the solution method we propose can efficiently solve CRNDP and obtain good-quality solutions, even for very large size instances.