[PDF] Top 20 A CLONALG-based Approach for the Set Covering Problem
Has 10000 "A CLONALG-based Approach for the Set Covering Problem" found on our website. Below are the top 20 most common "A CLONALG-based Approach for the Set Covering Problem".
A CLONALG-based Approach for the Set Covering Problem
... to CLONALG in [19]. CLONALG, inspired by the clonal selection theory of acquired immunity, has shown success on broad range of engineering problem ...non-unicost set covering ... See full document
9
Extensions to emergency vehicle location models
... Expected Covering Location Problem (MEXCLP) developed by Daskin (1983), seeks to maximise the expected value of coverage within a time standard, using a heuristic ...location set covering ... See full document
18
Retrieving the Missing Information from Information Systems Using Rough Set, Covering Based Rough Set and Soft Set
... Soft set theory has potential applications in many different fields which include the smoothness of functions, game theory, operations research, Riemann integration, Peron integration, probability theory, and ... See full document
5
A set covering model for a bidirectional multi shift full truckload vehicle routing problem
... bi-objective approach (minimising the number of vehicles and minimising total distance travelled) is considered and it is shown that this method obtained considerably better results than those reported in ... See full document
31
Covering-Based Grade Rough Fuzzy Set Models
... After more than 30 years of research and development and according to the different between the neighbourhood of the object x and the background of the problem. In general, the covering rough fuzzy ... See full document
9
Allocating costs in set covering problems
... on set covering situations where a reasonable cover is given in ...This approach is meaningful in several ...related set covering problem has been solved either by means of an ... See full document
26
Comparing Set-Covering Strategies for Optimal Corpus Design
... the problem of the linguistic content of a speech ...a set of sentences which covers a preset description of phonological attributes under the constraint of an overall duration as small as ... See full document
6
The multimode covering location problem
... the problem instance, and to explore it more efficiently than with exhaustive ...The approach herein developed to solve the MM- CLP problem is a customized version of the cyclic exchanges first ... See full document
24
First Results on the Evolutionary Solution for the Strategy- based Refactoring Set Selection Problem
... our approach is provided in Section V. The proposed approach and several details related to the genetic operators of the genetic algorithm are described in Section ... See full document
9
Solving a large real world bus driver scheduling problem with a multi assignment based heuristic algorithm
... scheduling problem (BDSP) under study consists in find- ing a set of duties that covers the bus schedule from a Brazilian public transportation bus company with the objective of minimizing the total ...model ... See full document
26
Single Assignment Capacitated Hierarchical Hub Set Covering Problem for Service Delivery Systems Over Multilevel Networks
... and set covering problem at the same ...the problem formulation. This formulation provides a logi- cal approach that gives priority to costs and will prevent indiscriminate increases in ... See full document
17
Comparison of GA Based Heuristic and GRASP Based Heuristic for Total Covering Problem
... traditional set-covering ...binatorial approach is reasonably ...new approach in computational populations genetics as it does not require any a priori knowledge about allele fre- quency, ... See full document
12
Developing Problem-Solving Skills With Case Study In A Conceptual Management Course
... To problem-solving approach above is applied to the author’s Organizational Behavior class with a set of carefully-picked cases published in HBR over the past two ...the problem-solving case ... See full document
14
On the Equivalence between the Set Covering Problem and the Problem of Finding Optimal Cumulative Assignment Schemes
... the problem of finding optimal CAS’s for incomplete ...are based on the connected-super-forbidden-family (lower-forbidden-family, ...the problem of finding optimal CAS’s and the set ... See full document
12
Variation In Greedy Approach To Set Covering Problem
... The major idea in the two weighted greedy algorithms is that the rows should never be evaluated the same. There must be uniqueness in covering the different rows. If all rows are getting covered by the matching ... See full document
70
Constructing constrained version of magic squares using selection hyper heuristics
... squares problem was the subject of a recent competition with the goal of finding the quickest ...winner approach emerged among hundreds of competing algorithms as a hill climbing algorithm [12] which handles ... See full document
11
Set Covering Problem with Conflict Constraints.
... two-phase-CCVI approach where we turn off all pre-processing, heuristics and cut generation options of ...data set B as described in previous subsection as well as a selected group of instances from ... See full document
139
Approach to Solving K-Sat Problem Based on Reduction Thereof to the Covering Problem
... the problem A is converted to the problem B during the polynomial time, and if B is converted to C during the polynomial time, then A will be converted to C during the polynomial ...“satisfiability” ... See full document
15
Crawling Deep Web using a GA-based set covering algorithm
... problem as a set covering problem, they used greedy method [7] [9] to select a proper.. set of queries based on a sample database.[r] ... See full document
70
A Probabilistic Algorithm for the Solution of Homogeneous Linear Inequalities
... algorithm based on probabilistic methods such as HR ...infeasible set (IIS) in the case of infeasibility. This method is based on HR methods and on the set covering ...we set c = ... See full document
58
Related subjects