• Journal of the Korea Computer Industry Society
• /
• v.4 no.12
• /
• pp.943-952
• /
• 2003

GDS(Grating automatic Drawing System), which is an automatic design system of metal products called grating, is a system that produces various detailed drawings on the basis of information within a Plan Drawing that represents layout of the gratings such as locations, shapes, directions, etc. However, automatically produced drawings by GDS do not fully satisfy the standard of the general dimension marking method used among the layout designers. The lack of this standard quality mainly results from the fact that overlapping among dimension markings appears frequently. To solve the overlapping problem we applied the rule-based expert system which uses the expert's knowledges and facts to solve the problems. The rules for the expert system are designed based on the expertise of skilled layout designers within the grating production lines.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2004.05a
• /
• pp.870-875
• /
• 2004

Beam stiffeners have frequently been used for raising natural frequencies of base structures. In stiffener layout optimization problems, most of the previous researches considering the position and/or the length of the stiffener as design variables dealt with structures having just simple convex shapes such as a square or rectangle. The reason is concave shape structures have difficulties ill formulating geometry constraints. In this paper, a new geometry constraint handling technique, which can define both convex and concave feasible lesions and measure a degree of geometry constraint violation, is proposed. Evolution strategies (ESs) is utilized as an optimization tool. In addition, the constraint-handling technique of EVOSLINOC (EVOlution Strategy for scalar optimization with Lineal and Nonlinear Constraints) is utilized to solve constrained optimization problems. From a numerical example, the proposed geometry constraint handling technique is verified and proves that the technique can easily be applied to structures in net only convex but also concave shapes, even with a protrusion or interior holes.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.18 no.2
• /
• pp.185-191
• /
• 2008

Optimal damping layout of the constrained viscoelastic damping layer on beam is identified with temperatures by using a gradient-based numerical search algorithm. An optimal design problem is defined in order to determine the constrained damping layer configuration. A finite element formulation is introduced to model the constrained layer damping beam. The four-parameter fractional derivative model and the Arrhenius shift factor are used to describe dynamic characteristics of viscoelastic material with respect to frequency and temperature. Frequency-dependent complex-valued eigenvalue problems are solved by using a simple re-substitution algorithm in order to obtain the loss factor of each mode and responses of the structure. The results of the numerical example show that the proposed method can reduce frequency responses of beam at peaks only by reconfiguring the layout of constrained damping layer within a limited weight constraint.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.4
• /
• pp.97-102
• /
• 2001

In computer-aided design, partitioning is task of clustering objects into groups to that a given objection function is optimized It is used at the layout level to fin strongly connected components that can be placed together in order to minimize the layout area and propagation delay. Partitioning can also be used to cluster variables and operation into groups for scheduling and unit selection in high-level synthesis. The most popular algorithms partitioning include the Kernighan-Lin algorithm Fiduccia-Mattheyses heuristic and simulated annealing In this paper we propose a genetic algorithm searching solution space for the circuit partitioning problem. and then compare it with simulated annealing by analyzing the results of implementation.

• The Journal of the Korea Contents Association
• /
• v.21 no.7
• /
• pp.164-170
• /
• 2021

In VLSI design, partitioning is a task of clustering objects into groups so that a given objective circuit is optimized. It is used at the layout level to find strongly connected components that can be placed together in order to minimize the layout area and propagation delay. The most popular algorithms for partitioning include the Kernighan-Lin algorithm, Fiduccia-Mattheyses heuristic and simulated annealing. In this paper, we propose a adapted genetic algorithm searching solution space for the circuit partitioning problem, and then compare it with simulated annealing and genetic algorithm by analyzing the results of implementation. As a result, it was found that an adaptive genetic algorithm approaches the optimal solution more effectively than the simulated annealing and genetic algorithm.

• Journal of information and communication convergence engineering
• /
• v.19 no.2
• /
• pp.114-119
• /
• 2021

This paper proposes a method to find an optimal T' with the most terminal of the subset of T' trees that can be connected by a given length by improving a memetic genetic algorithm within several constraints, when the set of terminal T is given to the Euclidean plane R². Constraint (1) is that a given length cannot connect all terminals of T, and (2) considers only the rectilinear layout of the edge connecting each terminal. The construction of interconnections has been used in various design-related areas, from network to architecture. Among these areas, there are cases where only the rectilinear layout is considered, such as wiring paths in the computer network and VLSI design, network design, and circuit connection length estimation in standard cell deployment. Therefore, the heuristics proposed in this paper are expected to provide various cost savings in the rectilinear layout.

• International conference on construction engineering and project management
• /
• 2022.06a
• /
• pp.1085-1092
• /
• 2022

Travel distance is a parameter mainly used in the objective function of Construction Site Layout Planning (CSLP) automation models. To obtain travel distance, common approaches, such as linear distance, shortest-distance algorithm, visibility graph, and access road path, concentrate only on identifying the shortest path. However, humans do not necessarily follow one shortest path but can choose a safer and more comfortable path according to their situation within a reasonable range. Thus, paths generated by these approaches may be different from the actual paths of the workers, which may cause a decrease in the reliability of the optimized construction site layout. To solve this problem, this paper adopts reinforcement learning (RL) inspired by various concepts of cognitive science and behavioral psychology to generate a realistic path that mimics the decision-making and behavioral processes of wayfinding of workers on the construction site. To do so, in this paper, the collection of human wayfinding tendencies and the characteristics of the walking environment of construction sites are investigated and the importance of taking these into account in simulating the actual path of workers is emphasized. Furthermore, a simulation developed by mapping the identified tendencies to the reward design shows that the RL agent behaves like a real construction worker. Based on the research findings, some opportunities and challenges were proposed. This study contributes to simulating the potential path of workers based on deep RL, which can be utilized to calculate the travel distance of CSLP automation models, contributing to providing more reliable solutions.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.7 no.3
• /
• pp.75-80
• /
• 2008

The progressive die performs a work of sheet metal processes with a piercing, notching, embossing, bending, drawing, cut-off etc. in many kinds of pressing. Now a days, these processes have been evaluated as a advanced tooling method to increase the productivity and high quality assurance. The first step analyzing of die design is production part review, then the arrangement drawing of product design and strip process layout design should be done as a next steps with a FEM simulation for its problem solution. After upper procedure were peformed, it was started to make the die, then tryout and its revision of the die and product quality, safety, productivity etc. were done continually. For the all of these process, we mobilized the theory and practice of sheet metal forming, die structure, the function and activity of die components, and the others of die machining, die material, heat treatment and know‐how so on. In this study the features of representative are production part analyzing through the FEM simulation of bending area with a considering spring back problem by DEFORM.

• Journal of Communications and Networks
• /
• v.8 no.1
• /
• pp.49-58
• /
• 2006

One of the first decisions that a radio network designer must take is the location of base stations and the distance between them in order to give the best coverage to a region and, possibly, to reduce deployment costs. In this paper, the authors give an insight to this matter by presenting a possible solution to a real problem: Planning the base stations layout for a universal mobile telecommunications system (UMTS) in the city of Barcelona. At the basis of this problem, there is the interdependence between coverage and capacity in a wideband-code division multiple access (W-CDMA) system, which is a new element in the planning of BS layout for mobile communications. This aspect has been first treated with an analytical study of the cell coverage range for a specific environment and service. The achieved results have been checked with the help of snapshot simulations together with a geographical information system (GIS) tool incorporated in the simulator that allows to perform analysis and to visualize results in a useful way. By using the simulator, it is also possible to study a more complex environment, that of a set of base stations providing multiple services to a large number of users.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.4
• /
• pp.91-99
• /
• 2014

TThis paper suggests an heuristic polynomial time algorithm to solve the optimal solution for QAP (quadratic assignment problem). While Hungarian algorithm is most commonly used for a linear assignment, there is no polynomial time algorithm for the QAP. The proposed algorithm derives a grid type layout among unit distances of a distance matrix. And, we apply max-flow/min-distance approach to assign this grid type layout in such a descending order way that the largest flow is matched to the smallest unit distance from flow matrix. Evidences from implementation results of the proposed algorithm on various numerical grid type QAP examples show that a solution to the QAP could be obtained by a polynomial algorithm.