A Search Model for Evaluating Combinatorially Explosive Problems

Keith L. McRoberts
Additional contact information
Keith L. McRoberts: Iowa State University, Ames, Iowa

Operations Research, 1971, vol. 19, issue 6, 1331-1349

Abstract: 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.

Date: 1971
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.19.6.1331 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:19:y:1971:i:6:p:1331-1349

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().