{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T15:45:39Z","timestamp":1769442339967,"version":"3.49.0"},"reference-count":30,"publisher":"Emerald","issue":"4","license":[{"start":{"date-parts":[[2018,11,12]],"date-time":"2018-11-12T00:00:00Z","timestamp":1541980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.emerald.com\/insight\/site-policies"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["JSIT"],"published-print":{"date-parts":[[2018,11,12]]},"abstract":"<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Purpose<\/jats:title>\n<jats:p>This paper aims to describe two enhancements of the variable neighbourhood search (VNS) algorithm to solve efficiently the minimum interference frequency assignment problem (MI-FAP) which is a major issue in the radio networks, as well as a well-known NP-hard combinatorial optimisation problem. The challenge is to assign a frequency to each transceiver of the network with limited or no interferences at all. Indeed, considering that the number of radio networks users is ever increasing and that the radio spectrum is a scarce and expensive resource, the latter should be carefully managed to avoid any interference.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Design\/methodology\/approach<\/jats:title>\n<jats:p>The authors suggest two new enhanced VNS variants for MI-FAP, namely, the iterated VNS (It-VNS) and the breakout VNS (BVNS). These two algorithms were designed based on the hybridising and the collaboration approaches that have emerged as two powerful means to solve hard combinatorial optimisation problems. Therefore, these two methods draw their strength from other meta-heuristics. In addition, the authors introduced a new mechanism of perturbation to enhance the performance of VNS. An extensive experiment was conducted to evaluate the performance of the proposed methods on some well-known MI-FAP datasets. Moreover, they carried out a comparative study with other metaheuristics and achieved the Friedman\u2019s non-parametric statistical test to check the actual effect of the proposed enhancements.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Findings<\/jats:title>\n<jats:p>The experiments showed that the two enhanced methods (It-VNS) and (BVNS) achieved better results than the VNS method. The comparative study with other meta-heuristics showed that the results are competitive and very encouraging. The Friedman\u2019s non-parametric statistical test reveals clearly that the results of the three methods (It-VNS, BVNS and VNS) are significantly different. The authors therefore carried out the Nemenyi\u2019s post hoc test which allowed us to identify those differences. The impact of the operated change on both the It-VNS and BVNS was thus confirmed. The proposed BVNS is competitive and able to produce good results as compared with both It-VNS and VNS for MI-FAP.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Research limitations\/implications<\/jats:title>\n<jats:p>Approached methods and particularly newly designed ones may have some drawbacks that weaken the results, in particular when dealing with extensive data. These limitations should therefore be eliminated through an appropriate approach with a view to design appropriate methods in the case of large-scale data.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Practical implications<\/jats:title>\n<jats:p>The authors designed and implemented two new variants of the VNS algorithm before carrying out an exhaustive experimental study. The findings highlighted the potential opportunities of these two enhanced methods which could be adapted and applied to other combinatorial optimisation problems, real world applications or academic problems.<\/jats:p>\n<\/jats:sec>\n<jats:sec>\n<jats:title content-type=\"abstract-subheading\">Originality\/value<\/jats:title>\n<jats:p>This paper aims at enhancing the VNS algorithm through two new approaches, namely, the It-VNS and the BVNS. These two methods were applied to the MI-FAP which is a crucial problem arising in a radio network. The numerical results are interesting and demonstrate the benefits of the proposed approaches in particular BVNS for MI-FAP.<\/jats:p>\n<\/jats:sec>","DOI":"10.1108\/jsit-10-2017-0094","type":"journal-article","created":{"date-parts":[[2018,11,16]],"date-time":"2018-11-16T09:09:38Z","timestamp":1542359378000},"page":"468-488","source":"Crossref","is-referenced-by-count":3,"title":["Breakout variable neighbourhood search for the minimum interference frequency assignment problem"],"prefix":"10.1108","volume":"20","author":[{"given":"Yasmine","family":"Lahsinat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dalila","family":"Boughaci","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Belaid","family":"Benhamou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"140","reference":[{"issue":"1","key":"key2020092606385776300_ref001","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10479-007-0178-0","article-title":"Models and solution techniques for frequency assignment problems","volume":"153","year":"2007","journal-title":"Annals of Operations Research"},{"issue":"1","key":"key2020092606385776300_ref002","first-page":"1","article-title":"Using cultural algorithm for the fixed-spectrum frequency assignment problem","volume":"2","year":"2008","journal-title":"The Journal of Mobile Communication"},{"issue":"9","key":"key2020092606385776300_ref003","doi-asserted-by":"crossref","first-page":"1814","DOI":"10.1109\/TMC.2012.153","article-title":"A new approach to fast near-optimal channel assignment in cellular mobile networks","volume":"12","year":"2013","journal-title":"IEEE Transactions on Mobile Computing"},{"issue":"2","key":"key2020092606385776300_ref004","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","article-title":"Genetic algorithms and random keys for sequencing and optimization","volume":"6","year":"1994","journal-title":"ORSA Journal on Computing"},{"key":"key2020092606385776300_ref005","article-title":"Frequency planning with respect to interference minimization in cellular radio network","year":"1999"},{"issue":"3","key":"key2020092606385776300_ref006","doi-asserted-by":"crossref","first-page":"1162","DOI":"10.1016\/j.engappai.2012.09.001","article-title":"Breakout local search for the max-cut problem","volume":"26","year":"2013","journal-title":"Engineering Applications of Artificial Intelligence"},{"issue":"2","key":"key2020092606385776300_ref007","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF02125459","article-title":"A tabu search algorithm for frequency assignment","volume":"63","year":"1996","journal-title":"Annals of Operations Research"},{"issue":"1","key":"key2020092606385776300_ref008","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/25.192382","article-title":"Channel assignment for cellular radio using simulated annealing","volume":"42","year":"1993","journal-title":"IEEE Transactions on Vehicular Technology"},{"issue":"1","key":"key2020092606385776300_ref009","doi-asserted-by":"crossref","first-page":"51","DOI":"10.7151\/dmgt.1158","article-title":"Frequency planning and ramifications of coloring","volume":"22","year":"2002","journal-title":"Discussiones Mathematicae Graph Theory"},{"issue":"1","key":"key2020092606385776300_ref010","article-title":"The fixed links frequency assignment problem with equipment","volume":"71","year":"2013","journal-title":"Wireless Personal Communications"},{"key":"key2020092606385776300_ref011","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/S0377-2217(99)00254-4","article-title":"Frequency assignment in mobile radio systems using branch-and-cut techniques","volume":"123","year":"2000","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"key2020092606385776300_ref012","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1109\/PROC.1980.11899","article-title":"Frequency assignment: theory and applications","volume":"68","year":"1980","journal-title":"Proceedings of the IEEE"},{"key":"key2020092606385776300_ref013","first-page":"118","article-title":"New hybrid matheuristics for solving the","volume-title":"International Workshop on Hybrid Metaheuristics","year":"2010"},{"issue":"3","key":"key2020092606385776300_ref014","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","article-title":"Variable neighbourhood search: principles and applications","volume":"130","year":"2001","journal-title":"European Journal of Operational Research"},{"key":"key2020092606385776300_ref015","volume-title":"Nonparametric Statistical Method","year":"2014"},{"key":"key2020092606385776300_ref016","article-title":"Harmony search based algorithms for the minimum interference frequency assignment problem","volume-title":"International Conference on Harmony Search Algorithm (ICHSA2017)","year":"2017"},{"key":"key2020092606385776300_ref017","volume-title":"Iterated Harmony Differential Search for the Minimum Interference Frequency Assignment Problem","year":"2017"},{"key":"key2020092606385776300_ref018","volume-title":"Methods and Algorithms for Radio Channel Assignment, Oxford Lecture Series in Mathematics and Its Applications","year":"2002"},{"key":"key2020092606385776300_ref019","article-title":"ACO vs EAs for solving a real-world frequency assignment problem in GSM networks","volume-title":"GECCO","year":"2007"},{"issue":"5","key":"key2020092606385776300_ref020","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1007\/s00500-010-0653-4","article-title":"Optimisation algorithms for large-scale real-world instances of the frequency assignment problem","volume":"15","year":"2011","journal-title":"Soft Computing"},{"issue":"3","key":"key2020092606385776300_ref021","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s10589-010-9376-9","article-title":"Genetic tabu search for robust fixed channel assignment under dynamic traffic data","volume":"50","year":"2011","journal-title":"Computational Optimisation and Applications"},{"key":"key2020092606385776300_ref022","article-title":"Spectrum management technique","volume-title":"Proceedings of the 38th National ORSA Meeting","year":"1970"},{"issue":"11","key":"key2020092606385776300_ref023","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","article-title":"Variable neighbourhood decomposition search","volume":"24","year":"1997","journal-title":"The Computer and Operations Research"},{"issue":"3","key":"key2020092606385776300_ref024","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1016\/j.cor.2008.08.006","article-title":"Heuristic manipulation, tabu search and frequency assignment","volume":"37","year":"2010","journal-title":"Computers and Operations Research"},{"issue":"4","key":"key2020092606385776300_ref025","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1109\/TVT.2003.810976","article-title":"An improved tabu search algorithm for the fixed spectrum frequency assignment problem","volume":"52","year":"2003","journal-title":"Ieee Transactions on Vehicular Technology"},{"issue":"3","key":"key2020092606385776300_ref026","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1016\/S0377-2217(03)00127-9","article-title":"An improved algorithm to determine lower bounds","volume":"156","year":"2004","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"key2020092606385776300_ref027","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s12293-010-0044-5","article-title":"Parallel hyperheuristics for the frequency assignment problem","volume":"3","year":"2011","journal-title":"Memetic Computing"},{"key":"key2020092606385776300_ref028","article-title":"Evaluation of models for area coverage","year":"1998"},{"issue":"4","key":"key2020092606385776300_ref029","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.comcom.2012.10.008","article-title":"The effective channel assignments in cognitive radio network","volume":"36","year":"2013","journal-title":"Computer Communications"},{"issue":"10","key":"key2020092606385776300_ref030","doi-asserted-by":"crossref","first-page":"4755","DOI":"10.1016\/j.eswa.2015.01.025","article-title":"Path relinking for the fixed spectrum frequency assignment problem","volume":"42","year":"2015","journal-title":"Expert Systems with Applications"}],"container-title":["Journal of Systems and Information Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/JSIT-10-2017-0094\/full\/xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.emerald.com\/insight\/content\/doi\/10.1108\/JSIT-10-2017-0094\/full\/html","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,24]],"date-time":"2025-07-24T22:24:02Z","timestamp":1753395842000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.emerald.com\/jsit\/article\/20\/4\/468-488\/247330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,12]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,11,12]]}},"alternative-id":["10.1108\/JSIT-10-2017-0094"],"URL":"https:\/\/doi.org\/10.1108\/jsit-10-2017-0094","relation":{},"ISSN":["1328-7265"],"issn-type":[{"value":"1328-7265","type":"print"}],"subject":[],"published":{"date-parts":[[2018,11,12]]}}}