• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2002.05a
• /
• pp.1061-1066
• /
• 2002

This study proposes an analytic method that determines an optimal arrangement of absorptive materials on an enclosure surface. Under the optimal arrangement, a quiet zone in the enclosure has the minimum $\varepsilon$$\sub$p/ (acoustic potential energy density). The proposed method has been implemented by using a BEM simulation and a genetic algorithm. The BEM simulation evaluates the $\varepsilon$$\sub$p/ under the prescribed arrangement of the absorptive materials. The genetic algorithm searches the optimal arrangement by referring the ep evaluated from the BEM simulation. In the BEM simulation, the absorptive material arrangement is expressed as a vector, which is denoted as in absorptive material arrangement (AMA) vector. Besides, an admittance vector of which elements are admittances of available absorptive materials and an AMA matrix that transforms the admittance vector into the AMA vector are defined. The AMA matrix is also used as a chromosome in the genetic algorithm so that it functions to relate the BEM simulation to the genetic algorithm. As a verification example, the proposed method is applied to make the quiet zone in a parallelepiped enclosure.

• Proceedings of the KIEE Conference
• /
• 1998.07g
• /
• pp.2186-2188
• /
• 1998

In this paper, Fundamental rules governing group intelligence "arrangement" behavior of multiple number of autonomous mobile robots are represented by a small number of fuzzy rules. Complex lifelike behavior is considered as local interactions between simple individuals under small number of fundamental rules. The fuzzy rules for arrangement are generated from clustering the input-output data obtained from the arrangement algorithm. Simulation shows the fuzzy rules successfully realizes fundamental rules of the flocking group behavior.

• Journal of the Society of Naval Architects of Korea
• /
• v.50 no.1
• /
• pp.59-68
• /
• 2013

Nowadays, optimum structural design techniques based on CSR have been developed and applied to the preliminary design stage focused on minimum weight and minimum construction cost of ship structure. Optimum structural design algorithm developed before could minimize weight and cost on fixed compartment arrangement. However, to develop more efficient design technique, a designer needs to combine optimized compartment arrangement with optimized ship structural design because compartment arrangement has a large effect on structural design according to the change of still water bending moment as a consequence of compartment arrangement change. In this study, automated algorithm for compartment arrangement of an oil tanker is developed to apply preliminary structural design. The usefulness of developed algorithm is verified with Aframax oil tanker constructed by STX shipbuilding Co.Ltd..

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2015.11a
• /
• pp.64-65
• /
• 2015

As construction projects have increased in size and height recently, lifting accounts for increasingly greater portion and tower cranes are used more frequently. At present, the selection and arrangement of tower crane are depend on the experience of experts. However, since the number of experts is fairly limited and a database for tower cranes regarding lifting capacity, operation properties, rent, etc has not been widely employed, tower cranes are often not effectively selected and arranged which can cause cost overruns and delays in the lifting work. To address such issues, this study attempts to perform a basic study for development of automatic arrangement algorithm of tower crane using drawing recognition. If relevant database is established and the algorithm suggested in this study is refined more systematically, even beginning level engineers will be able to plan tower crane arrangement in a way comparable to experienced experts.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.10a
• /
• pp.79-82
• /
• 1997

In this paper, group intelligence "arrangement" bahavior of autonomous mobile robots(AMRs) is realized by the fuzzy rules. The fuzzy rules for the arrangement are generated from clustering the input-output data. Simulation shows that a small-number of fuzzy rules successfully realizes the arrangement behavior of AMRs.

• Journal of the Korea Institute of Building Construction
• /
• v.12 no.3
• /
• pp.358-368
• /
• 2012

On most construction sites, the arrangement of tower cranes is decided by site engineers based on their own experience, which can cause cost overruns and delays in the lifting work. Although many researchers have conducted studies on tower crane arrangement using computer modeling and knowledge-based expert systems as well as mathematical models, no research has aimed to develop an algorithm to identify an optimum solution among several alternatives for installation areas of tower cranes satisfying the conditions of lifting work. The objective of this study is to develop an automatic arrangement algorithm for tower cranes used in high-rise apartment construction. First, as a new concept, a possible installation area of tower cranes was suggested. Second, after proposing several alternatives based on the installation points suggested in this study, an algorithm analyzing the economic feasibility of tower cranes was developed considering the rental, installation and removal costs. Third, a case study was conducted to prove the validity of the developed algorithm for selecting and installing an effective set of tower cranes at minimum cost.

• International conference on construction engineering and project management
• /
• 2015.10a
• /
• pp.667-668
• /
• 2015

While the plant projects grow bigger and global attention to the plant is increasing, efficient space arrangement is not working in plant project because of the complex structure in installing the equipment unlike the construction project. In addition to this, presently, problem in installation process caused by the disagreement between floor plan and real spot is rising. Therefore the target of this research is to solve the problems and reaction differences, caused by changing the space arrangement in installing the equipment of plant construction. And this research suggests the equipment arrangement method for construction and related processes. To solve the problem, 3D cloud point data of space and equipment is collected by 3D laser scanning and the space matching is operated. In processing the space matching, data is simplified by applying the octree algorithm. This research simplifies the 3D configuration data acquired by 3D scanner equipment through the octree algorithm, and by comparing this data, identifies the space for target equipment, and finally suggests the algorithm that makes the auto space arrangement of equipment possible in construction site and also suggests the process to actualize this algorithm.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.21 no.3
• /
• pp.405-413
• /
• 1997

A thermal optimization of the chip arrangement in the PCB channel oriented vertically and cooled by natural convection has been studied. The objective of this study is to find the chip arrangement that minimizes the maximum temperature of the entire PCB channel. SIMPLER algorithm is employed in the analysis, and the genetic algorithm is used for the optimization. The results show that the chip with a maximum volumetric heat generation rate has to be located at the bottom of the channel, and chips with relatively high heat generation rates should not be close to each other, and small chip should not be located between the large chips.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.2
• /
• pp.144-151
• /
• 2005

We propose an optimization method to reduce the assembly time of chip mounters. Feeder arrangement and assembly sequence are determined considering the multiple feeder assignment. The problem is divided into two sub-problems: feeder arrangement problem and assembly sequence problem. We present mathematical model for each sub-problem. The clustering algorithm and assignment algorithm are applied to solve the feeder arrangement problem. The assignment algorithm and connection algorithm are applied to solve the assembly sequence problem. Simulation results are then presented to verity the usefulness of the proposed method.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.105-111
• /
• 2024

This paper deals with the minimum linear arrangement(MinLA) of a lattice graph, to which an approximate algorithm of linear complexity O(n) remains as a viable solution, deriving the optimal MinLA of 31,680 for 33×33 lattice. This paper proposes a partitioning arrangement algorithm of complexity O(1) that delivers exact solution to the minimum linear arrangement. The proposed partitioning arrangement algorithm could be seen as loading boxes into a container. It firstly partitions m rows into r₁,r₂,r₃ and n columns into c₁,c₂,c₃, only to obtain 7 containers. Containers are partitioning with a rule. It finally assigns numbers to vertices in each of the partitioned boxes location-wise so as to obtain the MinLA. Given m,n≥11, the size of boxes C₂,C₄,C₆ is increased by 2 until an increase in the MinLA is detected. This process repeats itself 4 times at maximum given m,n≤100. When tested to lattice in the range of 2≤n≤100, the proposed algorithm has proved its universal applicability to lattices of both m=n and m≠n. It has also obtained optimal results for 33×33 and 100×100 lattices superior to those obtained by existing algorithms. The minimum linear arrangement algorithm proposed in this paper, with its simplicity and outstanding performance, could therefore be also applied to the field of Very Large Scale Integration circuit where m,n are infinitely large.