ON PREDICTING COMPUTATIONAL TIME OF A BRANCH AND BOUND ALGORITHM FOR THE ASSIGNMENT OF FACILITIES

Experience with branch and bound algorithms indicates that computational time is a function of not only the size of the problem, but also the nature of the input data. This paper formulates statistically-based variables which describe certain characteristics of the input data and experimentally evaluates their ability to predict computational time for one branch and bound algorithm, the relative location of facilities or “plant layout” problem. Results suggest that the described experimental procedure may be useful for an a priori assessment of the computational difficulty of specific branch and bound problems.