Abstract
Purpose – The purpose of this paper is to study the use of a heterogeneous and evolutionary team approach based on different sources of knowledge to address a real-world problem within the telecommunication domain: the frequency assignment problem (FAP). Evolutionary algorithms have been proved as very suitable strategies when they are used to solve NP-hard optimization problems. However, these algorithms can find difficulties when they fall into local minima and the generation of high-quality solutions when tacking real-world instances of the problem is computationally very expensive. In this scenario, the use of a heterogeneous parallel team represents a very interesting approach. Design/methodology/approach – The results have been validated by using two real-world telecommunication instances which contain real information about two GSM networks. Contrary to most of related publications, this paper is focussed on aspects which are relevant for real communication networks. Moreover, due to the stochastic nature of metaheuristics, the results are validated through a formal statistical analysis. This analysis is divided in two stages: first, a complete statistical study, and after that, a full comparative study against results previously published. Findings – Comparative study shows that a heterogeneous evolutionary proposal obtains better results than proposals which are based on a unique source of knowledge. In fact, final results provided in the work surpass the results of other relevant studies previously published in the literature. Originality/value – The paper provides a complete study of the contribution provided by the different metaheuristics included in the team and the impact of using different sources of evolutionary knowledge when the system is applied to solve a real-world FAP problem. The conclusions obtained in this study represent an original contribution never reached before for FAP.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.