We study the multifragmentation phenomenon in heavy-ion collisions by varying the spatial constraint criterion in minimumspanningtree (MST) clusterisation procedure. Within the framework of isospin-dependent quantum...
详细信息
We study the multifragmentation phenomenon in heavy-ion collisions by varying the spatial constraint criterion in minimumspanningtree (MST) clusterisation procedure. Within the framework of isospin-dependent quantum molecular dynamics (IQMD) model, the role of isospin-dependent spatial constraint, i.e. iso-MST version, is investigated on different fragment observables in various isobaric pair of reaction systems varying in the entrance channel isospin (N/Z) content. The fragment observables such as persistence, gain, average yield of free nucleons, light and intermediate mass fragments are slightly sensitive to the isospin-dependent spatial constraint criterion particularly in heavier reaction systems. For a given isobaric pair of reaction systems, the fragment production, however, remains indifferent to isospin content of the colliding nuclei.
This paper introduces an efficient methodology to design optimally cable layout of inner grid as well as location of offshore substation. The methodology is composed of two optimizers: one is inner grid layout optimiz...
详细信息
This paper introduces an efficient methodology to design optimally cable layout of inner grid as well as location of offshore substation. The methodology is composed of two optimizers: one is inner grid layout optimizer, which consists of several algorithms such as the k-clustering-based genetic algorithm, the minimumspanningtree, and the cable selection;the other one is offshore substation location optimizer based on the pattern search method. While performing iteratively two optimizers, alternatives for cable layout and candidates for location of offshore substation are generated and evaluated in the economic and reliability aspects, respectively. Optimal layout of offshore wind farm is determined so as to minimize the total cost which is a sum of construction, power loss, maintenance, and reliability costs.
Ant Colony Optimization solves the distribution network reconfiguration problem with imitating the posses of real ants looking for food. Its main features include positive feedback, distributed computing, easy to be c...
详细信息
Ant Colony Optimization solves the distribution network reconfiguration problem with imitating the posses of real ants looking for food. Its main features include positive feedback, distributed computing, easy to be combined with other algorithms and application of constructive greedy heuristic. This paper adopts minimum spanning tree algorithm in graph theory to ensure the radiating structure of the reconstructed distribution network. Then this paper improves the searching mode and information elements renewal link of ant colony algorithm to get faster and more superior network. Finally, the IEEE 33 nodes distribution network is used as an example to testify the effectiveness of improved ant colony algorithm.
An improved genetic algorithm(GA) named MST-GA is proposed to minimize amount of PMUs for fully observing huge scale power grid. It adopts minimum spanning tree algorithm to repair unfeasible solutions, and makes use ...
详细信息
ISBN:
(纸本)9780769549231;9781467348935
An improved genetic algorithm(GA) named MST-GA is proposed to minimize amount of PMUs for fully observing huge scale power grid. It adopts minimum spanning tree algorithm to repair unfeasible solutions, and makes use of the topology of power grid in the process of mutation. The simulation results of IEEE30 and IEEE39-bus system show that the algorithm can balance the quality and diversity of solutions better than others.
An approach for reducing the complexity of the multiplier block for fixed coefficient FIR filters using the transpose structure is presented. Through the use of modular arithmetic with moduli of the type 2(n) +/- 1 an...
详细信息
An approach for reducing the complexity of the multiplier block for fixed coefficient FIR filters using the transpose structure is presented. Through the use of modular arithmetic with moduli of the type 2(n) +/- 1 and 2(n), modulo multiplier blocks with a small full adder count are obtained using a minimum spanning tree algorithm. The results obtained show a very significant reduction in the filter complexity relative to existing techniques. A unique feature of the results is that the complexity is independent of filter length, but a function of the filter's dynamic range.
Group technology plays an important role in the design of an automated manufacturing system. The ideal situation is to partition the machines into machine cells and the parts into part families so that each machine ce...
详细信息
Group technology plays an important role in the design of an automated manufacturing system. The ideal situation is to partition the machines into machine cells and the parts into part families so that each machine cell together with the part family for the cell is independent of the rest of the system. We will give a characterization of the independent cells for an arbitrary manufacturing system. An efficient algorithm to identify these independent cells will also be discussed. An effective policy for subcell formation (not necessarily independent) from larger cells will also be discussed. Computational results show that our algorithms always obtain solutions with higher grouping efficiency compared with some of the existing algorithms. We also discuss the effectiveness of grouping efficiency as a measure for group technology.
The paper refutes the assertion of Shaffer et al. (1) that, in general, the minimum spanning tree algorithm and the mode-seeking clustering algorithm (2) yield identical results. An example is given to exhibit the dif...
详细信息
The paper refutes the assertion of Shaffer et al. (1) that, in general, the minimum spanning tree algorithm and the mode-seeking clustering algorithm (2) yield identical results. An example is given to exhibit the differences of these two algorithms.
暂无评论