IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-79409-7_39.html
   My bibliography  Save this book chapter

Constraint Hierarchy and Stochastic Local Search for Solving Frequency Assignment Problem

In: Modeling, Simulation and Optimization of Complex Processes

Author

Listed:
  • T. V. Su

    (HoChiMinh City University of Technology)

  • D. T. Anh

    (HoChiMinh City University of Technology)

Abstract

One approach for modeling over-constrained problems is using constraint hierarchies. In the constraint hierarchy framework, constraints are grouped into levels, and appropriate solutions are selected using a comparator which takes into account the constraints and their levels. Finite domain constraint hierarchy is one of the NP-hard optimization problems that have been studied for a long time due to its relevance to various application areas. Nevertheless, stochastic local search methods for solving finite domain constraint hierarchies remain largely unexplored. In this paper, we develop a variant of WSAT algorithm that can solve constraint hierarchies over finite domains. We experiment this generic algorithm in a real world application: solving Frequency Assignment Problem in the area of wireless communication. Experiments on benchmark Philadelphia instances of realistic sizes show that the proposed algorithm is an efficient heuristic to find good approximate solutions.

Suggested Citation

  • T. V. Su & D. T. Anh, 2008. "Constraint Hierarchy and Stochastic Local Search for Solving Frequency Assignment Problem," Springer Books, in: Hans Georg Bock & Ekaterina Kostina & Hoang Xuan Phu & Rolf Rannacher (ed.), Modeling, Simulation and Optimization of Complex Processes, pages 531-545, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-79409-7_39
    DOI: 10.1007/978-3-540-79409-7_39
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:sprchp:978-3-540-79409-7_39. 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.