Tabu search applied to the general fixed charge problem

Recent successes in applying tabu search to a wide variety of classical optimization problems have motivated the investigation of applying tabu search to the well-known general fixed charge problem (GFCP). In this paper, an adaptation of tabu search to GFCP is described and computational results are given. In addition, the computational results are compared with those obtained from SWIFT-2, the most well-known and frequently used heuristic method for GFCP. As will be shown, the results are very encouraging.