An extension of the p-median group technology algorithm

As suggested by Mulvey and Crowder and tested by Klastorin, the p-median algorithm is useful for clustering applications. This approach was adopted by Kusiak and applied to group technology. This paper presents a modification to the p-median clustering algorithm. The new algorithm introduces p, the number of groups, into the objective function; thus, eliminating the iterative nature of the algorithm, and overcoming the difficulty of conjecturing an initial p value.