Results 21 to 30 of about 1,486,783 (327)
Utilizing Heuristics and Metaheuristics for Solving the Set Covering Problem
A basic combinatorial optimization problem, the Set Covering Problem (SCP) finds extensive use in computer science, operations research, and logistics, among other domains.
Lourenço Pinho
openalex +4 more sources
This paper presents an extension of the covering location problem as a hybrid covering model that utilizes the set covering and maximal covering location problems. The developed model is a multi-period model that considers strategic and tactical planning
Roghayyeh Alizadeh, Tatsushi Nishi
doaj +1 more source
The analysis of algorithm for transmitters locating problem
The analysis of ACO algorithm for transmitters locating problem is presented in this paper.
Saulius Lazaravičius +1 more
doaj +3 more sources
Application of ant colony optimization metaheuristic on set covering problems
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
A Meta-Optimization Approach to Solve the Set Covering Problem
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
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 MODEL FOR DETERMINING LOCATION OF NAVAL BASE USING AHP METHOD AND SET COVERING PROBLEM [PDF]
Indonesia is a nation that has a lot of island with most of its territory (2/3) is the sea and the rest of it (1/3) island that consist of many islands, this kind of geographical condition insist Indonesian Government control and guaranty its sea ...
Purnomo J. +3 more
doaj +1 more source
This research aims to explain the intrinsic difficulty of Karp’s list of twenty-one problems through the use of empirical complexity measures based on the ellipsoidal width of the polyhedron generated by the constraints of the relaxed linear programming ...
Ivan Derpich, Juan Valencia, Mario Lopez
doaj +1 more source
An Ant Colony based Hyper-Heuristic Approach for the Set Covering Problem
The Set Covering Problem (SCP) is a NP-hard combinatorial optimization problem that is challenging for meta-heuristic algorithms. In the optimization literature, several approaches using meta-heuristics have been developed to tackle the SCP and the ...
Alexandre Silvestre FERREIRA +2 more
doaj +1 more source
A column generation approach to the airline crew pairing problem to minimize the total person-days
In this paper, we consider the crew pairing problem in airline scheduling that calls for assigning crew members in order to cover all flights with the minimum total person-days under the constraints that the schedule of each crew member does not violate ...
Wei WU +5 more
doaj +1 more source

