Abstract
PurposeThis paper aims to propose a multiobjective branch and bound (MOBB) algorithm with a new criteria for the branching and discarding of nodes based on Pareto dominance and contribution metric.Design/methodology/approachA multiobjective branch and bound (MOBB) method is presented and applied to the bi-objective combinatorial optimization of a safety transformer. A comparison with exhaustive enumeration and non-dominated sorting genetic algorithm (NSGA2) confirms the solutions.FindingsIt appears that MOBB and NSGA2 are both sensitive to their control parameters. The parameters for the MOBB algorithm are the number of starting points and the number of solutions on the relaxed Pareto front. The parameters of NSGA2 are the population size and the number of generations.Originality/valueThe comparison with exhaustive enumeration confirms that the proposed algorithm is able to find the complete set of non-dominated solutions in about 235 times fewer evaluations. As this last method is exact, its confidence level is higher.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: COMPEL - The international journal for computation and mathematics in electrical and electronic engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
