Repozitorij Univerze v Novi Gorici

Iskanje po repozitoriju
A+ | A- | Pomoč | SLO | ENG

Iskalni niz: išči po
išči po
išči po
išči po
* po starem in bolonjskem študiju

Opcije:
  Ponastavi


1 - 7 / 7
Na začetekNa prejšnjo stran1Na naslednjo stranNa konec
1.
2.
An efficient algorithm for PMFAP
Soumen Atta, Priya Ranjan Sinha Mahapatra, 2016, objavljeni znanstveni prispevek na konferenci

Opis: 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.
Ključne besede: Frequency Assignment Problem (FAP), Perturbation-Minimizing Frequency Assignment Problem (PMFAP), Perturbation, Heuristic Algorithm
Objavljeno v RUNG: 05.06.2023; Ogledov: 989; Prenosov: 0
Gradivo ima več datotek! Več...

3.
A New Variant of Dynamic Pickup and Delivery Problem with Time Windows
Petr Valenta, Hana Rudová, Soumen Atta, 2020, objavljeni znanstveni prispevek na konferenci

Opis: Motivated by the challenges faced by a logistics company, we present a new variant of the dynamic capacitated pickup and delivery problem with time windows (PDPTW) where excessive changes of unaffected routes are undesirable. In real-life scenarios, different dynamism sources such as canceled requests, change of demands, change of pickup, or delivery time windows often disrupt the existing planning of routes. The static PDPTW is solved with the current information about the problem well before executing the routes, such as the previous night. We present an algorithmic idea of a dynamic solver quickly addressing changes that occur due to the dynamism while avoiding excessive modifications to the previous solution. Since the company has not yet the dynamic data, new dynamic instances are generated from the existing static PDPTW instances in the literature. Preliminary results demonstrate that we can quickly incorporate the required changes. Future perspectives of this ongoing work are discussed in the end.
Ključne besede: Dynamic Pickup and Delivery Problem, Time Windows, Heuristic
Objavljeno v RUNG: 17.04.2023; Ogledov: 2342; Prenosov: 0
Gradivo ima več datotek! Več...

4.
Population-based improvement heuristic with local search for single-row facility layout problem
Soumen Atta, Priya Ranjan Sinha Mahapatra, 2019, izvirni znanstveni članek

Opis: The Single-Row Facility Layout Problem (SRFLP) is a well-known combinatorial optimization problem. The objective of SRFLP is to find out the arrangement of facilities with given lengths on a line so that the weighted sum of the distances between all pairs of facilities is minimized. This problem is known to be NP-hard. Hence, a population-based improvement heuristic algorithm with local search is presented in this article to solve SRFLP. The proposed algorithm works well also for the Single-Row Equidistant Facility Layout Problem (SREFLP), where the length of each facility is equal. The computational efficiency of the proposed algorithm is checked with the instances of sizes ranging from 5 to 300 available in the literature for SRFLP and SREFLP. The obtained results are compared to those from different state-of-the-art algorithms. The proposed algorithm achieves best known solutions to date for every instance considered in this article in reasonable computational time.
Ključne besede: Single-row facility layout problem (SRFLP), single-row equidistant facility layout problem (SREFLP), population-based heuristic, improvement heuristic, local search
Objavljeno v RUNG: 17.04.2023; Ogledov: 906; Prenosov: 0
Gradivo ima več datotek! Več...

5.
Perturbation-minimising frequency assignment to address short term demand fluctuation in cellular network
Soumen Atta, Priya Ranjan Sinha Mahapatra, 2018, izvirni znanstveni članek

Opis: 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.
Ključne besede: short term demand fluctuation, frequency assignment problem, FAP, PMFAP, cellular network, perturbation, heuristic algorithm
Objavljeno v RUNG: 17.04.2023; Ogledov: 838; Prenosov: 0
Gradivo ima več datotek! Več...

6.
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, izvirni znanstveni članek

Opis: 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.
Ključne besede: ant colony optimization, bat algorithm, common service center, e-governance, fuzzy clustering, meta-heuristic algorithm, particle swarm optimization
Objavljeno v RUNG: 01.04.2021; Ogledov: 2035; Prenosov: 10
URL Povezava na celotno besedilo
Gradivo ima več datotek! Več...

7.
A comprehensive review of approaches used for solving tele-centre location allocation problem in geographical plane
Rajan Gupta, Sunil K. Muttoo, Saibal K. Pal, 2021, pregledni znanstveni članek

Opis: Setup of tele-centre is the worldwide approach for the establishment of information and communication technology infrastructure in rural areas for the overall development of a country. It is a key resource under e-governance plan in any country, but a major problem with their location allocation is the sustainability. Tele-centre establishment require a suitable location to increase the beneficial effect to service seekers. In this research, multi-faceted problems faced by tele-centres are highlighted. This paper presents a comprehensive study on tele-centre’s location allocation problem and all the recent development in multi-facility location problem research area through more than 150 research papers from high ranked peer-reviewed journals. The research survey examines all the important parameters for the facility location problem and an objective function is also formulated for the same. Based on the survey literature, it is found that the new allocation methods based on meta-heuristic algorithms are emerging. This study would be a useful contribution in the field of location science, tele-centre location allocation and application of meta-heuristic algorithms in e-governance.
Ključne besede: tele-centres, location allocation, common service centres, rural kiosks, meta-heuristic algorithms, e-governance, geographical plane
Objavljeno v RUNG: 01.04.2021; Ogledov: 1953; Prenosov: 57
URL Povezava na celotno besedilo
Gradivo ima več datotek! Več...

Iskanje izvedeno v 0.04 sek.
Na vrh