5 papers
A Branch and Bound Algorithm for Multiobjective Optimization Problems Using General Ordering Cones
Weitian Wu, Xinmin Yang
Many existing branch and bound algorithms for multiobjective optimization problems require a significant computational cost to approximate the entire Pareto optimal solution set. I…
Obtaining properly Pareto optimal solutions of multiobjective optimization problems via the branch and bound method
Weitian Wu, Xinmin Yang
In multiobjective optimization, most branch and bound algorithms provide the decision maker with the whole Pareto front, and then decision maker could select a single solution fina…
Reference-Point-Based Branch and Bound Algorithm for Multiobjective Optimization
Weitian Wu, Xinmin Yang
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…
The Hybridization of Branch and Bound with Metaheuristics for Nonconvex Multiobjective Optimization
Wei-tian Wu, Xin-min Yang
A hybrid framework combining the branch and bound method with multiobjective evolutionary algorithms is proposed for nonconvex multiobjective optimization. The hybridization exploi…
A novel multiobjective evolutionary algorithm based on decomposition and multi-reference points strategy
Wang Chen, Jian Chen, Weitian Wu +2
Many real-world optimization problems such as engineering design can be eventually modeled as the corresponding multiobjective optimization problems (MOPs) which must be solved to…