IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v153y2007i1p79-12910.1007-s10479-007-0178-0.html
   My bibliography  Save this article

Models and solution techniques for frequency assignment problems

Author

Listed:
  • Karen Aardal
  • Stan Hoesel
  • Arie Koster
  • Carlo Mannino
  • Antonio Sassano

Abstract

Wireless communication is used in many different situations such as mobile telephony, radio and TV broadcasting, satellite communication, wireless LANs, and military operations. In each of these situations a frequency assignment problem arises with application specific characteristics. Researchers have developed different modeling ideas for each of the features of the problem, such as the handling of interference among radio signals, the availability of frequencies, and the optimization criterion. This survey gives an overview of the models and methods that the literature provides on the topic. We present a broad description of the practical settings in which frequency assignment is applied. We also present a classification of the different models and formulations described in the literature, such that the common features of the models are emphasized. The solution methods are divided in two parts. Optimization and lower bounding techniques on the one hand, and heuristic search techniques on the other hand. The literature is classified according to the used methods. Again, we emphasize the common features, used in the different papers. The quality of the solution methods is compared, whenever possible, on publicly available benchmark instances. Copyright Springer Science+Business Media, LLC 2007

Suggested Citation

  • Karen Aardal & Stan Hoesel & Arie Koster & Carlo Mannino & Antonio Sassano, 2007. "Models and solution techniques for frequency assignment problems," Annals of Operations Research, Springer, vol. 153(1), pages 79-129, September.
  • Handle: RePEc:spr:annopr:v:153:y:2007:i:1:p:79-129:10.1007/s10479-007-0178-0
    DOI: 10.1007/s10479-007-0178-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10479-007-0178-0
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s10479-007-0178-0?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.

    References listed on IDEAS

    as
    1. Rudolf Mathar & Michael Schmeink, 2001. "Optimal Base Station Positioning and Channel Assignment for 3G Mobile Networks by Integer Programming," Annals of Operations Research, Springer, vol. 107(1), pages 225-236, October.
    2. Anuj Mehrotra & Michael A. Trick, 1996. "A Column Generation Approach for Graph Coloring," INFORMS Journal on Computing, INFORMS, vol. 8(4), pages 344-354, November.
    3. R. Borndörfer & A. Eisenblätter & M. Grötschel & A. Martin, 1998. "Frequency assignment in cellular phone networks," Annals of Operations Research, Springer, vol. 76(0), pages 73-93, January.
    4. Fischetti, Matteo & Lepschy, Chiara & Minerva, Giuseppe & Romanin-Jacur, Giorgio & Toto, Ema, 2000. "Frequency assignment in mobile radio systems using branch-and-cut techniques," European Journal of Operational Research, Elsevier, vol. 123(2), pages 241-255, June.
    5. Smith, D. H. & Hurley, S. & Thiel, S. U., 1998. "Improving heuristics for the frequency assignment problem," European Journal of Operational Research, Elsevier, vol. 107(1), pages 76-86, May.
    6. Baybars, Ilker, 1982. "Optimal assignment of broadcasting frequencies," European Journal of Operational Research, Elsevier, vol. 9(3), pages 257-263, March.
    7. Audrey Dupont & Eric Alvernhe & Michel Vasquez, 2004. "Efficient Filtering and Tabu Search on a Consistent Neighbourhood for the Frequency Assignment Problem with Polarisation," Annals of Operations Research, Springer, vol. 130(1), pages 179-198, August.
    8. Montemanni, R. & Smith, D. H. & Allen, S. M., 2004. "An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem," European Journal of Operational Research, Elsevier, vol. 156(3), pages 736-751, August.
    9. Backhaus, J.G., 1996. "Good economics, bad economics, and European economics," Research Memorandum 007, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    10. Kalvenes, Joakim & Kennington, Jeffery & Olinick, Eli, 2005. "Hierarchical cellular network design with channel allocation," European Journal of Operational Research, Elsevier, vol. 160(1), pages 3-18, January.
    11. Karen Aardal & Cor Hurkens & Jan Karel Lenstra & Sergey Tiourine, 2002. "Algorithms for Radio Link Frequency Assignment: The Calma Project," Operations Research, INFORMS, vol. 50(6), pages 968-980, December.
    12. Thuve, H., 1981. "Frequency planning as a set partitioning problem," European Journal of Operational Research, Elsevier, vol. 6(1), pages 29-37, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Simon Thevenin & Nicolas Zufferey & Jean-Yves Potvin, 2017. "Makespan minimisation for a parallel machine scheduling problem with preemption and job incompatibility," International Journal of Production Research, Taylor & Francis Journals, vol. 55(6), pages 1588-1606, March.
    2. Natalia Castro & María A. Garrido-Vizuete & Rafael Robles & María Trinidad Villar-Liñán, 2020. "Contrast in greyscales of graphs," Journal of Combinatorial Optimization, Springer, vol. 39(3), pages 874-898, April.
    3. Dupont, Audrey & Linhares, Andréa Carneiro & Artigues, Christian & Feillet, Dominique & Michelon, Philippe & Vasquez, Michel, 2009. "The dynamic frequency assignment problem," European Journal of Operational Research, Elsevier, vol. 195(1), pages 75-88, May.
    4. Grit Claßen & Arie M. C. A. Koster & David Coudert & Napoleão Nepomuceno, 2014. "Chance-Constrained Optimization of Reliable Fixed Broadband Wireless Networks," INFORMS Journal on Computing, INFORMS, vol. 26(4), pages 893-909, November.
    5. Yiting Xing & Ling Li & Zhuming Bi & Marzena Wilamowska‐Korsak & Li Zhang, 2013. "Operations Research (OR) in Service Industries: A Comprehensive Review," Systems Research and Behavioral Science, Wiley Blackwell, vol. 30(3), pages 300-353, May.
    6. Péter Madarasi, 2021. "Matchings under distance constraints I," Annals of Operations Research, Springer, vol. 305(1), pages 137-161, October.
    7. Chinneck, John W. & Hafez, Roshdy H.M., 2016. "Fast heuristics for the frequency channel assignment problem in multi-hop wireless networksAuthor-Name: Chaudhry, Aizaz U," European Journal of Operational Research, Elsevier, vol. 251(3), pages 771-782.
    8. Carlos-Iván Páez-Rueda & Arturo Fajardo & Manuel Pérez & German Yamhure & Gabriel Perilla, 2023. "The F/DR-D-10 Algorithm: A Novel Heuristic Strategy to Solve the Minimum Span Frequency Assignment Problem Embedded in Mobile Applications," Mathematics, MDPI, vol. 11(20), pages 1-14, October.
    9. Ivan Marsa-Maestre & Enrique Hoz & Jose Manuel Gimenez-Guzman & David Orden & Mark Klein, 2019. "Nonlinear Negotiation Approaches for Complex-Network Optimization: A Study Inspired by Wi-Fi Channel Assignment," Group Decision and Negotiation, Springer, vol. 28(1), pages 175-196, February.
    10. Bradley Hardy & Rhyd Lewis & Jonathan Thompson, 2018. "Tackling the edge dynamic graph colouring problem with and without future adjacency information," Journal of Heuristics, Springer, vol. 24(3), pages 321-343, June.
    11. Jamie Fairbrother & Adam N. Letchford & Keith Briggs, 2018. "A two-level graph partitioning problem arising in mobile wireless communications," Computational Optimization and Applications, Springer, vol. 69(3), pages 653-676, April.
    12. Hawa, Asyl L. & Lewis, Rhyd & Thompson, Jonathan M., 2022. "Exact and approximate methods for the score-constrained packing problem," European Journal of Operational Research, Elsevier, vol. 302(3), pages 847-859.
    13. Fabrizio Borghini & Isabel Méndez-Díaz & Paula Zabala, 2020. "An exact algorithm for the edge coloring by total labeling problem," Annals of Operations Research, Springer, vol. 286(1), pages 11-31, March.
    14. Kata Kiatmanaroj & Christian Artigues & Laurent Houssin & Frédéric Messine, 2013. "Frequency assignment in a SDMA satellite communication system with beam decentring feature," Computational Optimization and Applications, Springer, vol. 56(2), pages 439-455, October.
    15. Edmund Burke & Jakub Mareček & Andrew Parkes & Hana Rudová, 2010. "A supernodal formulation of vertex colouring with applications in course timetabling," Annals of Operations Research, Springer, vol. 179(1), pages 105-130, September.
    16. Jaka Kranjc & Borut Lužar & Martina Mockovčiaková & Roman Soták, 2014. "Note on coloring of double disk graphs," Journal of Global Optimization, Springer, vol. 60(4), pages 793-799, December.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dupont, Audrey & Linhares, Andréa Carneiro & Artigues, Christian & Feillet, Dominique & Michelon, Philippe & Vasquez, Michel, 2009. "The dynamic frequency assignment problem," European Journal of Operational Research, Elsevier, vol. 195(1), pages 75-88, May.
    2. Koster A.M.C.A. & Hoesel S.P.M. van & Kolen A.W.J., 1999. "Solving frequency assignment problems via tree-decomposition," Research Memorandum 036, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    3. Joakim Kalvenes & Jeffery Kennington & Eli Olinick, 2006. "Base Station Location and Service Assignments in W--CDMA Networks," INFORMS Journal on Computing, INFORMS, vol. 18(3), pages 366-376, August.
    4. Koster, Arie & van Hoesel, C.P.M. & Kolen, A.W.J., 1999. "Solving frequency assignment problems via tree-decomposition," Research Memorandum 011, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
    5. Alex Gliesch & Marcus Ritt, 2022. "A new heuristic for finding verifiable k-vertex-critical subgraphs," Journal of Heuristics, Springer, vol. 28(1), pages 61-91, February.
    6. Montemanni, R. & Smith, D. H. & Allen, S. M., 2004. "An improved algorithm to determine lower bounds for the fixed spectrum frequency assignment problem," European Journal of Operational Research, Elsevier, vol. 156(3), pages 736-751, August.
    7. Xiao-Feng Xie & Jiming Liu, 2009. "Graph coloring by multiagent fusion search," Journal of Combinatorial Optimization, Springer, vol. 18(2), pages 99-123, August.
    8. N. Cherfi & M. Hifi, 2010. "A column generation method for the multiple-choice multi-dimensional knapsack problem," Computational Optimization and Applications, Springer, vol. 46(1), pages 51-73, May.
    9. M Plumettaz & D Schindl & N Zufferey, 2010. "Ant Local Search and its efficient adaptation to graph colouring," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(5), pages 819-826, May.
    10. Chen, Lei & Yuan, Di, 2010. "Solving a minimum-power covering problem with overlap constraint for cellular network design," European Journal of Operational Research, Elsevier, vol. 203(3), pages 714-723, June.
    11. Massimiliano Caramia & Paolo Dell'Olmo, 2001. "Iterative coloring extension of a maximum clique," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(6), pages 518-550, September.
    12. Syam Menon & Rakesh Gupta, 2008. "Optimal Broadcast Scheduling in Packet Radio Networks via Branch and Price," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 391-399, August.
    13. Zacharie Ales & Céline Engelbeen & Rosa Figueiredo, 2024. "Correlation Clustering Problem Under Mediation," INFORMS Journal on Computing, INFORMS, vol. 36(2), pages 672-689, March.
    14. D Briskorn & A Drexl, 2009. "A branch-and-price algorithm for scheduling sport leagues," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 84-93, January.
    15. Claudio Gambella & Joe Naoum-Sawaya & Bissan Ghaddar, 2018. "The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches," INFORMS Journal on Computing, INFORMS, vol. 30(3), pages 554-569, August.
    16. Andreas Eisenblätter & Hans-Florian Geerdes & Thorsten Koch & Alexander Martin & Roland Wessäly, 2006. "UMTS radio network evaluation and optimization beyond snapshots," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 63(1), pages 1-29, February.
    17. Li, Ran & Tong, Daoqin, 2017. "Incorporating activity space and trip chaining into facility siting for accessibility maximization," Socio-Economic Planning Sciences, Elsevier, vol. 60(C), pages 1-14.
    18. Jay M. Rosenberger & Eli V. Olinick, 2007. "Robust tower location for code division multiple access networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 54(2), pages 151-161, March.
    19. Muñoz, Susana & Teresa Ortuño, M. & Ramírez, Javier & Yáñez, Javier, 2005. "Coloring fuzzy graphs," Omega, Elsevier, vol. 33(3), pages 211-221, June.
    20. Caramia, Massimiliano & Dell'Olmo, Paolo, 2008. "Embedding a novel objective function in a two-phased local search for robust vertex coloring," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1358-1380, September.

    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:153:y:2007:i:1:p:79-129:10.1007/s10479-007-0178-0. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.