Nonlinear Programming Model for the Facility Location Problem in the Presence of Arc-shaped Barrier

Volume 5, Issue 3, pp 153 - 159 http://dx.doi.org/10.22436/jmcs.05.03.02

Download PDF

Download XML

• Export citations
  • CITATIONS & REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • ARTICLE CITATION
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)
  • REFERENCES
  • EndNote (.ENW)
  • Mendeley, JabRef (.BIB)
  • Papers, Zotero, Reference Manager, RefWorks (.RIS)

• 2399 Downloads
• 3675 Views

Authors

Fatemeh Akbari - Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran. Saeed Akbari - Department of Art and Architecture, Aliabad Katoul Branch, Islamic Azad University, Aliabad Katoul, Iran. Iraj Mahdavi - Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran. Saber Shiripour - Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran.

Abstract

In this paper we consider the single facility location problem with respect to a given set of existing facilities in the presence of an arc-shaped barrier. A barrier is considered a region where neither facility location nor travelling is permitted. We present a mixed-integer nonlinear programming model for this single facility location problem. The objective of this problem is to locate this single facility such that the sum of the rectilinear distances from the facility to the demand points is minimized. Test problems are presented to illustrate the applicability of the proposed model.

Share and Cite

Keywords

• Facility location problem
• Arc-shaped barrier
• Mixed-integer nonlinear programming model
• rectilinear distance

MSC

•  90B50

References

• [1] H. Kelachankuttu, R. Batta, R. Nagi, Contour line construction for a new rectangular facility in an existing layout with rectangular departments, European Journal of Operational Research., 180 (2007), 149–162.


• [2] I. N. Katz, L. Cooper, Facility location in the presence of forbidden regions, I: formulation and the case of Euclidean distance with one forbidden circle, European Journal of Operational Research, 6 (1981), 166–73.


• [3] Y. P. Aneja, M. Parlar, Algorithms for Weber facility location in the presence of forbidden and or barriers to travel, Transportation Science, 28 (1994), 70-76.


• [4] R. Batta, A. Ghose, U. Palekar, Locating facilities on the Manhatten metric with arbitrarily shaped barriers and convex forbiddenregions, Transportation Science, 23 (1989), 26–36.


• [5] S. J. Wang, J. Bhadury, R. Nagi, Supply facility and input/output point locations in the presence of barriers , Computers and Operations Research, 29 (2002), 685–699.


• [6] P. Nandikonda, R. Batta, R. Nagi, Locating a 1-center on a Manhattan plane with ‘arbitrarily’ shaped barriers, Annals of Operations Research, 123 (2003), 157–172.


• [7] K. Klamroth, A reduction result for location problems with polyhedral barriers, European Journal of Operational Research, 130 (2001), 486-497.


• [8] K. Klamroth, Algebraic properties of location problems with one circular barrier, European Journal of Operational Research, 154 (2004), 20–35.


• [9] M. S. Canbolat, G. O. Wesolowsky , The rectilinear distance Weber problem in the presence of a probabilistic line barrier, European Journal of Operational Research, 22 (2010), 114–121.