IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-319-20430-7_23.html
   My bibliography  Save this book chapter

A Hybrid Genetic Algorithm for the One-Dimensional Minimax Bin-Packing Problem with Assignment Constraints

In: Computational Management Science

Author

Listed:
  • Mariona Vilà

    (Universitat Politècnica de Catalunya)

  • Jordi Pereira

    (Universidad Católica del Norte)

Abstract

In this paper, the one-dimensional minimax bin-packing problem with assignment constraints is studied. Among other applications, this problem is used in test-splitting, which consists in assigning several sets of questions into different questionnaires so that every one of these questionnaires contains one question from each one of the original sets. Questions have a weight associated, which typically corresponds to a measure of their difficulty, and the objective is to split the questions among the questionnaires in such a way that the weights are distributed as evenly as possible. We propose a hybrid genetic algorithm for solving this problem, which is then tested on a benchmark set of practically-sized instances. The results show its efficiency in solving large size instances from the literature.

Suggested Citation

  • Mariona Vilà & Jordi Pereira, 2016. "A Hybrid Genetic Algorithm for the One-Dimensional Minimax Bin-Packing Problem with Assignment Constraints," Lecture Notes in Economics and Mathematical Systems, in: Raquel J. Fonseca & Gerhard-Wilhelm Weber & João Telhada (ed.), Computational Management Science, edition 1, pages 183-188, Springer.
    • Handle: RePEc:spr:lnechp:978-3-319-20430-7_23
    DOI: 10.1007/978-3-319-20430-7_23
    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.

    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:lnechp:978-3-319-20430-7_23. 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.