Authors: Shailesh S. Kulkarni; Hakan Tarakci; Kwabena G. Boakye; Subramaniam Ponnaiyan; Matthew Lasuzzo
Addresses: University of North Texas, 1155 Union Circle #305339, Denton, Texas, 76203-5017, USA ' University of North Texas, 1155 Union Circle #305339, Denton, Texas, 76203-5017, USA ' Georgia Southern University, P.O. Box 8151, Statesboro, Georgia, 30460, USA ' University of North Texas, 1155 Union Circle #305339, Denton, Texas, 76203-5017, USA ' Frito-Lay North America, 7701 Legacy Dr., Plano, TX 75024, USA
Abstract: In this paper, we provide a simple approximation scheme for the optimal objective value for a particular type of location problem. Typically, such problems are solved using the classic set covering formulation. Such a formulation automatically requires data for the constraint matrix and can get too large to implement or too difficult to solve to optimality. The scheme presented in this paper has minimal need for such data. Based on a simple count and with some basic and realistic assumptions about the geometry of the problem, we provide an algebraic formula that gives a close approximation to the optimal objective function value. Our formula can be easily implemented in a spreadsheet or hand-held calculator making it an effective planning tool for practice and also a good pedagogical aid. We illustrate by applying it to a location problem involving individual states in the continental US and collectively to the entire country.
Keywords: facility location; adjacent units; approximation; set covering; heuristics; operations management; higher education.
International Journal of Information and Operations Management Education, 2013 Vol.5 No.3, pp.214 - 229
Available online: 23 Aug 2013 *Full-text access for editors Access for subscribers Purchase this article Comment on this article