EconPapers    
Economics at your fingertips  
 

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

Wei-tian Wu () and Xin-min Yang ()
Additional contact information
Wei-tian Wu: Sichuan University
Xin-min Yang: National Center for Applied Mathematics of Chongqing

Journal of Global Optimization, 2024, vol. 88, issue 4, No 5, 927-945

Abstract: 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.

Keywords: Multiobjective optimization; Branch and bound algorithm; Preference information; Reference point (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10898-023-01306-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:88:y:2024:i:4:d:10.1007_s10898-023-01306-8

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-023-01306-8

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

 
Page updated 2025-04-12
Handle: RePEc:spr:jglopt:v:88:y:2024:i:4:d:10.1007_s10898-023-01306-8