Authors: AROGUNDADE O.T., AKINWALE A.T., ADEKOYA A.F.,AWE OLUDARE G.
Journal of Theoretical and Applied Information Technology Vol.9.No.1, 2009
Abstract
Facility location selection problem is a variant of set covering problem. Set covering problem is a classical problem in computer science and complexity theory. In this paper two different techniques are applied to facility location problems. First, a mathematical model of facility location is introduced and solved by using optimization solver, TORA. Secondly, the balas additive algorithm of branch and bound techniques is used to solve the facility location problem. Tests were made using real life data from a city in Nigeria. We then observed that both algorithms indicate the same number of fire stations in different locations. Also the results obtained by applying and implementing balas additive were more explanatory by specifying the names of the locations where the facilities are to be located and the names of the locations to be served by each of the facilities.