IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v176y2007i3p1436-1451.html
   My bibliography  Save this article

A general steady state distribution based stopping criteria for finite length genetic algorithms

Author

Listed:
  • Pendharkar, Parag C.
  • Koehler, Gary J.

Abstract

No abstract is available for this item.

Suggested Citation

  • Pendharkar, Parag C. & Koehler, Gary J., 2007. "A general steady state distribution based stopping criteria for finite length genetic algorithms," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1436-1451, February.
    • Handle: RePEc:eee:ejores:v:176:y:2007:i:3:p:1436-1451
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(05)00858-1
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Aytug, Haldun & Koehler, Gary J., 2000. "New stopping criterion for genetic algorithms," European Journal of Operational Research, Elsevier, vol. 126(3), pages 662-674, November.
    2. Haldun Aytug & Gary J. Koehler, 1996. "Stopping Criteria for Finite Length Genetic Algorithms," INFORMS Journal on Computing, INFORMS, vol. 8(2), pages 183-191, May.
    3. Gary Koehler, 1997. "New directions in genetic algorithm theory," Annals of Operations Research, Springer, vol. 75(0), pages 49-68, January.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Chin-Hung Liu, 2010. "A group decision-making method with fuzzy set theory and genetic algorithms in quality function deployment," Quality & Quantity: International Journal of Methodology, Springer, vol. 44(6), pages 1175-1189, October.
    2. Pendharkar, Parag C., 2021. "Allocating fixed costs using multi-coalition epsilon equilibrium," International Journal of Production Economics, Elsevier, vol. 239(C).
    3. Pendharkar, Parag C., 2008. "Maximum entropy and least square error minimizing procedures for estimating missing conditional probabilities in Bayesian networks," Computational Statistics & Data Analysis, Elsevier, vol. 52(7), pages 3583-3602, March.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Aytug, Haldun & Koehler, Gary J., 2000. "New stopping criterion for genetic algorithms," European Journal of Operational Research, Elsevier, vol. 126(3), pages 662-674, November.
    2. Jackie Rees & Gary J. Koehler, 2002. "An Evolutionary Approach to Group Decision Making," INFORMS Journal on Computing, INFORMS, vol. 14(3), pages 278-292, August.
    3. Aytug, Haldun & Koehler, Gary J., 2007. "The effect of multiple optima on the simple GA run-time complexity," European Journal of Operational Research, Elsevier, vol. 178(1), pages 27-45, April.
    4. Saydam, Cem & Aytug, Haldun, 2003. "Accurate estimation of expected coverage: revisited," Socio-Economic Planning Sciences, Elsevier, vol. 37(1), pages 69-80, March.
    5. Ahmed Abbasi & Jingjing Li & Donald Adjeroh & Marie Abate & Wanhong Zheng, 2019. "Don’t Mention It? Analyzing User-Generated Content Signals for Early Adverse Event Warnings," Information Systems Research, INFORMS, vol. 30(3), pages 1007-1028, September.
    6. Leung, T. W. & Chan, Chi Kin & Troutt, Marvin D., 2003. "Application of a mixed simulated annealing-genetic algorithm heuristic for the two-dimensional orthogonal packing problem," European Journal of Operational Research, Elsevier, vol. 145(3), pages 530-542, March.
    7. Carl Chiarella & Thuy-Duong Tô, 2006. "The Multifactor Nature of the Volatility of Futures Markets," Computational Economics, Springer;Society for Computational Economics, vol. 27(2), pages 163-183, May.
    8. Debora Gil & David Roche & Agnés Borràs & Jesús Giraldo, 2015. "Terminating evolutionary algorithms at their steady state," Computational Optimization and Applications, Springer, vol. 61(2), pages 489-515, June.
    9. Mak, Brenda & Blanning, Robert & Ho, Susanna, 2006. "Genetic algorithms in logic tree decision modeling," European Journal of Operational Research, Elsevier, vol. 170(2), pages 597-612, April.
    10. Arsham H., 1998. "Techniques for Monte Carlo Optimizing," Monte Carlo Methods and Applications, De Gruyter, vol. 4(3), pages 181-230, December.
    11. Aytug, Haldun & Saydam, Cem, 2002. "Solving large-scale maximum expected covering location problems by genetic algorithms: A comparative study," European Journal of Operational Research, Elsevier, vol. 141(3), pages 480-494, 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:eee:ejores:v:176:y:2007:i:3:p:1436-1451. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.