• International Journal of Aeronautical and Space Sciences
• /
• v.13 no.1
• /
• pp.106-116
• /
• 2012

Optimal transfer trajectories based on the planar circular restricted three body problem are designed by using mixed impulsive and continuous thrust. Continuous and dynamic trajectory optimization is reformulated in the form of discrete optimization problem. This is done by the method of direct transcription and collocation. It is then solved by using nonlinear programming software. Two very different transfer trajectories can be obtained by the different combinations of the design parameters. Furthermore, it was found out that all designed trajectories permit a ballistic capture by the Moon's gravity. Finally, the required thrust profiles are presented and they are analyzed in detail.

• Structural Engineering and Mechanics
• /
• v.81 no.3
• /
• pp.367-378
• /
• 2022

In this study, combined size and shape optimization of spatial truss tower structures are presented by using new optimization algorithms named Rao-1, and Rao-2. The nodal displacements, allowable stress and buckling for compressive members are taken into account as structural constraints for truss towers. The discrete and continuous design variables are used as design variables for size and shape optimization. To show the efficiency of the proposed optimization algorithm, 25-bar, and 39-bar 3D truss towers are solved for combined size and shape optimization. The 72-bar, and 160-bar 3D truss towers are solved only by size optimization. The optimal results obtained from this study are compared to those given in the literature to illustrate the efficiency and robustness of the proposed algorithm. The structural analysis and the optimization process are coded in MATLAB programming.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.7
• /
• pp.4999-5008
• /
• 2015

The application of efficient constraint handling technique is fundamental method to find better solutions in engineering optimization problems with constraints. In this research four of constraint handling techniques are used with a meta-heuristic optimization method, harmony search algorithm, and the efficiency of algorithm is evaluated. The sample problem for evaluation of effectiveness is one of the typical discrete problems, optimal pipe size design problem of water distribution system. The result shows the suggested constraint handling technique derives better solutions than classical constraint handling technique with penalty function. Especially, the case of ${\varepsilon}$-constrained method derives solutions with efficiency and stability. This technique is meaningful method for improvement of harmony search algorithm without the need for development of new algorithm. In addition, the applicability of suggested method for large scale engineering optimization problems is verified with application of constraint handling technique to big size problem has over 400 of decision variables.

• Journal of the Korean Society of Manufacturing Process Engineers
• /
• v.19 no.12
• /
• pp.34-41
• /
• 2020

Ready-mixed concrete is unconsolidated concrete typically transported to construction sites by using mixer trucks. A proper rotation of concrete is necessary to prevent its solidification in mixer trucks during transport: in accordance with the manufacturing method and quality inspection prescribed in KSF4009, this movement is maintained after the manufacturing of concrete in professional production plants and the addition of water, solid materials, and admixtures. Unfortunately, mixer truck parts wear out over long periods of time. In order to improve the wear resistance of the main part of mixer trucks, we used a steel plate with good wear resistance or partially added a reinforcement plate. In this study, we first tested the properties of concrete (as required for the DEM), and then carried out mixing and discharge simulations to define the actual operating conditions of mixer trucks. For each condition, we calculated the amount and location of wear. The reliability of our results was finally verified by comparing them with the measurement values. Overall, this study provided basic data for an optimal design of mixer trucks: one that would reduce the vehicles' weight and production costs.

• The KSFM Journal of Fluid Machinery
• /
• v.17 no.2
• /
• pp.48-53
• /
• 2014

A low-noise regenerative blower is developed for fuel cell application by combining the FANDAS-Regen code and design optimization algorithm under several performance constraints for flow capacity, static pressure, efficiency and power consumption. The optimized blower design model is manufactured with some impeller modification based on low noise design concept and tested by using aerodynamic performance chamber facility and narrow-band noise measurement apparatus. The measured results of the optimized blower satisfy the performance requirements and are also compared favorably with the FANDAS-Regen prediction results within a few percent relative error. Furthermore, the present study shows the remarkable noise reduction by 26 dBA can be achieved through design optimization and low noise design concept.

• Journal of Korean Society of Transportation
• /
• v.26 no.1
• /
• pp.145-153
• /
• 2008

Existing shortest-path algorithms mainly consider a single attribute. But traveler actually chooses a route considering not single attribute but various attributes which are synthesized travel time, route length, personal preference, etc. Therefore, to search the optimal path, these attributes are considered synthetically. In this study route searching algorithm which selects the maximum utility route using discrete choice model has developed in order to consider various attributes. Six elements which affect route choice are chosen for the route choice model and parameters of the models are estimated using survey data. A multinomial logit models are developed to design the function of route choice model. As a result, the model which has route length, delay time, the number of turning as parameter is selected based on the significance test. We use existing shortest path algorithm, which can reflect urban transportation network such as u-turn or p-turn, and apply it to the real network.

• Journal of Korea Multimedia Society
• /
• v.7 no.11
• /
• pp.1505-1514
• /
• 2004

Sequence matching in time-series databases is an operation that finds the data sequences whose changing patterns are similar to that of a query sequence. Typically, sequence matching hires a multi-dimensional index for its efficient processing. In order to alleviate the dimensionality curse problem of the multi-dimensional index in high-dimensional cases, the previous methods for sequence matching apply the Discrete Fourier Transform(DFT) to data sequences, and take only the first two or three DFT coefficients as organizing attributes of the multi-dimensional index. This paper first points out the problems in such simple methods taking the firs two or three coefficients, and proposes a novel solution to construct the optimal multi -dimensional index. The proposed method analyzes the characteristics of a target database, and identifies the organizing attributes having the best discrimination power based on the analysis. It also determines the optimal number of organizing attributes for efficient sequence matching by using a cost model. To show the effectiveness of the proposed method, we perform a series of experiments. The results show that the Proposed method outperforms the previous ones significantly.

• Journal of Korea Water Resources Association
• /
• v.32 no.1
• /
• pp.71-81
• /
• 1999

The objective of this study is to develop a model which can design an optimal pipe network system of least cost while satisfying all the design constraints including hydraulic constraints using a genetic algorithm technique. Hydraulic constraints interfaced with the simulation program(KYPIPE) checked feasible solution region. Genetic algorithm(GA) technique is a relatively new optimization technique. The GA is known as a very powerful search and optimization technique especially when solving nonlinear programming problems. The model developed in this study selects optimal pipe diameters in the form of commercial discrete sizes using the pipe diameters and the pumping powers as decision variables. The model not only determines the optimal diameters and pumping powers of pipe network system but also satisfies the discharge and pressure requirements at demanding nodes. The model has been applied to an imaginary and an existing pipe network systems. One system is adopted from journal papers which has been used as an example network by many other researchers. Comparison of the results shows compatibility of the model developed in this study. The model is also applied to a system in Goyang city in order to check the model applicability to finding of optimal pumping powers. It has been found that the developed model can be successfully applied to optimal design of pipe network systems in a relatively simple manner.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1586-1592
• /
• 1999

In DWMT, CMFB is employed in the synthesis/analysis part. The CMFB uses filters of greater length than the DFT, resulting in reduced interference between the carriers. In addition, the CMFB system is computationally efficient and fast algorithms are available for their implementation. Traditional designs for the prototype filters of CMFB usually involve nonlinear optimizations. Thus the required design time is considerably large even for small filter orders. In this paper, a prototype filter design method for CMFB is presented using optimal window method. The design process is reduced to the optimization of a single parameter and consequently the required design time is much less than those of the existing methods. It is shown that the stopband performance of the proposed method is better than that of the Kaiser window method.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.36 no.4
• /
• pp.361-371
• /
• 2012

In order to improve the efficiency of the branch-and-bound method for mixed-discrete nonlinear programming, a nonuniform convergence tolerance scheme is proposed for the continuous subproblem optimizations. The suggested scheme assigns the convergence tolerances for each continuous subproblem optimization according to the maximum constraint violation obtained from the first iteration of each subproblem optimization in order to reduce the total number of function evaluations needed to reach the discrete optimal solution. The proposed tolerance scheme is integrated with five branching order options. The comparative performance test results using the ten combinations of the five branching orders and two convergence tolerance schemes show that the suggested non-uniform convergence tolerance scheme is obviously superior to the uniform one. The results also show that the branching order option using the minimum clearance difference method performed best among the five branching order options. Therefore, we recommend using the "minimum clearance difference method" for branching and the "non-uniform convergence tolerance scheme" for solving discrete optimization problems.