IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v88y2024i4d10.1007_s10898-023-01306-8.html
   My bibliography  Save this article

Reference-point-based branch and bound algorithm for multiobjective optimization

Author

Listed:
  • Wei-tian Wu

    (Sichuan University)

  • Xin-min Yang

    (National Center for Applied Mathematics of Chongqing
    Chongqing Normal University)

Abstract

In this paper, a nonconvex multiobjective optimization problem with Lipschitz objective functions is considered. A branch and bound algorithm that incorporates the decision maker’s preference information is proposed for this problem. In the proposed algorithm, a new discarding test is designed to check whether a box contains preferred solutions according to the preference information expressed by means of reference points. In this way, the proposed algorithm is able to gradually guide the search towards the region of interest on the Pareto fronts during the solution process. We prove that the proposed algorithm obtains $$\varepsilon $$ ε -efficient solutions distributed among the regions of interest with respect to the given reference points. Moreover, lower bound on the total finite number of required iterations for predefined precision is also provided. Finally, the algorithm is illustrated with a number of test problems.

Suggested Citation

  • Wei-tian Wu & Xin-min Yang, 2024. "Reference-point-based branch and bound algorithm for multiobjective optimization," Journal of Global Optimization, Springer, vol. 88(4), pages 927-945, April.
    • Handle: RePEc:spr:jglopt:v:88:y:2024:i:4:d:10.1007_s10898-023-01306-8
    DOI: 10.1007/s10898-023-01306-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-023-01306-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10898-023-01306-8?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:jglopt:v:88:y:2024:i:4:d:10.1007_s10898-023-01306-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.