Results 21 to 30 of about 504,784 (313)
Application of ant colony optimization metaheuristic on set covering problems
Mathematics in Applied Sciences and Engineering, 2022 Ant Colony Optimization (ACO) metaheuristic is a multi-agent system in which the behaviour of each ant is inspired by the foraging behaviour of real ants to solve optimization problem.
Christian Alvin Buhat +2 more
doaj +1 more source
An Indirect Genetic Algorithm for Set Covering Problems [PDF]
, 2002 This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. the actual solutions are found by an external decoder function. The genetic
Aickelin, Uwe, Aickelin, U, Uwe Aickelin
core +1 more source
Optimization Strategy of Information Interaction Maximum Flow Transmission in Vehicle Ad Hoc Network [PDF]
Jisuanji gongcheng, 2017 Aiming at the transmission instability problem when multiple users request a large number of data resources in intelligent vehicle network,this paper proposes a Set Covering Maximum Flow(SCMF) algorithm in mobile vehicle node environment.It uses set ...
TAN Dayu,LI Jingzhao,YANG Dayu,LI Zihao,YANG Gaoming
doaj +1 more source
Matrix Approaches for Covering-Based Multigranulation Fuzzy Rough Set Models
Journal of Mathematics, 2023 Multigranulation rough set theory is one of the most effective tools for data analysis and mining in multicriteria information systems. Six types of covering-based multigranulation fuzzy rough set (CMFRS) models have been constructed through fuzzy β ...
Zaibin Chang, Junchao Wei
doaj +1 more source
Covering Arrays via Set Covers
Electronic Notes in Discrete Mathematics, 2018 Abstract In this paper, we provide yet another construction on how to map problems pertaining covering arrays to specialized set cover problems. With this mapping it is possible to compute optimal covering arrays via minimal solutions of the generated set cover problem.
Ludwig Kampel +2 more
openaire +1 more source
Dynamic Floating Stations Model for Emergency Medical Services with a Consideration of Traffic Data
ISPRS International Journal of Geo-Information, 2020 To equally distribute the workload and minimize the travel distance for fire departments, we developed a new dynamic floating stations model (DFSM) to target traffic-related emergency medical services (EMS) during peak hours.
Chih-Hong Sun +3 more
doaj +1 more source
A Meta-Optimization Approach to Solve the Set Covering Problem
Ingeniería, 2018 Context: In the industry the resources are increasingly scarce. For this reason, we must make a good use of it. Being the optimization tools, a good alternative that it is necessary to bear in mind.
Gino Astorga +5 more
doaj +1 more source
Set Covering with Our Eyes Closed [PDF]
SIAM Journal on Computing, 2008 Given a universe U of n elements and a weighted collection l of m subsets of U, the universal set cover problem is to a-priori map each element u epsi U to a set S(u) epsi l containing u, so that X sube U is covered by S(X)=UuepsiXS(u). The aim is finding a mapping such that the cost of S(X) is as close as possible to the optimal set-cover cost for X. (
Fabrizio Grandoni 0001 +5 more
openaire +5 more sources
Knapsack with Vertex Cover, Set Cover, and Hitting Set
CoRRGiven an undirected graph $\mathcal{G}=(\mathcal{V},\mathcal{E})$, with vertex weights $(w(u))_{u\in\mathcal{V}}$, vertex values $(α(u))_{u\in\mathcal{V}}$, a knapsack size $s$, and a target value $d$, the \vcknapsack problem is to determine if there exists a subset $\mathcal{U}\subseteq\mathcal{V}$ of vertices such that $\mathcal{U}$ forms a vertex ...
Dey, Palash +3 more
openaire +4 more sources
IEEE Access, 2017 To overcome the constraint of spectrum heterogeneity, i.e., different spatial locations may have different available spectrum resources, nodes in a multi-channel ad hoc network (MCAHN) should exchange necessary control information.
Xuesong Jonathan Tan, Wen Zhans
doaj +1 more source