By Topic

A parallel Branch and Bound algorithm for solving large scale integer multiobjective problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ismail, M.M. ; Fac. of Comput. & Inf. Syst., Oper. Res. Dept., Zagazig Univ., Zagazig, Egypt ; El-Wahed, W.F.A. ; Abd el-Raoof, O.

The multi-objective integer programming problems in large scale are considered time consuming. In the past, mathematical structures were used that can get benefits of high processing powers and parallel processing. The Branch and Bound (B&B) algorithm is one of the most used methods to solve combinatorial optimization problems. A general approach to generate all non-dominated solutions of the multi-objective integer programming (MOIP) Problem is developed. In this paper, a supervisor-master-sub-master-worker algorithm to solve large scale integer multi-objective problems that can get the benefits of mathematical structures and high processing powers has been proposed. This approach addresses several issues related to the characteristics of the algorithm itself and the properties of parallel computing systems. From the solved benchmark example this algorithm proved to provide a considerable high performance. Results show that a consistently better efficiency can be achieved in solving integer equations, providing reduction of time.

Published in:

Informatics and Systems (INFOS), 2010 The 7th International Conference on

Date of Conference:

28-30 March 2010