IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-58405-3_68.html
   My bibliography  Save this book chapter

Adapting Branching and Queuing for Multi-objective Branch and Bound

In: Operations Research Proceedings 2023

Author

Listed:
  • Julius Bauß

    (University of Wuppertal)

  • Michael Stiglmayr

    (University of Wuppertal)

Abstract

Branch and bound algorithms have to cope with several additional difficulties in the multi-objective case. Not only the bounding procedure is considerably weaker, but also the handling of upper and lower bound sets requires much more computational effort since both sets can be of exponential size. Thus, the order in which the subproblems are considered is of particular importance. Thereby, it is crucial not only to find efficient solutions as soon as possible but also to find a set of (efficient) solutions whose images are well distributed along the non-dominated frontier. In this paper we evaluate the performance of multi-objective branch and bound algorithms depending on branching and queuing of subproblems. We use, e.g., the hypervolume indicator as a measure for the gap between lower and upper bound set to implement a multi-objective best-first strategy. We test our approaches on multi-objective knapsack and generalized assignment problems.

Suggested Citation

  • Julius Bauß & Michael Stiglmayr, 2025. "Adapting Branching and Queuing for Multi-objective Branch and Bound," Lecture Notes in Operations Research, in: Guido Voigt & Malte Fliedner & Knut Haase & Wolfgang Brüggemann & Kai Hoberg & Joern Meissner (ed.), Operations Research Proceedings 2023, chapter 0, pages 535-541, Springer.
  • Handle: RePEc:spr:lnopch:978-3-031-58405-3_68
    DOI: 10.1007/978-3-031-58405-3_68
    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:lnopch:978-3-031-58405-3_68. 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.