[PDF] Top 20 A genetic algorithm approach for set covering problems
Has 10000 "A genetic algorithm approach for set covering problems" found on our website. Below are the top 20 most common "A genetic algorithm approach for set covering problems".
A genetic algorithm approach for set covering problems
... We ex- periment with our genetic algorithm t o solve several instances of computationally difficult set covering problems that arise from computing the l-width of the incid[r] ... See full document
6
A hierarchical gene-set genetic algorithm
... proposed genetic algorithm can search more flexibly in a solution ...Three problems have been used for experiments, respectively with one-peak, two-peak, and multi-peak solution ... See full document
34
Micro-genetic approach for surface meshing on a set of unorganized points
... micro genetic algorithm and a C 1 sur- face function interpolation method, applied to surface meshing on a set of unorganized ...operators. A C 1 interpolation function is ... See full document
12
Attribute Selection for the Scheduling of Flexible Manufacturing Systems based on Fuzzy Set-theoretic Approach and Genetic Algorithm
... mining algorithm, SAMA)來處理上述的問題。此演算法可以依照各屬性彼此之 間關聯程度的重要性來給予排序。本文實驗利用模擬軟體建立了一個彈性製造系統來 驗證此演算法的有效性。實驗結果指出 SAMA 可以達到屬性評估跟最佳化的屬性子集 合選取等目的。更進一步，利用所得出的最佳化屬性子集合與未經過 SAMA 處理的系 統全部屬性來做比較。最後，結果顯示經由 SAMA 選擇的屬性當成排程器的輸入可以 ... See full document
10
A family competition genetic algorithm for the pickup and delivery problems with time window
... presents a new approach based on genetic algorithms to solving the single-vehicle pickup and delivery problem with time window constraints ...Competition Genetic Algorithm (FCGA) is ... See full document
10
A perfect match condition for point-set matching problems using the optimal mass transport approach
... found, for instance, in [29] and ...establish a consistent point-to-point correspondence between two ...well-known approach is the iterative closest point (ICP) algo- rithm ...required for ... See full document
33
A guided-based genetic algorithm for solving assembly planning problems 張銀和、曾懷恩
... arrange a specific assembly sequence according to the product design description as well as to their particular heuristics in putting together all the components of a ...with a genetic ... See full document
2
Comparison between genetic algorithm and linear programming approach for real time operation
... From the analysis, the following conclusions can be drawn: The developed models can be successfully applied to irri- gation supporting reservoir systems. Furthermore, the models ensure an optimum reservoir release over ... See full document
10
Optimization of short-haul airline crew pairing problems using a multiobjective genetic algorithm
... pairing problems involve optimizing an overall evaluation func- tion containing various conflicting objectives and constraints originating from cost and safety ...on set partitioning or set ... See full document
1
Intelligent scheduling controller for shop floor control systems: a hybrid genetic algorithm/decision tree learning approach
... is a greedy algorithm that grows the tree from the top-down, selecting at each node the attribute that best classifies the local training ...and a bias in favour of features with more values. C4.5 ... See full document
24
A hybrid genetic algorithm approach on multi-objective of assembly planning problem
... assigning a set of operations to a set of ...usually a tedious design procedure so a significant amount of manpower is required to obtain a good work ...optimization ... See full document
11
A simulated annealing algorithm for manufacturing cell formation problems
... of a production system in which machines are assigned to these cells to process one or more part families so that each cell is operated independently and the intercellular movements are minimized or the number of ... See full document
9
k-neighborhood-covering and -independence problems for chordal graphs
... -INDEPENDENCE PROBLEMS FOR CHORDAL GRAPHS ∗ SHIOW-FEN HWANG † AND GERARD ...is a simple graph and k is a fixed positive integer. A ver- tex z k-neighborhood-covers an edge (x, y) if ... See full document
11
Decision support for irrigation project planning using a genetic algorithm
... results for the applied ...optimum set has a higher average and a lower standard deviation of the project's bene®t from a series of ...simple genetic algorithm (SGA) ... See full document
24
A Genetic Algorithm for Multiple Multicast on WDM Ring Network
... application problems on a WDM network, mechanisms must be developed to handle not only point-to-point communication but also group communication involving transporting information in the ...network. ... See full document
19
A water flow-like algorithm for manufacturing cell formation problems
... r a c t Available research on the manufacturing cell formation problem shows that most solution approaches are either single- or multiple-solution-agent-based, with a fixed size of solution ...flow-like ... See full document
15
Energy-Aware Set-Covering Approaches for Approximate Data Collection in Wireless Sensor Networks
... networks for R-node selections. This approach is called DomSet ...builds a linear regression prediction model to estimate the read- ings of a sensor node’s one-hop neighbors and to select R- ... See full document
15
An alternative formulation for certain fuzzy set-covering problems
... The above formulation is mathematically elegant, however, solutions are difficulty to find due to the fact t h a t the number of decision variables is proportion [r] ... See full document
3
The lightweight genetic search algorithm: an efficient genetic algorithm for small search range problems
... Unless an elitist selection is applied in the reproduction stage t o maintain the evolution infor- mation, the genetic search will degrade to the random search if the m[r] ... See full document
6
A genetic algorithm approach for the object-sorting task problem
... Most multi-agent tasks have high complexity. Optimal solu- tions of them are nearly intractable because of the large com- plexity. One approach is to use stochastic search techniqu[r] ... See full document
6
相關主題