Reference-point-based branch and bound algorithm for multiobjective optimization
From MaRDI portal
Publication:6203550
Abstract: In this paper, a branch and bound algorithm that incorporates the decision maker's preference information is proposed for multiobjective optimization. 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 -efficient solutions distributed in the region of interest. 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.
Recommendations
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- Branch and probability bound methods in multi-objective optimization
- A general branch-and-bound framework for continuous global multiobjective optimization
- Multi-objective branch and bound
- A Branch \& Cut algorithm to compute nondominated solutions in MOLFP via reference points
Cites work
- scientific article; zbMATH DE number 852844 (Why is no real title available?)
- A Branch--and--Bound-Based Algorithm for Nonconvex Multiobjective Optimization
- A general branch-and-bound framework for continuous global multiobjective optimization
- A preference-based evolutionary algorithm for multiobjective optimization: the weighting achievement scalarizing function genetic algorithm
- Adaptation of a one-step worst-case optimal univariate algorithm of bi-objective Lipschitz optimization to multidimensional problems
- An approximation algorithm for convex multi-objective programming problems
- Interval Methods for Systems of Equations
- Lipschitzian optimization without the Lipschitz constant
- Multi-objective optimization using evolutionary algorithms
- Multicriteria optimization using a genetic algorithm for determining a Pareto set
- Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- On one-step worst-case optimal trisection in univariate bi-objective Lipschitz optimization
- \(\alpha BB\): A global optimization method for general constrained nonconvex problems
- g-dominance: Reference point based dominance for multiobjective metaheuristics
This page was built for publication: Reference-point-based branch and bound algorithm for multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6203550)
