The aim of this paper is to present a Generalized Multi-commodity Location-Allocation Model, where a demand-supply network consisting of n demand nodes requires m different types of services. In this network the location of a given number of p centers, the simultaneous distribution of a given number of Yl (l=1,...,m) servers, and the allocation of each of the demand nodes to just one center (for each service category l) are asked for, in order to minimize the norm (length) of a vector type objective function, the l-th component of which represents the aggregate travel, waiting and service time from all nodes to their centers, for the service category l. In the above context a heuristics is developed to give a solution to this model and some examples are presented to show the efficiency of the algorithm.
