• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.4
• /
• pp.32-42
• /
• 2021

The printing process can have to print various colors with a limited capacity of printing facility such as ink containers that are needed cleaning to change color. In each container, cleaning time exists to assign corresponding inks, and it is considered as the setup cost required to reduce the increasing productivity. The existing manual method, which is based on the worker's experience or intuition, is difficult to respond to the diversification of color requirements, mathematical modeling and algorithms are suggested for efficient scheduling. In this study, we propose a new type of scheduling problem for the printing process. First, we suggest a mathematical model that optimizes the color assignment and scheduling. Although the suggested model guarantees global optimality, it needs a lot of computational time to solve. Thus, we decompose the original problem into sequencing orders and allocating ink problems. An approximate function is used to compute the job scheduling, and local search heuristic based on 2-opt algorithm is suggested for reducing computational time. In order to verify the effectiveness of our method, we compared the algorithms' performance. The results show that the suggested decomposition structure can find acceptable solutions within a reasonable time. Also, we present schematized results for field application.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2022.11a
• /
• pp.351-356
• /
• 2022

Among the path planning methods used to generate the ship's path, the graph search-based method is widely used because it has the advantage of its completeness, optimality. In order to apply the graph-based search method to the berthing path plan, the deviation from the path must be minimized. Path following suitability should be considered essential, since path deviation during berthing can lead to collisions with berthing facilities. However, existing studies of graph search-based berthing path planning are dangerous for application to real-world navigation environments because they produce results with a course change just before berthing. Therefore, in this paper, we develop a cost function suitable for path following, and propose a 3D A* algorithm that applies it. In addition, in order to evaluate the suitability for the actual operating environment, the results of the path generation of the algorithm are compared with the trajectory of the data collected by manned operations.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.25 no.6
• /
• pp.559-567
• /
• 2012

A level set based topological shape optimization method for nonlinear structure considering hyper-elastic problems is developed. To relieve significant convergence difficulty in topology optimization of nonlinear structure due to inaccurate tangent stiffness which comes from material penalization of whole domain, explicit boundary for exact tangent stiffness is used by taking advantage of level set function for arbitrary boundary shape. For given arbitrary boundary which is represented by level set function, a Delaunay triangulation scheme is used for current structure discretization instead of using implicit fixed grid. The required velocity field in the actual domain to update the level set equation is determined from the descent direction of Lagrangian derived from optimality conditions. The velocity field outside the actual domain is determined through a velocity extension scheme based on the method suggested by Adalsteinsson and Sethian(1999). The topological derivatives are incorporated into the level set based framework to enable to create holes whenever and wherever necessary during the optimization.

• The Korean Journal of Applied Statistics
• /
• v.30 no.5
• /
• pp.733-745
• /
• 2017

Local composite quantile regression is a useful non-parametric regression method widely used for its high efficiency. Data smoothing methods using kernel are typically used in the estimation process with performances that rely largely on the smoothing parameter rather than the kernel. However, $L_2$-norm is generally used as criterion to estimate the performance of the regression function. In addition, many studies have been conducted on the selection of smoothing parameters that minimize mean square error (MSE) or mean integrated square error (MISE). In this paper, we explored the optimality of selecting smoothing parameters that determine the performance of non-parametric regression models using local linear composite quantile regression. As evaluation criteria for the choice of smoothing parameter, we used mean absolute error (MAE) and mean integrated absolute error (MIAE), which have not been researched extensively due to mathematical difficulties. We proved the uniqueness of the optimal smoothing parameter based on MAE and MIAE. Furthermore, we compared the optimal smoothing parameter based on the proposed criteria (MAE and MIAE) with existing criteria (MSE and MISE). In this process, the properties of the proposed method were investigated through simulation studies in various situations.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.27 no.1
• /
• pp.9-16
• /
• 2014

Using a level set method and topological derivatives, a topological shape optimization method that is independent of an initial design is developed for linearly elastic structures. In the level set method, the initial domain is kept fixed and its boundary is represented by an implicit moving boundary embedded in the level set function, which facilitates to handle complicated topological shape changes. The "Hamilton-Jacobi(H-J)" equation and computationally robust numerical technique of "up-wind scheme" lead the initial implicit boundary to an optimal one according to the normal velocity field while minimizing the objective function of compliance and satisfying the constraint of allowable volume. Based on the asymptotic regularization concept, the topological derivative is considered as the limit of shape derivative as the radius of hole approaches to zero. The required velocity field to update the H-J equation is determined from the descent direction of Lagrangian derived from optimality conditions. It turns out that the initial holes are not required to get the optimal result since the developed method can create holes whenever and wherever necessary using indicators obtained from the topological derivatives. It is demonstrated that the proper choice of control parameters for nucleation is crucial for efficient optimization process.

• Journal of Korean Society of Steel Construction
• /
• v.24 no.6
• /
• pp.671-682
• /
• 2012

The use of sinusoidal corrugated web girder for the box-type girders and gable steel main frames has recently been increasing very much. The reasons are that the thin web of the girder affords a significant weight reduction compared with rolled beam and welded built-up girder, and that corrugation prevents the buckling failure of the web. Improvements of the automatic fabrication process makes mass production of the corrugated web and unit possible, and applications of this girder have been extended considerably. Thus, the research for the optimum design processer considering the production data is needed practically. For doing this research, we develope the discrete optimum structural design program in consideration of production list data for the research, and the program apply to the single girder under the uniform load and the concentrated load as numerical example. We consider objective function as minimum weight of the girder, and use slenderness ratio, stress of flanges and corrugated web, and the girder deflection as the constraint functions. And also the Genetic Algorithms is adopted to search the global minimum point by using the production list as a discrete design variable. Finally, to verify the optimality of the design, we conduct a comparison of the results of the discrete optimum design with those of the continuous one, and also analyze the characteristics of the optimum cross-section.

• Journal of Korean Society of Forest Science
• /
• v.81 no.4
• /
• pp.363-371
• /
• 1992

This study was aimed at developing a computer model to determine rational road networks in mountainous forests. The computer model is composed of two major subroutines for digital terrain analyses and route selection. The digital terrain model(DTM) provides various information on topographic and vegetative characteristics of forest stands. The DTM also evaluates the effectiveness of road construction based on slope gradients. Using the results of digital terrain analyses, the route selection subroutine, heuristically, determines the optimal road layout satisfying the predefined road densities. The route selection subroutine uses the area-partitioning method in order to fully of roads. This method leads to unbiased road layouts in forest areas. The size of the unit partitiones area can be calculated as a function of the predefined road density. In addition, the user-defined road density of the area-partitioning method provides flexibility in applying the model to real situations. The rational road network can be easily achived for varying road densities, which would be an essential element for network design of forest roads. The optimality conditions are evaluated in conjuction with longitudinal gradients, investment efficiency earthwork quantity or the mixed criteria of these three. The performance of the model was measured and, then, compared with those of conventional ones in terns of average skidding distance, accessibility of stands, development index and circulated road network index. The results of the performance analysis indicate that selection of roading routes for network design using the digital terrain analysis and the area-partitioning method improves performance of the network design medel.