Results 11 to 20 of about 1,485,911 (189)

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, Jerson Ken Villamin, Genaro Cuaresma   +2 more
doaj   +1 more source

Effective Approaches to Solve P-Center Problem via Set Covering and SAT

IEEE Access, 2020
The classic p -center problem consists of choosing a set of p vertices in an undirected graph as facilities in order to minimize the maximum distance between each client vertex and its closest facility.
Xiaolu Liu, Yuan Fang, Jiaming Chen, Zhouxing Su, Chumin Li, Zhipeng Lu   +5 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, Broderick Crawford, Ricardo Soto, Eric Monfroy, José García, Enrique Cortes   +5 more
doaj   +1 more source

Optimizing the Spatial Location of Street Lights in Belle Isle, Michigan

ISPRS International Journal of Geo-Information, 2022
Improved street lighting can provide better use of public space and helps to promote safety while driving or walking. In terms of balancing benefits and impacts, on the basis of cost saving, this research adopts two prominent mathematical models, the ...
Yanqing Xu, Yue Zhang, Cong Fu, Xiyue Deng, Yihe Yang   +4 more
doaj   +1 more source

Approximation Algorithms for Union and Intersection Covering Problems [PDF]

, 2011
In a classical covering problem, we are given a set of requests that we need to satisfy (fully or partially), by buying a subset of items at minimum cost. For example, in the k-MST problem we want to find the cheapest tree spanning at least k nodes of an
Cygan, Marek, Grandoni, Fabrizio, Leonardi, Stefano, Mucha, Marcin, Pilipczuk, Marcin, Sankowski, Piotr   +5 more
core   +5 more sources

Chemical reaction optimization for the set covering problem [PDF]

, 2014
The set covering problem (SCP) is one of the representative combinatorial optimization problems, having many practical applications. This paper investigates the development of an algorithm to solve SCP by employing chemical reaction optimization (CRO), a
Lam, AYS, Li, VOK, Yu, JJQ
core   +1 more source

Set covering problem with conflict constraints [PDF]

Computers & Operations Research, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saffari, Saeed, Fathi, Yahya
openaire   +2 more sources

Application of genetic algorithm for the set-covering problem solution

Advanced Engineering Research, 2016
The weighed and unweighted minimal set-cover problem, its applicability for the solution of the major optimization practical tasks, such as arrangement of service points, assignment of crews in transport, as well as the integrated-circuit and conveyer ...
Igor S. Konovalov, Vladimir A. Fatkhi, Valery G. Kobak   +2 more
doaj   +1 more source

On Asymmetric Coverings and Covering Numbers [PDF]

, 2002
An asymmetric covering D(n,R) is a collection of special subsets S of an n-set such that every subset T of the n-set is contained in at least one special S with |S| - |T|
Applegate, David, Rains, E. M., Sloane, N. J. A.   +2 more
core   +5 more sources

Initialization and Local Search Methods Applied to the Set Covering Problem: A Systematic Mapping

Revista Facultad de Ingeniería, 2023
The set covering problem (SCP) is a classical combinatorial  optimization problem part of Karp's 21 NP-complete problems. Many real-world applications can be modeled as set covering problems (SCPs), such as locating emergency services, military planning,
Nelson-Enrique Quemá-Taimbud, Martha-Eliana Mendoza-Becerra, Oscar-Fernando Bedoya-Leyva   +2 more
doaj   +1 more source