A distance reduction approach for simple plant location problem

摘要

In this paper a single workspace location problem in a polygonal area V is considered. Our objective is to locate a workspace facility so as to minimize the total distance between the facility, the customers and the suppliers. Our approach is based on the consideration of the distance and the importance factor of each customer and supplier. We used the A-distance measurement and the aggregation method theories to represent the real travelled distance in the mathematical modeling. The aim of the study is to determine the workspace location coordinates in the V area.