IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4613-3632-7_15.html
   My bibliography  Save this book chapter

Large-Scale Diversity Minimization via Parallel Genetic Algorithms

In: Large Scale Optimization

Author

Listed:
  • Robert R. Meyer

    (University of Wisconsin - Madison, Center for Parallel Optimization, Computer Sciences Department)

  • Jonathan Yackel

    (University of Wisconsin - Madison, Center for Parallel Optimization, Computer Sciences Department)

Abstract

Diversity minimization is a class of large-scale combinatorial optimization problems arising from the assignment of processors to database fragments in a parallel database environment. These problems may be formulated as nonconvex assignment problems, but they are very difficult to solve via standard optimization techniques because of their large size and because they have many alternative optima. The method described here utilizes theoretical results regarding the form of optimal solutions as the basis for the development of a high-level parallel genetic algorithm. In effect, the genetic operators serve to produce good starting points and neighborhoods for exploration by a heuristic that uses knowledge of the small number of alternatives for desirable processor assignment patterns. Computational results from a parallel implementation of the algorithm on a Connection Machine CM-5 are reported, including the computation of optimal solutions to a million-variable diversity minimization problem.

Suggested Citation

  • Robert R. Meyer & Jonathan Yackel, 1994. "Large-Scale Diversity Minimization via Parallel Genetic Algorithms," Springer Books, in: W. W. Hager & D. W. Hearn & P. M. Pardalos (ed.), Large Scale Optimization, pages 294-311, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4613-3632-7_15
    DOI: 10.1007/978-1-4613-3632-7_15
    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
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:spr:sprchp:978-1-4613-3632-7_15. 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.