Tabu search applied to the general fixed charge problem | Annals of Operations Research Skip to main content
Springer Nature Link
Log in

Tabu search applied to the general fixed charge problem

  • Various Applications
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A.V. Cabot and S.S. Erenguc, Improved penalties for fixed charge problems using Lagrangian relaxation, Manag. Sci. 27(1986)856–869.

    Google Scholar 

  2. J.E. Falk and F.M. Soland, An algorithm for separable nonconvex programming problems, Manag. Sci. 15(1969)550–569.

    Google Scholar 

  3. F. Glover, Future paths for integer programming and links to artificial intelligence, Comp. Oper. Res. 1(1986)533–549.

    Google Scholar 

  4. F. Glover, Tabu search, Part I, ORSA J. Comp. 1(1989)190–206.

    Google Scholar 

  5. F. Glover, Tabu search, Part II, ORSA J. Comp. 2(1990)4–32.

    Google Scholar 

  6. F. Glover, Tabu search: A tutorial, Interfaces 20(1990)74–94.

    Google Scholar 

  7. P.G. McKeown, A branch-and-bound algorithm for solving fixed charge problems, Naval Res. Log. 28(1981)607–617.

    Google Scholar 

  8. P.G. McKeown and C.T. Ragsdale, A computational study of using preprocessing and stronger formulations to solve general fixed charge problems, Comp. Oper. Res. 17(1990)9–16.

    Google Scholar 

  9. D. de Werra and A. Hertz, Tabu search techniques: A tutorial and an application to neural networks, OR Spektrum 11(1989)131–141.

    Google Scholar 

  10. W.E. Walker, An adjacent extreme point algorithm for the fixed charge problem, Manag. Sci. 22(1976)587–596.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Business, The University of Texas at San Antonio, 78249, San Antonio, TX, USA

    Minghe Sun

  2. Terry College of Business, The University of Georgia, 30602, Athens, GA, USA

    Patrick G. McKeown

Authors
  1. Minghe Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Patrick G. McKeown
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sun, M., McKeown, P.G. Tabu search applied to the general fixed charge problem. Ann Oper Res 41, 405–420 (1993). https://doi.org/10.1007/BF02023003

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02023003

Keywords

Search

Navigation