Solving the uncapacitated facility location problem using tabu search

  • Authors:

  • Minghe Sun

  • Affiliations:

  • Department of Management Science and Statistics, College of Business, The University of Texas at San Antonio, San Antonio, TX

  • Venue:
  • Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

A tabu search heuristic procedure is developed to solve the uncapacitated facility location problem. Tabu search is used to guide the solution process when evolving from one solution to another. A move is defined to be the opening or closing of a facility. The net cost change resulting from a candidate move is used to measure the attractiveness of the move. After a move is made, the net cost change of a candidate move is updated from its old value. Updating, rather than re-computing, the net cost changes substantially reduces computation time needed to solve a problem when the problem is not excessively large. 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 or near optimal solutions for benchmark test problems from the literature. For randomly generated test problems, this tabu search procedure not only obtained solutions completely dominating those obtained with other heuristic methods recently published in the literature but also used substantially less computation time. Therefore, this tabu search procedure has advantage over other heuristic methods in both solution quality and computation speed.