Results 11 to 20 of about 149,933 (163)
The analysis of algorithm for transmitters locating problem
Lietuvos Matematikos Rinkinys, 2023 The analysis of ACO algorithm for transmitters locating problem is presented in this paper.
Saulius Lazaravičius +1 more
doaj +3 more sources
Two Neighbourhood-based Approaches for the Set Covering Problem
U.Porto Journal of Engineering, 2019 The Set Covering Problem is a well-known NP-complete problem which we address in this work. Due to its combinatorial nature heuristic methods, namely neighbourhood-based meta-heuristics, were used.
Eduardo Meca Castro
doaj +1 more source
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
Effective Approaches to Solve
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 +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 +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 +4 more
doaj +1 more source
The Pipelined Set Cover Problem [PDF]
, 2004 A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an abstraction of this problem as a generalization of set cover called pipelined set cover, where the sets are applied sequentially to the elements to be covered and the elements covered at each stage are discarded.
Kamesh Munagala +3 more
openaire +1 more source
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 +2 more
doaj +1 more source
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 +2 more
doaj +1 more source