参考文献:1.Metzger, B.H.: Spectrum management technique presented at 38th national orsa meeting. Detroit, MI (Fall 1970) (1970) 2.Garey, M.R., Johnson, D.S.: A Guide to the Theory of NP-Completeness. WH Freemann, New York (1979)MATH 3.Kapsalis, A., Chardaire, P., Rayward-Smith, V.J., Smith, G.D.: The radio link frequency assignment problem: a case study using genetic algorithms. In: Fogarty, T.C. (ed.) AISB-WS 1995. LNCS, vol. 993, pp. 117–131. Springer, Heidelberg (1995)CrossRef 4.Crisan, C., Mühlenbein, H.: The frequency assignment problem: a look at the performance of evolutionary search. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) AE 1997. LNCS, vol. 1363, pp. 263–273. Springer, Heidelberg (1998)CrossRef 5.Parsapoor, M., Bilstrup, U.: Ant colony optimization for channel assignment problem in a clustered mobile ad hoc network. In: Tan, Y., Shi, Y., Mo, H. (eds.) ICSI 2013, Part I. LNCS, vol. 7928, pp. 314–322. Springer, Heidelberg (2013)CrossRef 6.Tiourine, S.R., Hurkens, C.A.J., Lenstra, J.K.: Local search algorithms for the radio link frequency assignment problem. Telecommun. Syst. 13(2–4), 293–314 (2000)CrossRef MATH 7.Bouju, A., Boyce, J.F., Dimitropoulos, C.H.D., Vom Scheidt, G., Taylor, J.G.: Tabu search for the radio links frequency assignment problem. Applied Decision Technologies (ADT-95) (London) (1995) 8.Hao, J.-K., Dorne, R., Galinier, P.: Tabu search for frequency assignment in mobile radio networks. J. Heuristics 4(1), 47–62 (1998)CrossRef MATH 9.Bouju, A., Boyce, J.F., Dimitropoulos, C.H.D., Vom Scheidt, G., Taylor, J.G., Likas, A., Papageorgiou, G., Stafylopatis, A.: Intelligent search for the radio link frequency assignment problem. In: Proceedings of the International Conference on Digital Signal Processing, Cyprus (1995) 10.Glover, F., Laguna, M.: Tabu search applications. In: Glover, F., Laguna, M. (eds.) Tabu Search, pp. 267–303. Springer, Heidelberg (1997)CrossRef 11.Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)MathSciNet CrossRef MATH 12.Hale, W.K.: Frequency assignment: theory and applications. Proc. IEEE 68(12), 1497–1514 (1980)CrossRef 13.Dorne, R., Hao, J.-K.: Constraint handling in evolutionary search: a case study of the frequency assignment. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 801–810. Springer, Heidelberg (1996)CrossRef 14.Hao, J.-K., Perrier, L.: Tabu search for the frequency assignment problem in cellular radio networks. Technical report LGI2P, EMA-EERIE, Parc Scientifique Georges Besse, Nimes, France (1999) 15.Dowsland, K.A., Thompson, J.M.: An improved ant colony optimisation heuristic for graph colouring. Discrete Appl. Math. 156(3), 313–324 (2008)MathSciNet CrossRef MATH 16.Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Computing 39(4), 345–351 (1987)MathSciNet CrossRef MATH
作者单位:Khaled Alrajhi (20) Jonathan Thompson (20) Wasin Padungwech (20)
20. School of Mathematics, Cardiff University, Cardiff, UK
丛书名:Hybrid Metaheuristics
ISBN:978-3-319-39636-1
刊物类别:Computer Science
刊物主题:Artificial Intelligence and Robotics Computer Communication Networks Software Engineering Data Encryption Database Management Computation by Abstract Devices Algorithm Analysis and Problem Complexity
出版者:Springer Berlin / Heidelberg
ISSN:1611-3349
卷排序:9668
文摘
This study proposes a tabu search hybridized with multiple neighborhood structures to solve a variant of the frequency assignment problem known as the minimum order frequency assignment problem. This problem involves assigning frequencies to a set of requests while minimizing the number of frequencies used. Several novel and existing techniques are used to improve the efficiency of this algorithm. This includes a novel technique that aims to determine a lower bound on the number of frequencies required from each domain for a feasible solution to exist, based on the underlying graph coloring model. These lower bounds ensure that the search focuses on parts of the solution space that are likely to contain feasible solutions. Our tabu search algorithm was tested on real and randomly generated benchmark datasets of the static problem and achieved competitive results.