Hossein Jafari - Young Researchers and Elite Club, Arak Branch, Islamic Azad University, Arak, Iran.
Abbas Sheykhan - Department of Industrial Engineering, Islamic Azad University of Arak, Arak, Iran.

Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs produced by a computer to solve big problems require more time, so, this paper suggests an algorithm that can be useful in better performance of the known algorithms such as Branch and Bound. The proposed study aims to improve the performance of the branch and bound (BB) algorithm in solving QAP problems. The findings show that the proposed method enables the BB algorithm to produce an optimal solution in the minimum amount of time.

Computer Algorithms, exact methods, Branch and bound, Feasible Answer