IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v34y1987i1p133-139.html
   My bibliography  Save this article

The frequency assignment problem: A solution via nonlinear programming

Author

Listed:
  • J. David Allen
  • Richard V. Helgason
  • Jeffery L. Kennington

Abstract

This paper gives a mathematical programming model for the problem of assigning frequencies to nodes in a communications network. The objective is to select a frequency assignment which minimizes both cochannel and adjacent‐channel interference. In addition, a design engineer has the option to designate key links in which the avoidance of jamming due to self interference is given a higher priority. The model has a nonconvex quadratic objective function, generalized upper‐bounding constraints, and binary decision variables. We developed a special heuristic algorithm and software for this model and tested it on five test problems which were modifications of a real‐world problem. Even though most of the test problems had over 600 binary variables, we were able to obtain a near optimum in less than 12 seconds of CPU time on a CDC Cyber‐875.

Suggested Citation

  • J. David Allen & Richard V. Helgason & Jeffery L. Kennington, 1987. "The frequency assignment problem: A solution via nonlinear programming," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(1), pages 133-139, February.
    • Handle: RePEc:wly:navres:v:34:y:1987:i:1:p:133-139
    DOI: 10.1002/1520-6750(198702)34:13.0.CO;2-W
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(198702)34:13.0.CO;2-W
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(198702)34:13.0.CO;2-W?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
    ---><---

    References listed on IDEAS

    as
    1. M. Collins & L. Cooper & R. Helgason & J. Kennington & L. LeBlanc, 1978. "Solving the Pipe Network Analysis Problem Using Optimization Techniques," Management Science, INFORMS, vol. 24(7), pages 747-760, March.
    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. Charles H. Reilly & Clark A. Mount‐Campbell & Fernando Mata & Eric K. Walton & Eric A. Aebker & Curt A. Levis, 1991. "A two‐phase procedure for allotting geostationary orbital locations to communications satellites," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(6), pages 779-797, 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. Hong, Sung-Pil & Kim, Taegyoon & Lee, Subin, 2019. "A precision pump schedule optimization for the water supply networks with small buffers," Omega, Elsevier, vol. 82(C), pages 24-37.
    2. Fränk Plein & Johannes Thürauf & Martine Labbé & Martin Schmidt, 2022. "A bilevel optimization approach to decide the feasibility of bookings in the European gas market," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 95(3), pages 409-449, June.
    3. Lars Schewe & Martin Schmidt & Johannes Thürauf, 2022. "Global optimization for the multilevel European gas market system with nonlinear flow models on trees," Journal of Global Optimization, Springer, vol. 82(3), pages 627-653, March.
    4. Marins, Fernando A. S. & Senne, Edson L. F. & Darby-Dowman, Ken & Machado, Arlene F. & Perin, Clovis, 1997. "Algorithms for network piecewise-linear programs: A comparative study," European Journal of Operational Research, Elsevier, vol. 97(1), pages 183-199, February.
    5. Antoine Gautier & Frieda Granot, 1996. "Ripples, complements, and substitutes in generalized networks," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(1), pages 1-21, February.
    6. Lars Schewe & Martin Schmidt & Johannes Thürauf, 2020. "Computing technical capacities in the European entry-exit gas market is NP-hard," Annals of Operations Research, Springer, vol. 295(1), pages 337-362, December.
    7. Brkic, Dejan, 2009. "An improvement of Hardy Cross method applied on looped spatial natural gas distribution networks," Applied Energy, Elsevier, vol. 86(7-8), pages 1290-1300, July.
    8. Ralf Lenz & Kai Helge Becker, 2022. "Optimization of capacity expansion in potential-driven networks including multiple looping: a comparison of modelling approaches," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 44(1), pages 179-224, March.
    9. Spyros Kontogiorgis, 2000. "Practical Piecewise-Linear Approximation for Monotropic Optimization," INFORMS Journal on Computing, INFORMS, vol. 12(4), pages 324-340, November.
    10. Jesco Humpola & Armin Fügenschuh, 2015. "Convex reformulations for solving a nonlinear network design problem," Computational Optimization and Applications, Springer, vol. 62(3), pages 717-759, December.
    11. Lonnie Turpin & Barron Brown, 2021. "On Reworks in a Serial Process with Flexible Windows of Time," SN Operations Research Forum, Springer, vol. 2(2), pages 1-13, June.
    12. Martin Robinius & Lars Schewe & Martin Schmidt & Detlef Stolten & Johannes Thürauf & Lara Welder, 2019. "Robust optimal discrete arc sizing for tree-shaped potential networks," Computational Optimization and Applications, Springer, vol. 73(3), pages 791-819, July.
    13. D’Ambrosio, Claudia & Lodi, Andrea & Wiese, Sven & Bragalli, Cristiana, 2015. "Mathematical programming techniques in water network optimization," European Journal of Operational Research, Elsevier, vol. 243(3), pages 774-788.

    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:wly:navres:v:34:y:1987:i:1:p:133-139. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.