Abstract
In this paper, we deal with a Distribution/Location Problem of Multi-commodity (MDLP), in which the optimal locations of Distribution Centers and the transportation routes of trucks are determined. We formulate this problem as an integer programming, including integer variables that express the number of trucks. By relaxing those integer variables to real ones, we get a relaxation problem of the MDLP-a Simple Plant Location Problem (SPLP). Then making use of a procedure of the SPLP, we propose an approximate procedure for the MDLP and a branch and bound procedure to decide an optimal solution of the MDLP. Finally some numerical comparisons between the two procedures are shown.
