IJSTR

International Journal of Scientific & Technology Research

Home About Us Scope Editorial Board Blog/Latest News Contact Us
0.2
2019CiteScore
 
10th percentile
Powered by  Scopus
Scopus coverage:
Nov 2018 to May 2020

CALL FOR PAPERS
AUTHORS
DOWNLOADS
CONTACT

IJSTR >> Volume 9 - Issue 6, June 2020 Edition



International Journal of Scientific & Technology Research  
International Journal of Scientific & Technology Research

Website: http://www.ijstr.org

ISSN 2277-8616



New Analysis Algorithm For Solving The Nearest Facility Pre-Location Problem On A Plane

[Full Text]

 

AUTHOR(S)

Liyana Nadhira Kaharuddin, Mahathir Mohamad*, Mustaffa Anjang Ahmad, Kamil Khalid

 

KEYWORDS

Facility Location Problem, Median Method, Minisum Facility Location, Weiszfeld’s Method.

 

ABSTRACT

There are two types of Facility Location Problem (FLP) that have been presented. The first type of FLP is minisum rectilinear distance single FLP which have been solved by using median method and also linear programming formulation which solved by using linear programming software, TORA. The second type of FLP is minisum Euclidean distance single FLP which solved by using Weiszfeld’s method and also extension of Weiszfeld’s method. Given weighted demand points, the new facility location point was find to minimize the total demand weighted cost between the demand and the new facility location (minisum objective function). All of the methods have been applied successfully. The results obtained have been analyze and compared by the total distances.

 

REFERENCES

[1] R. Z. Farahani, M. Abedian, and S. Sharahi, Dynamic FacilityLocation Problem. 2009.
[2] B. Thangavelu, “Single-Facility Location Problem Among Two-Dimensional Existing Facility Locations,” 2003.
[3] Z. Drezner and G. O. Wesolowsky, “On the collection depotslocation problem,” Eur. J. Oper. Res., vol. 130, no. 3, pp.510–518, 2001.
[4] S. Ponboon, “Exact Solutions for Location-Routing Problems withTime Window Using Branch and- Price Method,” 2015.
[5] X. Wang, L. Wang, and Y. Wu, “An Optimal Algorithm forWeighted Rectilinear Facility Location Problem,” vol. 56, no. Isai,pp. 186–190, 2012.
[6] N. Krivulin, “Using tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance arXiv : 1511 . 07549v3 [ math . OC ] 7 Sep 2017,” pp. 1–29,2017.
[7] R. H. Edahl, “A spatial branch-and-bound algorithm for some unconstrained single-facility location problems,” 1989.
[8] F. P. Lastria, “Optimal gridpositioning or single facility location on the torus,” vol. 1, pp. 19–29, 1991.
[9] S. Eilon, C. D. T. Watson-Gandy, N. Christofides, and R. de Neufville, “Distribution Management-Mathematical Modelling and Practical Analysis,” IEEE Trans. Syst. Man. Cybern., vol. SMC-4, no. 6, p. 589, 1971.
[10] E. Moradi and M. Bidkhori, “Single facility location problem,” in Facility Location, Springer, 2009, pp. 37–68.
[11] J. Lee and D. W.-S. W. Wong, GIS and Statistical Analysis with ArcView. Wiley, 2000.