IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-3-319-91086-4_8.html
   My bibliography  Save this book chapter

Next Generation Genetic Algorithms: A User’s Guide and Tutorial

In: Handbook of Metaheuristics

Author

Listed:
  • Darrell Whitley

    (Colorado State University)

Abstract

Genetic algorithms are different from most other metaheuristics because they exploit three key ideas: (1) the use of a population of solutions to guide search, (2) the use of crossover operators that recombine two or more solutions to generate new and potentially better solutions, and (3) the active management of diversity to sustain exploration. New ideas that are also introduced in this chapter include (1) the use of deterministic recombination operators that are capable of tunneling between local optima, and (2) the use of deterministic constant time move operators.

Suggested Citation

  • Darrell Whitley, 2019. "Next Generation Genetic Algorithms: A User’s Guide and Tutorial," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, edition 3, chapter 0, pages 245-274, Springer.
  • Handle: RePEc:spr:isochp:978-3-319-91086-4_8
    DOI: 10.1007/978-3-319-91086-4_8
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

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


    Cited by:

    1. He, Dongdong & Guan, Wei, 2023. "Promoting service quality with incentive contracts in rural bus integrated passenger-freight service," Transportation Research Part A: Policy and Practice, Elsevier, vol. 175(C).
    2. Andrea Ferigo & Giovanni Iacca, 2020. "A GPU-Enabled Compact Genetic Algorithm for Very Large-Scale Optimization Problems," Mathematics, MDPI, vol. 8(5), pages 1-26, May.
    3. Silva, Allyson & Aloise, Daniel & Coelho, Leandro C. & Rocha, Caroline, 2021. "Heuristics for the dynamic facility location problem with modular capacities," European Journal of Operational Research, Elsevier, vol. 290(2), pages 435-452.
    4. Wanida Khamprapai & Cheng-Fa Tsai & Paohsi Wang & Chi-En Tsai, 2021. "Performance of Enhanced Multiple-Searching Genetic Algorithm for Test Case Generation in Software Testing," Mathematics, MDPI, vol. 9(15), pages 1-17, July.
    5. He, Dongdong & Ceder, Avishai (Avi) & Zhang, Wenyi & Guan, Wei & Qi, Geqi, 2023. "Optimization of a rural bus service integrated with e-commerce deliveries guided by a new sustainable policy in China," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 172(C).

    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:spr:isochp:978-3-319-91086-4_8. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.