• Steel and Composite Structures
• /
• v.7 no.3
• /
• pp.253-262
• /
• 2007

A methodology to design symmetrically laminated fibre-reinforced structures under transverse loads for minimum weight, with manufacturing uncertainty in the ply angle, is described. The ply angle and the ply thickness are the design variables, and the Tsai-Wu failure criteria is the design constraint implemented. It is assumed that the probability of any tolerance value occurring within the tolerance band, compared with any other, is equal, and thus the approach is a worst-case scenario approach. The finite element method, based on Mindlin plate and shell theory, is implemented, and thus effects like bending-twisting coupling are accounted for. The Golden Section method is used as the search algorithm, but the methodology is flexible enough to allow any appropriate finite element formulation, search algorithm and failure criterion to be substituted. In order to demonstrate the procedure, laminated plates with varying aspect ratios and boundary conditions are optimally designed and compared.

• Steel and Composite Structures
• /
• v.7 no.3
• /
• pp.201-217
• /
• 2007

Two combinatorial optimization algorithms, tabu search and simulated annealing, are presented for the minimum-weight design of geometrically non-linear steel plane frames. The design algorithms obtain minimum weight frames by selecting suitable sections from a standard set of steel sections such as American Institute of Steel Construction (AISC) wide-flange (W) shapes. Stress constraints of AISC Load and Resistance Factor Design (LRFD) specification, maximum and interstorey drift constraints and size constraints for columns were imposed on frames. The stress constraints of AISC Allowable Stress Design (ASD) were also mounted in the two algorithms. The comparisons between AISC-LRFD and AISC-ASD specifications were also made while tabu search and simulated annealing were used separately. The algorithms were applied to the optimum design of three frame structures. The designs obtained using tabu search were compared to those where simulated annealing was considered. The comparisons showed that the tabu search algorithm yielded better designs with AISC-LRFD code specification.

• Proceedings of the KAIS Fall Conference
• /
• 2001.05a
• /
• pp.103-107
• /
• 2001

This study is simulation about buckling behavior under axial compression which is cylindrical panel laminated USN125 and USN150 made by various winding angle. And also this study compare with linear and nonlinear FDEM theory, and FEM theory. To solve the objective function and the design variables, this study use the linear and nonlinear buckling theories or FDEM and nonlinear search optimum design method of ADS for minimum weight design on which stiffened laminated composite cylindrical panel with stiffener that R-type section.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.159-171
• /
• 2011

This paper suggests an algorithm that obtains the Minimum Spanning Tree for directed graph (DMST). The existing Chu-Liu/Edmonds DMST algorithm has chances of the algorithm not being able to find DMST or of the sum of ST not being the least. The suggested algorithm is made in such a way that it always finds DMST, rectifying the disadvantage of Chu-Liu/Edmonds DMST algorithm. Firstly, it chooses the Minimum-Weight Arc (MWA) from all the nodes including a root node, and gets rid of the nodes in which cycle occurs after sorting them in an ascending order. In this process, Minimum Spanning Forest (MST) is obtained. If there is only one MSF, DMST is obtained. And if there are more than 2 MSFs, to determine MWA among all MST nodes, it chooses a method of directly calculating the sum of all the weights, and hence simplifies the emendation process for solving a cycle problem of Chu-Liu/Edmonds DMST algorithm. The suggested Sulee DMST algorithm can always obtain DMST that minimizes the weight of the arcs no matter if the root node is set or not, and it is also capable to find the root node of a graph with minimized weight.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.7
• /
• pp.47-52
• /
• 2016

This paper introduces an algorithm to construct an Eulerian cycle for Chinese postman problem. The Eulerian cycle is formed only when all vertices in the graph have an even degree. Among available algorithms to the Eulerian cycle problem, Edmonds-Johnson's stands out as the most efficient of its kind. This algorithm constructs a complete graph composed of shortest path between odd-degree vertices and derives the Eulerian cycle through minimum-weight complete matching method, thus running in $O({\mid}V{\mid}^3)$. On the contrary, the algorithm proposed in this paper selects minimum weight edge from edges incidental to each vertex and derives the minimum spanning tree (MST) so as to finally obtain the shortest-path edge of odd-degree vertices. The algorithm not only runs in simple linear time complexity $O({\mid}V{\mid}log{\mid}V{\mid})$ but also obtains the optimal Eulerian cycle, as the implementation results on 4 different graphs concur.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.2 no.4
• /
• pp.217-222
• /
• 2010

Since 1980's, optimum design techniques for ship structural design have been developed to the preliminary design which aims at minimum weight or minimum cost design of mid-ship section based on analytic structural analysis. But the optimum structural design researches about the application for the detail design of local structure based on FEA have been still insufficient. This paper presents optimization technique for the detail design of a racing motor boat. To improve the performance and reduce the damage of a real existing racing boat, direct structural analyses; static and non-linear transient dynamic analyses, were carried out to check the constraints of minimum weight design. As a result, it is shown that the optimum structural design of a racing boat has to be focused on reducing impulse response from pitching motion than static response because the dynamic effect is more dominant. Optimum design algorithm based on nonlinear finite element analysis for a racing motor boat was developed and coded to ANSYS, and its applicability for actual structural design was verifed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1363-1369
• /
• 2004

LDPC(Low Density Parity Check) codes are described by bipartite graphs with bit nodes and parity-check nodes. Tanner derived minimum distance bounds of the regular LDPC code in terms of the eigenvalues of the associated adjacency matrix. In this paper we generalize the Tanner's results. We derive minimum distance bounds applicable to both regular and blockwise-irregular LDPC codes. The first bound considers the relation between bit nodes in a minimum-weight codeword, and the second one considers the connectivity between parity nodes adjacent to a minimum-weight codeword. The derived bounds make it possible to describe the distance property of the code in terms of the eigenvalues of the associated matrix.

• Bulletin of the Society of Naval Architects of Korea
• /
• v.21 no.4
• /
• pp.29-39
• /
• 1984

In this paper, the membrane and buckling analysis of beams with various shaped brackets is performed by using the finite element method. From the viewpoint of minimum structural weight, a optimum design method to determine the optimal shapes and scantling of brackets under design load is proposed by investigating the effects of beam depth, bracket length and aspect ratio on the structural weight. Also optimal design data and charts for the brackets to support transverse girders or web frames of actual ships are provided. By the present design method, it is possible to perform optimum design of brackets used in actual ships, which could result in considerable reduction of structural weight or cost, increase of dead weight and service speed of ships.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.6
• /
• pp.612-627
• /
• 2009

The high-level contribution of this paper is to illustrate the effectiveness of using graph theory tree traversal algorithms (pre-order, in-order and post-order traversals) to generate the chain of sensor nodes in the classical Power Efficient-Gathering in Sensor Information Systems (PEGASIS) data aggregation protocol for wireless sensor networks. We first construct an undirected minimum-weight spanning tree (ud-MST) on a complete sensor network graph, wherein the weight of each edge is the Euclidean distance between the constituent nodes of the edge. A Breadth-First-Search of the ud-MST, starting with the node located closest to the center of the network, is now conducted to iteratively construct a rooted directed minimum-weight spanning tree (rd-MST). The three tree traversal algorithms are then executed on the rd-MST and the node sequence resulting from each of the traversals is used as the chain of nodes for the PEGASIS protocol. Simulation studies on PEGASIS conducted for both TDMA and CDMA systems illustrate that using the chain of nodes generated from the tree traversal algorithms, the node lifetime can improve as large as by 19%-30% and at the same time, the energy loss per node can be 19%-35% lower than that obtained with the currently used distance-based greedy heuristic.

• Structural Engineering and Mechanics
• /
• v.52 no.4
• /
• pp.723-738
• /
• 2014

Prestressing is the most commonly employed technique in bridges and long span beams in commercial buildings as prestressing results in slender section with higher load carrying capacities. This work is an attempt to study the performance of a minimum weight prestressed concrete beam adopting a non-prismatic section so that there will be a reduction in the volume of concrete which in turn reduces the self-weight of the structure. The effect of adopting a non-prismatic section on parameters like prestressing force, area of prestressing steel, bending stresses, shear stresses and percentage loss of prestress are established theoretically. The analysis of non-prismatic prestressed beams is based on the assumption of pure bending theory. Equations are derived for dead load bending moment, eccentricity, and depth at any required section. Based on these equations an algorithm is developed which does the stress checks for the given section for every 500 mm interval of the span. Limit state method is used for the design of beam and finite difference method is used for finding out the deflection of a non-prismatic beam. All the parameters of nonprismatic prestressed concrete beams are compared with that of the rectangular prestressed concrete members and observed that minimum weight design and economical design are not same. Minimum weight design results in the increase in required area of prestressing steel.