{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:43:39Z","timestamp":1725857019675},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319396354"},{"type":"electronic","value":"9783319396361"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-39636-1_12","type":"book-chapter","created":{"date-parts":[[2016,5,24]],"date-time":"2016-05-24T10:36:37Z","timestamp":1464086197000},"page":"157-170","source":"Crossref","is-referenced-by-count":3,"title":["Tabu Search Hybridized with Multiple Neighborhood Structures for the Frequency Assignment Problem"],"prefix":"10.1007","author":[{"given":"Khaled","family":"Alrajhi","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Thompson","sequence":"additional","affiliation":[]},{"given":"Wasin","family":"Padungwech","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,24]]},"reference":[{"key":"12_CR1","unstructured":"Metzger, B.H.: Spectrum management technique presented at 38th national orsa meeting. Detroit, MI (Fall 1970) (1970)"},{"key":"12_CR2","volume-title":"A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: A Guide to the Theory of NP-Completeness. WH Freemann, New York (1979)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/3-540-60469-3_30","volume-title":"Evolutionary Computing","author":"A Kapsalis","year":"1995","unstructured":"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\u2013131. Springer, Heidelberg (1995)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BFb0026606","volume-title":"Artificial Evolution","author":"C Crisan","year":"1998","unstructured":"Crisan, C., M\u00fchlenbein, 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\u2013273. Springer, Heidelberg (1998)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/978-3-642-38703-6_37","volume-title":"Advances in Swarm Intelligence","author":"M Parsapoor","year":"2013","unstructured":"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\u2013322. Springer, Heidelberg (2013)"},{"issue":"2\u20134","key":"12_CR6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/A:1019100324508","volume":"13","author":"SR Tiourine","year":"2000","unstructured":"Tiourine, S.R., Hurkens, C.A.J., Lenstra, J.K.: Local search algorithms for the radio link frequency assignment problem. Telecommun. Syst. 13(2\u20134), 293\u2013314 (2000)","journal-title":"Telecommun. Syst."},{"key":"12_CR7","unstructured":"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)"},{"issue":"1","key":"12_CR8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1023\/A:1009690321348","volume":"4","author":"J-K Hao","year":"1998","unstructured":"Hao, J.-K., Dorne, R., Galinier, P.: Tabu search for frequency assignment in mobile radio networks. J. Heuristics 4(1), 47\u201362 (1998)","journal-title":"J. Heuristics"},{"key":"12_CR9","unstructured":"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)"},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1007\/978-1-4615-6089-0_8","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu search applications. In: Glover, F., Laguna, M. (eds.) Tabu Search, pp. 267\u2013303. Springer, Heidelberg (1997)"},{"issue":"11","key":"12_CR11","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"12","key":"12_CR12","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","volume":"68","author":"WK Hale","year":"1980","unstructured":"Hale, W.K.: Frequency assignment: theory and applications. Proc. IEEE 68(12), 1497\u20131514 (1980)","journal-title":"Proc. IEEE"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1007\/3-540-61723-X_1043","volume-title":"Parallel Problem Solving from Nature - PPSN IV","author":"R Dorne","year":"1996","unstructured":"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\u2013810. Springer, Heidelberg (1996)"},{"key":"12_CR14","unstructured":"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)"},{"issue":"3","key":"12_CR15","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/j.dam.2007.03.025","volume":"156","author":"KA Dowsland","year":"2008","unstructured":"Dowsland, K.A., Thompson, J.M.: An improved ant colony optimisation heuristic for graph colouring. Discrete Appl. Math. 156(3), 313\u2013324 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"12_CR16","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A Hertz","year":"1987","unstructured":"Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Computing 39(4), 345\u2013351 (1987)","journal-title":"Computing"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-39636-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:45:15Z","timestamp":1498315515000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-39636-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319396354","9783319396361"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-39636-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}