Iskanje po repozitoriju

A+ | A- | | SLO | ENG

Opis: In this article, the single allocation p-hub location problem (SApHLP) with a ring backbone network for content placement in VoD services is proposed. In VoD services, a large volume of digital data is kept as data segments in spatially distributed hubs. In SApHLP, each user is restricted to be allocated only to a single hub, and here hubs form a ring backbone network. SApHLP jointly addresses (i) the locations of hubs, (ii) the placement of segments to hubs, (iii) the allocation of users to hubs as per their demands, and (iv) the optimal paths to route the demands from users to hubs. We have introduced network flow-based 3-subscripted and path-based 4-subscripted MILP formulations of SApHLP. This article presents a novel discrete particle swarm optimization (PSO)-based approach where factoradic numbers are used to encode solution. It also incorporates three problem-specific solution refinement methods for faster convergence. In this article, SApHLP instances are generated from a real-world database of video files obtained from a movie recommender system. The benchmark solutions are generated using IBM’s CPLEX optimizer with default settings and Benders decomposition strategy. The performance of the proposed PSO is compared with the benchmark results produced by CPLEX.
Ključne besede: Single allocation p-hub location problem, Ring backbone network, VoD services, Particle Swarm Optimization (PSO), Factoradics, CPLEX
Objavljeno v RUNG: 17.04.2023; Ogledov: 790; Prenosov: 0
Gradivo ima več datotek! Več...

Opis: The Maximal Covering Location Problem (MCLP) is concerned with the optimal placement of a fixed number of facilities to cover the maximum number of customers. This article considers a new variant of MCLP where both the coverage radii of facilities and the distance between customer and facility are fuzzy. Moreover, the finite capacity of each facility is considered. We call this problem the capacitated MCLP with fuzzy coverage area (FCMCLP), and it is formulated as a 0–1 linear programming problem. In this article, two classical metaheuristics: particle swarm optimization, differential evolution, and two new-generation metaheuristics: artificial bee colony algorithm, firefly algorithm, are proposed for solving FCMCLP. Each of the customized metaheuristics utilizes a greedy deterministic heuristic to generate their initial populations. They also incorporate a local neighborhood search to improve their convergence rates. New instances of FCMCLP are generated from the traditional MCLP instances available in the literature, and IBM’s CPLEX solver is used to generate benchmark solutions. An experimental comparative study among the four customized metaheuristics is described in this article. The performances of the proposed metaheuristics are also compared with the benchmark solutions obtained from CPLEX.
Ključne besede: Facility Location Problem (FLP), Fuzzy Capacitated Maximal Covering Location Problem (FCMCLP), Particle Swarm Optimization (PSO), Differential Evolution (DE), Artificial Bee Colony (ABC), Firefly Algorithm (FA)
Objavljeno v RUNG: 08.03.2023; Ogledov: 1321; Prenosov: 0
Gradivo ima več datotek! Več...

Opis: In this paper, we describe the key research questions handled during the doctoral work done in the area of E-Governance. The five research questions in the study are related to the concepts like Development of E-Governance & its assessment, Infrastructure management to reach out to maximum citizens, Various types of Security concerns faced during the E-Governance Development, Analyzing the E-Governance transaction pattern to capture citizen's interest, and finally the way ahead for the E-Governance development through the route of efficiency and optimization in the service designing. The methodology adopted and results obtained for various research questions are discussed at high level. Some portion of the current work is still in progress.
Ključne besede: e-governance, location allocation, common service centers, intrusion detection system, security, analytics
Objavljeno v RUNG: 02.04.2021; Ogledov: 1916; Prenosov: 56
Povezava na celotno besedilo
Gradivo ima več datotek! Več...

Opis: Rural Kiosks are important infrastructural pillar in rural regions for internet and basic technology facility all around the world. They are also known as Tele-centers or Common Service Centers and are majorly used by government to promote Electronic Governance. The major characteristic of setting up of Rural Kiosk is their appropriate location so that people from rural region can avail the services at minimum travel cost and time. There are lot of traditional schemes used by researchers in past for location allocation but this paper proposes the usage of Fuzzy C-Means clustering and BAT algorithm to optimize the location of Rural Kiosk. The meta-heuristic approach has produced better results as compared to normal graph theories in past. The experiment has been conducted on a random data set of 72 village locations from India and their clusters are formed. It is found that using only Fuzzy C-Means clustering to allocate the center and by using it in combination with BAT algorithm produced up to 25% of efficient results. This can drastically help the key stakeholders in allocation of these Rural Kiosks at right places so as to maximize their utility.
Ključne besede: BAT algorithm, location allocation, rural kiosks, fuzzy C-means, e-governance, tele-centers, common service centers
Objavljeno v RUNG: 01.04.2021; Ogledov: 1918; Prenosov: 0
Gradivo ima več datotek! Več...

Opis: Common Service Centers (CSCs), which are also known as Tele-centers and Rural Kiosks, are important infrastructural options for any country aiming to provide E-Governance services in rural regions. Their main objective is to provide adequate information and services to a country’s rural areas, thereby increasing government-citizen connectivity. Within developing nations, such as India, many CSC allocations are being planned. This study proposes a solution for allocating a CSC for villages in a country according to their E-Governance plan. The Fuzzy C-Means (FCM) algorithm was used for clustering the village dataset and finding a cluster center for CSC allocation, and the Particle Swarm Optimization (PSO) algorithm was used for further optimizing the results obtained from the FCM algorithm based on population. In the context of other studies addressing similar issues, this study highlights the practical implementation of location modeling and analysis. An extensive analysis of the results obtained using a village dataset from India including four prominent states shows that the proposed solution reduces the average traveling costs of villagers by an average of 33 % compared with those of allocating these CSCs randomly in a sorted order and by an average of 11 % relative to centroid allocation using the FCM-based approach only. As compared to traditional approaches like P-Center and P-Median, the proposed scheme is better by 31 % and 14 %, respectively. Therefore, the proposed algorithm yields better results than classical FCM and other types of computing techniques, such as random search & linear programming. This scheme could be useful for government departments managing the allocation of CSCs in various regions. This work should also be useful for researchers optimizing the location allocation schemes used for various applications worldwide.
Ključne besede: common service centers, tele-centers, e-governance, location allocation, fuzzy C-means clustering, particle swarm optimization
Objavljeno v RUNG: 17.02.2021; Ogledov: 2378; Prenosov: 0
Gradivo ima več datotek! Več...