IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-642-04045-0_30.html
   My bibliography  Save this book chapter

A Branch and Bound Algorithm for Choquet Optimization in Multicriteria Problems

In: Multiple Criteria Decision Making for Sustainable Energy and Transportation Systems

Author

Listed:
  • Lucie Galand

    (LIP6-UPMC)

  • Patrice Perny
  • Olivier Spanjaard

Abstract

This paper is devoted to the search for Choquet-optimal solutions in multicriteria combinatorial optimization with application to spanning tree problems and knapsack problems. After recalling basic notions concerning the use of Choquet integrals for preference aggregation, we present a condition (named preference for interior points) that characterizes preferences favoring well-balanced solutions, a natural attitude in multicriteria optimization. When using a Choquet integral as preference model, this condition amounts to choosing a submodular (resp. supermodular) capacity when criteria have to be minimized (resp. maximized). Under this assumption, we investigate the determination of Choquet-optimal solutions in the multicriteria spanning tree problem and the multicriteria 0-1 knapsack problem. For both problems, we introduce a linear bound for the Choquet integral, computable in polynomial time, and propose a branch and bound procedure using this bound. We provide numerical experiments that show the actual efficiency of the algorithms on various instances of different sizes.

Suggested Citation

  • Lucie Galand & Patrice Perny & Olivier Spanjaard, 2010. "A Branch and Bound Algorithm for Choquet Optimization in Multicriteria Problems," Lecture Notes in Economics and Mathematical Systems, in: Matthias Ehrgott & Boris Naujoks & Theodor J. Stewart & Jyrki Wallenius (ed.), Multiple Criteria Decision Making for Sustainable Energy and Transportation Systems, pages 355-365, Springer.
  • Handle: RePEc:spr:lnechp:978-3-642-04045-0_30
    DOI: 10.1007/978-3-642-04045-0_30
    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. Melih Ozlen & Meral Azizoğlu & Benjamin Burton, 2013. "Optimising a nonlinear utility function in multi-objective integer programming," Journal of Global Optimization, Springer, vol. 56(1), pages 93-102, May.
    2. Beliakov, Gleb, 2022. "Knapsack problems with dependencies through non-additive measures and Choquet integral," European Journal of Operational Research, Elsevier, vol. 301(1), pages 277-286.

    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-642-04045-0_30. 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.