A Search Model for Evaluating Combinatorially Explosive Problems

Heuristic algorithms have frequently been developed in the attempt to solve combinatorial problems such as those that frequently exist in plant-layout planning, sequencing, scheduling, and routing situations. In these algorithms there has been no basis available to evaluate the progress of the heuristic results in relation to an optimum. This paper outlines and provides examples of the application of extreme value distributions and, more particularly, the Weibull distribution as mechanisms for estimating optimum limits. Given such estimates, the paper further illustrates the development of decision rules applicable to the decision of continuing or halting the heuristic analysis.