The frequency assignment problem: A solution via nonlinear programming |
| |
| Authors: | J David Allen Richard V Helgason Jeffery L Kennington |
| |
| Institution: | 1. Switching Systems Division, Rockwell International, P.O. Box 10462, Dallas, Texas 75207;2. Operations Research Department, Southern Methodist University, Dallas, Texas 75275 |
| |
| 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. |
| |
| Keywords: | |
|
|
