• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.2
• /
• pp.168-175
• /
• 2003

A new algorithm based on Genetic Algorithms is proposed f3r solving process optimization problems formulated in MINLP, GDP and hybrid MINLP/GDP. This work is focused especially on the design of the Genetic Algorithm suitable to handle disjunctive programming with the same level of MINLP handling capability. Hybridization with the Simulated Annealing is experimented and many heuristics are adopted. Real and binary coded Genetic Algorithm initiates the global search in the entire search space and at every stage Simulated Annealing makes the candidates to climb up the local hills. Multi-Niche Crowding method is adopted as the multimodal function optimization technique. and the adaptation of probabilistic parameters and dynamic penalty systems are also implemented. New strategies to take the logical variables and constraints into consideration are proposed, as well. Various test problems selected from many fields of process systems engineering are tried and satisfactory results are obtained.

• Journal of Korean Society of Transportation
• /
• v.13 no.3
• /
• pp.19-33
• /
• 1995

Conventional traffic assignment techniques usually do not consider traveler's route choice behavior affected by hierachicla strucfture in urban highway system. This study realizes the route choice behavior such that travelers tend to choose more higher level of highway rather than lower level of highway for longer trops. Otherwise, for shorter trips, travelers tend to choose lower level of highway unless they can get sufficient travel time saving by using mojor arterial street or freeway (higher level of highway). Therefore, this study suggests a traffic assignment technique incorrporating route choice behavior related to hierachical highway structure by introducing some perception costs to generalized cost function such as perceptional preference measureemnt for higher level higheay and perceptional penalty when changing to different level of highway. Through simulation analysis, it is shown that the simulation results with the new traffic assignment echnique can be different a lot from the results with the convential method.

• Structural Engineering and Mechanics
• /
• v.35 no.1
• /
• pp.83-98
• /
• 2010

In this paper, the mass optimization of four bar linkages is carried out using genetic algorithms (GA) with single and dual constraints. The single constraint of bending stress and the dual constraints of bending and buckling stresses are imposed. From the movement response of the bar linkage mechanism, the analysis of the mechanism is developed using the combination of kinematics, kinetics, and finite element analysis (FEA). A penalty-based transformation technique is used to convert the constrained problem into an unconstrained one. Lastly, a detailed comparison on the effect of single constraint and of dual constraints is presented.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.2
• /
• pp.111-120
• /
• 2004

This paper presents an application of Unified Modeling Language(UML) software technique for developing transmission pricing evaluation package. Also, this paper describes a transmission pricing algorithm applicable to a large-scale power system. The usage-based transmission pricing mechanism is very complex since it requires power flow analysis, fault current analysis, sensitivity evaluation of a transmission line, penalty factors calculation, transmission asset databases, and cost allocation rules, etc. For the efficient and flexible development of the transmission pricing package, a UML. approach is applied, which is composed of a use-case diagram, interaction diagram, class diagram, and package diagram using Rational Rose Unified Process(RUP). The designed transmission pricing package can be efficiently modified and reused as the market environments evolves since it is designed by Object-Oriented Programming(OOP).

• ETRI Journal
• /
• v.21 no.4
• /
• pp.9-22
• /
• 1999

This paper considers a problem of configuring both physical backbone and logical virtual path (VP) networks in a reconfigurable asynchronous transfer mode (ATM) network where links are subject to failures. The objective is to determine jointly the VP assignment, the capacity assignment of physical links and the bandwidth allocation of VPs, and the routing assignment of traffic demand at least cost. The network cost includes backbone link capacity expansion cost and penalty cost for not satisfying the maximum throughput of the traffic due to link failures or insufficient link capacities. The problem is formulated as a zero-one non-linear mixed integer programming problem, for which an effective solution procedure is developed by using a Lagrangean relaxation technique for finding a lower bound and a heuristic method exploited for improving the upper bound of any intermediate solution. The solution procedure is tested for its effectiveness with various numerical examples.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.21 no.9
• /
• pp.1230-1243
• /
• 1997

A numerical technique for simulating incompressible viscous flow with free surface is presented. The flow field is obtained by penalty finite element formulation. In this work, a modified volume of fluid (VOF) method which is compatible with 4-node element is proposed to track the moving free surface. This scheme can be applied to irregular mesh system, and can be easily extended to three dimensional geometries. Numerical analyses were done for two benchmark examples, namely the broken dam problem and the solitary wave propagation problem. The numerical results were in close agreement with the existing data. Illustrative examples were studied to show the effectiveness of the proposed numerical scheme.

• Journal of Mechanical Science and Technology
• /
• v.18 no.2
• /
• pp.253-261
• /
• 2004

A simple and effective filtering method to control the member size of an optimized structure is proposed for topology optimization. In the present approach, the original objective sensitivities are replaced with their relative values evaluated within a filtering area. By adjusting the size of the filtering area, the member size of an optimized structure or the level of its topological complexity can be controlled even within a given finite element mesh. In contrast to the checkerboard-free filter, the present filter focuses on high-frequency components of the sensitivities. Since the present filtering method does not add a penalty term to the objective function nor require additional constraints, it is not only efficient but also simple to implement. Mean compliance minimization and eigenfrequency maximization problems are considered to verify the effectiveness of the present approach.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.732-735
• /
• 1999

A GA-based optimization technique is adopted in the paper to obtain optimal future control inputs for predictive control systems. For reliable future predictions of a process, we identify the underlying process with an NNARX model structure and investigate to reduce the volume of neural network based on the Lipschitz index and a criterion. Since most industrial processes are subject to their constraints, we deal with the input-output constraints by modifying some genetic operators and/or using a penalty strategy in the GAPC. Some computer simulations are given to show the effectiveness of the GAPC method compared with the adaptive GPC algorithm.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1999.03b
• /
• pp.103-107
• /
• 1999

In this paper, a computer simulation technique for the forging process having a floating die is presented. The penalty rigid-plastic finite element method is employed together with an iteratively force-balancing method, in which the convergence is achieved when the floating die part is in force equilibrium within the user-specified tolerance. The force balance is controled by adjusting the velocity of the floating die in an automatic manner. An application example of a three-stage cold forging process is given.

• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.981-1000
• /
• 2009

This paper considers asset liability management problems when their deterministic equivalent formulations are general nonlinear optimization problems. The presented approach uses a nonmonotone trust region strategy for solving a sequence of unconstrained subproblems parameterized by a scalar parameter. The objective function of each unconstrained subproblem is an augmented penalty-barrier function that involves both primal and dual variables. Each subproblem is solved approximately. The algorithm does not restrict a monotonic decrease of the objective function value at each iteration. If a trial step is not accepted, the algorithm performs a non monotone line search to find a new acceptable point instead of resolving the subproblem. We prove that the algorithm globally converges to a point satisfying the second-order necessary optimality conditions.