IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v86y1999i0p259-27010.1023-a1018958819459.html
   My bibliography  Save this article

A surrogate constraint tabu thresholding implementation for the frequency assignmentproblem

Author

Listed:
  • D. Castelino
  • N. Stephens

Abstract

This paper presents a surrogate constraint tabu thresholding (SCTT) implementationfor solving the frequency assignment problem. The frequency assignment problem is animportant combinatorial optimisation problem that arises in telecommunications. The mainobjective is to assign radio frequencies to a number of communication links such that interferenceis minimised. Interference is minimised by satisfying a number of problem specificconstraints. The surrogate constraint is created by taking a weighted sum of the constraintsnot satisfied. SCTT is compared with a tabu thresholding method from the literature on a setof simulated but realistic test problems with respect to quality of the solution in a given timeperiod. Computational results show that SCTT is more efficient and effective for all the testproblems. Copyright Kluwer Academic Publishers 1999

Suggested Citation

  • D. Castelino & N. Stephens, 1999. "A surrogate constraint tabu thresholding implementation for the frequency assignmentproblem," Annals of Operations Research, Springer, vol. 86(0), pages 259-270, January.
    • Handle: RePEc:spr:annopr:v:86:y:1999:i:0:p:259-270:10.1023/a:1018958819459
    DOI: 10.1023/A:1018958819459
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018958819459
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018958819459?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:86:y:1999:i:0:p:259-270:10.1023/a:1018958819459. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.