• Journal of the Society of Naval Architects of Korea
• /
• v.54 no.5
• /
• pp.378-386
• /
• 2017

In this paper, a method is presented for the optimal design of submarine pressure hull structures by taking advantage of genetic algorithm techniques. The objective functions and design constraints in the process of structural optimization are based on the ultimate limit states of hull structures. One of the benefits associated with the utilization of genetic algorithm is that the optimization process can be completed within short generations of design variables for the pressure hull structure model. Applied examples confirm that the proposed method is useful for the optimal design of submarine pressure hull structures. Details of the design procedure with applied examples are documented. The conclusions and insights obtained from the study are summarized.

• International Journal of Automotive Technology
• /
• v.8 no.5
• /
• pp.563-573
• /
• 2007

Optimal design of an automotive catalytic converter for minimization of cold-start emissions is numerically performed using a micro genetic algorithm for two optimization problems: optimal geometry design of the monolith for various operating conditions and optimal axial catalyst distribution. The optimal design process considered in this study consists of three modules: analysis, optimization, and control. The analysis module is used to evaluate the objective functions with a one-dimensional single channel model and the Romberg integration method. It obtains new design variables from the control module, produces the CO cumulative emissions and the integral value of a catalyst distribution function over the monolith volume, and provides objective function values to the control module. The optimal design variables for minimizing the objective functions are determined by the optimization module using a micro genetic algorithm. The control module manages the optimal design process that mainly takes place in both the analysis and optimization modules.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.62 no.2
• /
• pp.177-183
• /
• 2013

We describe a new method for selecting design variables for shape optimization of high-voltage gas circuit breaker using a Kriging meta-model and a genetic algorithm. Firstly we sample balance design variables using the Latin Hypercube Sampling. Secondly, we build meta-model using the Kriging. Thirdly, we search the optimal design variables using a genetic algorithm. To obtain the more exact design variable, we adopt the boundary shifting method. With the proposed optimization frame, we can get the improved interruption design and reduce the design time by 80%. We applied the proposed method to the optimization of multivariate optimization problems as well as shape optimization of a high - voltage gas circuit breaker.

• Industrial Engineering and Management Systems
• /
• v.15 no.1
• /
• pp.19-31
• /
• 2016

A design method of the network for automated transporters mounted on rails is addressed for automated container terminals. In the network design, the flow directions of some path segments as well as routes of transporters for each flow requirement must be determined, while the total transportation and waiting times are minimized. This study considers, for the design of the network, the waiting times of the transporters during the travel on path segments, intersections, transfer points below the quay crane (QC), and transfer points at the storage yard. An algorithm, which is the combination of a modified Dijkstra's algorithm for finding the shortest time path and a queuing theory for calculating the waiting times during the travel, is proposed. The proposed algorithm can solve the problem in a short time, which can be used in practice. Numerical experiments showed that the proposed algorithm gives solutions better than several simple rules. It was also shown that the proposed algorithm provides satisfactory solutions in a reasonable time with only average 7.22% gap in its travel time from those by a genetic algorithm which needs too long computational time. The performance of the algorithm is tested and analyzed for various parameters.

• Proceedings of the KSME Conference
• /
• 2001.11a
• /
• pp.698-702
• /
• 2001

This paper presents a combinatorial method to compute the solutions of optimization problem. The present hybrid algorithm is the synthesis of an artificial life algorithm and the random tabu search method. The hybrid algorithm is not only faster than the conventional artificial life algorithm, but also gives a more accurate solution. In addition, this algorithm can find all global optimum solutions. And the enhanced artificial life algorithm is applied to optimum design of high-speed, short journal bearings and the usefuless is verified through this example.

• Proceedings of the KIEE Conference
• /
• 2009.04b
• /
• pp.6-8
• /
• 2009

This paper presents the novel implementation of memetic algorithm with GA (Genetic Algorithm) and MADS (Mesh Adaptive Direct Search), which is applied for optimal design methodology of electric machine. This hybrid algorithm has been developed for obtaining the global optimum rapidly, which is effective for optimal design of electric machine with many local optima and much longer computation time. In particular, the proposed memetic algorithm has been forwarded to optimal design of direct-driven PM wind generator for maximizing the Annual Energy Production (AEP), of which design objective should be obtained by FEA (Finite Element Analysis). After all, it is shown that GA combined with MADS has contributed to reducing the computation time effectively for optimal design of PM wind generator when compared with purposely developed GA implemented with the parallel computing method.

• Fashion & Textile Research Journal
• /
• v.13 no.5
• /
• pp.734-742
• /
• 2011

This study has been undertaken as a basic research for automatic pattern design for baseball uniforms manufactured under custom-MTM system, propose building up of a system whereby various partial patterns are combined under an automatic design system and develop a multi-combination type pattern searching algorithm which allows development of a various designs. As a result of this, type classification based on pattern design elements includes side, open, collar, facing and panel type. Design have been divided into coarse classification ranging from level 1 to 7 according to pattern design elements, based on a design distribution chart. Out of 7 such levels, 3 major types determining design which are, more specifically, level 1 sleeve type, level 2 open type and level 3 collar type, have been taken and combined to determine a total of 12 types to be used for design classification codes. Respective name of style and patterns have been coded using alphabet and numerals. Totally, pattern searching algorithm of multi-combination type has been developed whereby combination of patterns belonging to a specific style can be retrieved automatically once that style name is designated on the automatic pattern design system.

• The Journal of Industrial Distribution & Business
• /
• v.10 no.11
• /
• pp.71-80
• /
• 2019

Purpose: The purpose of this study is to design the curriculum of Basic College Software Programming to develop creative and logical-thinking. This course is guided by algorithmic thinking and logical thinking that can be solved by computing for problem-solving, and it helps to develop by software through basic programming education. Through the stage of problem analysis, abstraction, algorithm, data structure, and algorithm implementation, the curriculum is designed to help learners experience algorithm problem-solving in various areas to develop diffusion thinking. For Learners aim to achieve the balanced development of divergent and convergent-thinking needed in their creative problem-solving skills. Research design, data and methodology: This study is to design a basic software education for improving algorithm-thinking for non-major. The curriculum designed in this paper is necessary to non-majors students who have completed the 'Creative Thinking and Coding Course' Design Thinking based are targeted. For this, contents were extracted through advanced research analysis at home and abroad, and experts in computer education, computer engineering, SW education, and education were surveyed in the form of quasi-openness. Results: In this study, based on ADD Thinking's algorithm thinking, we divided the unit college majors into five groups so that students of each major could accomplish the goal of "the ability to internalize their own ideas into computing," and extracted and designed different content areas, content elements and sub-components from each group. Through three expert surveys, we established a strategy for characterization by demand analysis and major/textbook category and verified the appropriateness of the design direction to ensure that the subjects and contents of the curriculum are appropriate for each family in order to improve algorithm-thinking. Conclusions: This study helps develop software by enhancing the ability of students who practice various subjects and exercises to explore creative expressions in various areas, such as 'how to think like a computer' that can implement and execute their ideas in computing. And it helps increase the ability to think logical and algorithmic computing based on creative solutions, improving problem-solving ability based on computing thinking and fundamental understanding of computer coding and development of logical thinking ability through programming.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.12
• /
• pp.72-80
• /
• 1998

In this study, a design approach based on genetic algorithm is proposed to solve the manufacturing cell design problem considering alternative process plans and alternative machines. The problem is formulated as a 0-1 integer programming model which considers several manufacturing parameters, such as demand and processing time of part, machine capacity, manufacturing cell size, and the number of machines in a machine cell. A genetic algorithm is used to determine process plan for each part, part family and machine cell simultaneously.

• International Journal of CAD/CAM
• /
• v.2 no.1
• /
• pp.23-28
• /
• 2002

This paper presents an efficient line-offset algorithm for general polygonal shapes with islands. A developed sweep-line algorithm (SL) is introduced to find all self-intersection points accurately and quickly. The previous work is limited to handle polygons that having no line-segments in parallel to sweep-line directions. The proposed algorithm has been implemented in Visual C++ and applied to offset point sequence curves, which contain several islands.