Abstract
A tabu search heuristic procedure is developed to solve the uncapacitated facility location problem. The heuristic procedure uses tabu search to guide the solution process when evolving from one solution to another in order to search for an optimal solution. A move is defined to be the closing or opening of a facility. The net change in the total cost resulting from a move is used to measure the attractiveness of a move. Searching only a small subset of the feasible solutions that contains the optimal solution, the procedure is computationally very efficient. A computational experiment is conducted to test the performance of the procedure and computational results are reported. The procedure can easily find optimal solutions for test problems with known optimal solutions from the literature. Solutions obtained with this tabu search procedure completely dominate those obtained with the Lagrangian method for randomly generated test problems.KeywordsFacility LocationTabu SearchHeuristicsOptimization
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
