The goal of this paper is to present an efficient procedure to find good solutions to realistically size fixed-charge, capacitated, multicommodity, network design problems. At the present time, there exists no algorithm that can solve large instances, common in several applications, in a reasonable period of time, so heuristic procedures must be applied. The design problem addressed in this work is formulated as a mixed-integer programming problem and solved by a procedure based in Tabu Search meta-heuristic. Computational experiments were conducted and results are compared with those obtained by an evolutionary algorithm.