Solving Capacitated Facility Location Problem Using Tabu Search

摘要

This study proposes a tabu search heuristic procedure for the capacitated facility location problem. The heuristic procedure uses recency based short term memory and frequency based long term memories performing diversification and intensification functions. Its performance is tested through a computational experiment using test problems from the literature. It found optimal solutions for almost all test problems. As compared to a Lagrangian heuristic method, the tabu search heuristic procedure found much better solutions using much less CPU time.