• Journal of Mechanical Science and Technology
• /
• v.18 no.9
• /
• pp.1512-1518
• /
• 2004

Rescaled Simulated Annealing (RSA) has been adapted to solve combinatorial optimization problems in which the available computational resources are limited. Simulated Annealing (SA) is one of the most popular combinatorial optimization algorithms because of its convenience of use and because of the good asymptotic results of convergence to optimal solutions. However, SA is too slow to converge in many problems. RSA was introduced by extending the Metropolis procedure in SA. The extension rescales the state's energy candidate for a transition before applying the Metropolis criterion. The rescaling process accelerates convergence to the optimal solutions by reducing transitions from high energy local minima. In this paper, structural optimization examples using RSA are provided. Truss structures of which design variables are discrete or continuous are optimized with stress and displacement constraints. The optimization results by RSA are compared with the results from classical SA. The comparison shows that the numbers of optimization iterations can be effectively reduced using RSA.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.23 no.2
• /
• pp.83-101
• /
• 1998

Assembly U-lines are increasingly accepted in industry, especially just-in-time production systems, for the efficient utilization of workforce. In this paper, we present an integer programming formulation and a branch-and-bound method for balancing the U-line with the objective of minimizing the number of workstations with a fixed cycle time. In the mathematical model, we provide the method that can reduce the number of variables and constraints. The proposed branch-and-bound method searches the optimal solution based on a depth-first-search. To efficiently search for the optimal solutions to the problems, an assignment rule is used in the method. Bounding strategies and dominance rules are also utilized. Some problems require a large amount of computation time to find the optimal solutions. For this reason. some heuristic fathoming rules are also proposed. Extensive experiments with test-bed problems in the literature are carried out to show the performance of the proposed method. The computational results show that our method is promising in solution quality.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1998.10a
• /
• pp.397-400
• /
• 1998

This paper has a dual purpose. First, we consider a relaxation algorithm which seems to be particularly suitable for multicasting routing problems. We show that the algorithm has polynomial complexity. Second, to measure the quality of solutions in comparison to the optimal solutions over a wide range of network sizes for which the computation of the optimal costs is too excessive, we also propose a random graph generation scheme in which an asymptotic lower bound on the expected optimal cost can be computed as a function of network node size.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.11
• /
• pp.1686-1690
• /
• 1989

Using the anisotropic etching characteristics of N2H4-H2O solutions, Si diaphragm was fabricated for the integrated sensors. The optimal composition and temperature of the etching solution in (100) Si etching process was established to be 50mol% N2H4 in H2O at 105\ulcorner\ulcorner for both higher etch rate (=2.6\ulcorner/min) and better surface quality of etched (100) planes. Based on the above optimal etching condition, the electrochemical etch-stop technique was employed to form n-type Si diaphragm having a thickness of 20\ulcorner and the thickness of diapragm could exactly be controlled to 20\ulcorner\ulcorner.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1150-1155
• /
• 1990

This paper proposes an optimal redundancy resolution of a kinematically redundant manipulator while considering homotopy classes. The necessary condition derived by minimizing an integral cost criterion results in a second-order differential equation. Also boundary conditions as well as the necessary condition are required to uniquely specify the solution. In the case of a cyclic task, we reformulate the periodic boundary value problem as a two point boundary value problem to find an initial joint velocity as many dimensions as the degrees of redundancy for given initial configuration. Initial conditions which provide desirable solutions are obtained by using the basis of the null projection operator. Finally, we show that the method can be used as a topological lifting method of nonhomotopic extremal solutions and also show the optimal solution with considering the manipulator dynamics.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.4
• /
• pp.451-459
• /
• 2008

Accurate load modeling is essential for power system static and dynamic analysis. By the nature of the problem of parameter estimation for power system load modeling using actual measurements, multiple local optimal solutions may exist and local methods can be trapped in a local optimal solution giving possibly poor performance. In this paper, Trust-Tech, a novel methodology for global optimization, is applied to tackle the multiple local optimal solutions issue in measurement-based power system load modeling. Multiple sets of parameter values of a composite load model are obtained using Trust-Tech in a deterministic manner. Numerical studies indicate that Trust-Tech along with conventional local methods can be successfully applied to power system load model parameter estimation in measurement-based approaches.

• Journal of Korea Multimedia Society
• /
• v.18 no.2
• /
• pp.168-177
• /
• 2015

To increase the overall utility and decrease the link delay and power consumption, a joint optimal cross-layer design of congestion control at the transport layer, link delay at the data link layer and power allocation at the physical layer for mobile ad hoc networks is considered in this paper. As opposed to previous work, the rate outage probability in this work is based on exactly closed-form; therefore, the proposed method can guarantee the globally optimal solutions to the underlying problem. The non-convex formulated problem is transformed into a convex one, which is solved by exploiting the duality technique. Finally, simulation results verify that our proposal achieves considerable benefits over the existing method.

• Korean Journal of Mathematics
• /
• v.23 no.2
• /
• pp.293-312
• /
• 2015

We deal with a boundary control problem for the vorticity minimization, in which the ow is governed by the time-dependent two dimensional incompressible Navier-Stokes equations. We derive a mathematical formulation and a process for an appropriate control along the portion of the boundary to minimize the vorticity motion due to the ow in the fluid domain. After showing the existence of an optimal solution, we derive the optimality system for which optimal solutions may be determined. The differentiability of the state solution in regard to the control parameter shall be conjunct with the necessary conditions for the optimal solutions.

• Journal of Korean Society for Quality Management
• /
• v.41 no.3
• /
• pp.371-380
• /
• 2013

Purpose: This study analyzes the optimal operation scheme of childcare centers in Korea to maximize the quality of childcare service by determining the number of children and number of teachers. Methods: This study employs a mathematical programming methodology called 'nonlinear integer programming (NLIP)' to solve the optimization problems and compare the quality of childcare service of optimal solutions with those of present operation scheme. Results: It is very successful in obtaining the optimal solutions for alternative capacities and they guarantee the substantial improvement in the quality of childcare service. Conclusion: Though more variables should be adapted for defining the quality of childcare service robustly, it is possible to conclude that childcare centers should modify their operation scheme to improve the quality of childcare service.

• Korean Journal of Construction Engineering and Management
• /
• v.8 no.6
• /
• pp.235-245
• /
• 2007

This research study presents the development and application of an Elitist Genetic Algorithm (Elitist GA) for solving the resource-constrained project scheduling problem, which is one of the most challenging problems in construction engineering. Main features of the developed algorithm are that the elitist roulette selection operator is developed to preserve the best individual solution for the next generation so as to obtain the improved solution, and that parallel schedule generation scheme is used to generate a feasible solution to the problem. The experimental results on standard problem sets indicate that the proposed algorithm not only produces reasonably good solutions to the problems over the heuristic method and other GA, but also can find the optimal and/or near optimal solutions for the large-sized problems with multiple resources within a reasonable amount of time that will be applicable to the construction industry. This paper will help researchers and/or practitioners in the construction project scheduling software area with alternative means to find the optimal schedules by utilizing the advantages of the Elitist GA.