Abstract
Location models commonly represent demand as discrete points rather than as continuously spread over an area. This modeling technique introduces inaccuracies to the objective function and consequently to the optimal location solution. In this article this inaccuracy is investigated by the study of a particular competitive facility location problem. First, the location problem is formulated over a continuous demand area. The optimal location for a new facility that optimizes the objective function is obtained. This optimal location solution is then compared with the optimal location obtained for a discrete set of demand points. Second, a simple approximation approach to the continuous demand formulation is proposed. The location problem can be solved by using the discrete demand algorithm while significantly reducing the inaccuracies. This way the simplicity of the discrete approach is combined with the approximated accuracy of the continuous-demand location solution. Extensive analysis and computations of the test problem are reported. It is recommended that this approximation approach be considered for implementation in other location models. © 1997 John Wiley & Sons, Inc.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.