Repository of University of Nova Gorica

Search the repository
A+ | A- | Help | SLO | ENG

Query: search in
search in
search in
search in
* old and bologna study programme

Options:
  Reset


1 - 4 / 4
First pagePrevious page1Next pageLast page
1.
2.
An efficient algorithm for PMFAP
Soumen Atta, Priya Ranjan Sinha Mahapatra, 2016, published scientific conference contribution

Abstract: Perturbation-Minimizing Frequency Assignment Problem (PMFAP) is a frequency assignment problem in which newly generated demands are satisfied with minimum change in the already existing frequency assignment keeping all the interference constraints. In this paper an efficient heuristic algorithm for PMFAP is presented. The efficiency of this algorithm is compared with the existing results from literature. The proposed algorithm also works for the well-known Frequency Assignment Problem (FAP) and its performance is compared with the existing results for the standard benchmark data sets.
Keywords: Frequency Assignment Problem (FAP), Perturbation-Minimizing Frequency Assignment Problem (PMFAP), Perturbation, Heuristic Algorithm
Published in RUNG: 05.06.2023; Views: 1904; Downloads: 0
This document has many files! More...

3.
Perturbation-minimising frequency assignment to address short term demand fluctuation in cellular network
Soumen Atta, Priya Ranjan Sinha Mahapatra, 2018, original scientific article

Abstract: In cellular network short term demand fluctuation is a very common phenomenon. The demand of any cell may increase or decrease slightly or the system may expand by adding additional cells or the system may shrink if the demands of certain number of cells become zero. In this paper, the perturbation-minimising frequency assignment problem (PMFAP) is considered to address the short term fluctuation in demand vector. PMFAP is a frequency assignment problem in which newly generated demands are satisfied with minimum changes in the already existing frequency assignment keeping all the interference constraints. In this paper, an efficient heuristic algorithm for PMFAP is presented. The efficiency of this algorithm is compared with the existing results from literature. With a slight modification to the proposed algorithm, it can solve the well-known frequency assignment problem (FAP) and its performance is also compared with the existing results using the standard benchmark data sets for FAP.
Keywords: short term demand fluctuation, frequency assignment problem, FAP, PMFAP, cellular network, perturbation, heuristic algorithm
Published in RUNG: 17.04.2023; Views: 1949; Downloads: 0
This document has many files! More...

4.
Meta-heuristic algorithms to improve fuzzy C-means and K-means clustering for location allocation of telecenters under e-governance in developing nations
Rajan Gupta, Sunil K. Muttoo, Saibal K. Pal, 2019, original scientific article

Abstract: The telecenter, popularly known as the rural kiosk or common service center, is an important building block for the improvement of e-governance in developing nations as they help in better citizen engagement. Setting up of these centers at appropriate locations is a challenging task; inappropriate locations can lead to a huge loss to the government and allied stakeholders. This study proposes the use of various meta-heuristic algorithms (particle swarm optimization, bat algorithm, and ant colony optimization) for the improvement of traditional clustering approaches (K-means and fuzzy C-means) used in the facility location allocation problem and maps them for the betterment of telecenter location allocation. A dataset from the Indian region was considered for the purpose of this experiment. The performance of the algorithms when applied to traditional facility location allocation problems such as set-cover, P-median, and the P-center problem was investigated, and it was found that their efficiency improved by 20%–25% over that of existing algorithms.
Keywords: ant colony optimization, bat algorithm, common service center, e-governance, fuzzy clustering, meta-heuristic algorithm, particle swarm optimization
Published in RUNG: 01.04.2021; Views: 2843; Downloads: 11
URL Link to full text
This document has many files! More...

Search done in 0.02 sec.
Back to top