IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v19y1971i6p1331-1349.html
   My bibliography  Save this article

A Search Model for Evaluating Combinatorially Explosive Problems

Author

Listed:
  • Keith L. McRoberts

    (Iowa State University, Ames, Iowa)

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.

Suggested Citation

  • Keith L. McRoberts, 1971. "A Search Model for Evaluating Combinatorially Explosive Problems," Operations Research, INFORMS, vol. 19(6), pages 1331-1349, October.
    • Handle: RePEc:inm:oropre:v:19:y:1971:i:6:p:1331-1349
    DOI: 10.1287/opre.19.6.1331
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.19.6.1331
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.19.6.1331?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Robert L. Nydick & Howard J. Weiss, 1994. "An analytical evaluation of optimal solution value estimation procedures," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(2), pages 189-202, March.
    2. Marin, Angel & Salmeron, Javier, 1996. "Tactical design of rail freight networks. Part II: Local search methods with statistical analysis," European Journal of Operational Research, Elsevier, vol. 94(1), pages 43-53, October.
    3. Wilson, Amy D. & King, Russell E. & Wilson, James R., 2004. "Case study on statistically estimating minimum makespan for flow line scheduling problems," European Journal of Operational Research, Elsevier, vol. 155(2), pages 439-454, June.
    4. Bettinger, Pete & Boston, Kevin & Kim, Young-Hwan & Zhu, Jianping, 2007. "Landscape-level optimization using tabu search and stand density-related forest management prescriptions," European Journal of Operational Research, Elsevier, vol. 176(2), pages 1265-1282, January.
    5. E A Silver, 2004. "An overview of heuristic solution methods," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 936-956, September.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:19:y:1971:i:6:p:1331-1349. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.