Innovative local search heuristics for uncapacitated facility location problem Online publication date: Mon, 10-Oct-2022
by Shahed Sholekar; Mehdi Seifbarghy; Davar Pishva
International Journal of Industrial and Systems Engineering (IJISE), Vol. 42, No. 2, 2022
Abstract: This paper presents four different local search heuristics, abbreviated as PSC, PSTC, PTSC and PFSC, for handling the UFLP. It compares their outcome with that of a previously proposed equivalent heuristic called add-swap neighbourhood search (ASNS). One of its main focus is to reduce processing time since ASNS heuristic's computational time is quite long and continues to increase in an exponential order with magnitude of the problem. The proposed heuristics use a two-phase approach wherein the first phase ranks the potential facilities' locations and selects an initial solution from the ranking; and the second phase keeps on adding other locations from the ranking list, one at a time, until the stop criterion is achieved. Its results show that the proposed heuristics reduce computational time dramatically when compared with the ASNS. Furthermore, the PFSC heuristic provides better performance in both computational time and solution quality when dealing with large size problems.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Industrial and Systems Engineering (IJISE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook