This paper describes various practical aspects, in some detail, of inmplementiing an algorithm for the design of large-scale radial distribution networks. This algorithm is one which has been published previously, so this paper should be considered as the second part of that work. This algorithm simultaneously optimizes the line layout and type of conductor used. A branch-exchange algorithm for layout optimization, a dynamic programming algorithm for conductor optimization, and a decomposition algorithm enabling large-scale problem solving are all combined in this algorithm. To demonstrate the benefits of the proposed algorithm, numerical results have been provided from a reference network built for a low-voltage rural zone comprised of 1088 loads and 20 distribution substations. It can be verified that using the decomposition technique enables large-scale problem solving and produces results that are better than those techniques which come from a mere partition of the original problem into smaller parts.