• 한국컴퓨터정보학회논문지
• /
• 제21권6호
• /
• pp.107-115
• /
• 2016

In this paper, we propose a Bicycle sharing has grown popular around the cities in the world due to its convenience. However, the bicycle sharing system is not problem-free, and there remains many managerial problems to be solved. In this study, we analyzed pricing strategy of a bicycle sharing system by minimizing the number of bicycles relocated by trucks, the act of which incurs penalty. The objective function is constructed by applying mixed integer programming and is presented as a stochastic model by using Markov chain so that arrival and departure rates of bicycle stations can be utilized in the analysis. The efficiency of the presented model is verified upon the analysis of bicycle sharing data gathered in Daejeon in 2014.

• Journal of Ship and Ocean Technology
• /
• 제9권4호
• /
• pp.35-46
• /
• 2005

The performance of optimisation methods, based on penalty functions, is highly problem- dependent and many methods require additional tuning of some variables. This additional tuning is the influences of penalty coefficient, which depend strongly on the degree of constraint violation. Moreover, Binary-coded Genetic Algorithm (BGA) meets certain difficulties when dealing with continuous and/or discrete search spaces with large dimensions. With the above reasons, Real-coded Micro-Genetic Algorithm (R$\mu$GA) is proposed to find the global optimum of continuous and/or discrete nonlinear constrained engineering problems without handling any of penalty functions. R$\mu$GA can help in avoiding the premature convergence and search for global solution-spaces, because of its wide spread applicability, global perspective and inherent parallelism. The proposed R$\mu$GA approach has been demonstrated by solving three different engineering design problems. From the simulation results, it has been concluded that R$\mu$GA is an effective global optimisation tool for solving continuous and/or discrete nonlinear constrained real­world optimisation problems.

• 한국수자원학회논문집
• /
• 제45권12호
• /
• pp.1213-1226
• /
• 2012

유역유출 모의 모형의 자동 보정에 주로 사용되는 진화계열의 알고리즘은 무제약 최적화 알고리즘이다. 이러한 진화계열 알고리즘에 제약조건을 반영하기 위해서는 제약조건을 다룰 수 있는 별도의 방법이 요구된다. 본 연구의 목적은 진화계열 알고리즘의 일종인 집합체 혼합진화 알고리즘에 벌칙함수를 적용하여 제약조건을 고려할 수 있도록 하는 것이다. 또한, 제약조건을 고려할 수 있는 집합체 혼합진화 알고리즘을 SWMM의 자동 보정 모듈에 적용하여 기존 자동 보정 모듈의 기능을 개선하는 것이다. 홍수유출 해석에서는 첨두유량과 관련된 지표가 중요하므로 첨두유량의 오차와 첨두유량 발생시간의 오차를 제어할 수 있는 제약조건을 구성하였다. 제약조건을 포함하여 구성된 자동 보정 모듈은 밀양댐 유역과 구로1 빗물펌프장 배수유역의 홍수유출 모의 모형에 대하여 적용되었다. 자동 보정의 결과는 제약조건의 포함 유무에 따른 결과를 비교하여제시되었다. 그 결과, 제약조건을 고려함에 따라 본래의 목적함수를 크게 위배하지 않으면서, 첨두유량과 첨두유량 발생시간의 오차가 크게 개선되었다. 또한, 검증을 통해서도 제약최적화를 통한 자동보정의 적절성이 검토되었다. 결론적으로 벌칙함수를 이용한 제약조건의 반영을 통해 자동 보정 모듈의 기능을 향상시킬 수 있었다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 Proceedings of the Korea Automatic Control Conference, 11th (KACC); Pohang, Korea; 24-26 Oct. 1996
• /
• pp.69-72
• /
• 1996

This paper considers a global resolution of kinematic redundancy under inequality constraints as a constrained optimal control. In this formulation, joint limits and obstacles are regarded as state variable inequality constraints, and joint velocity limits as control variable inequality constraints. Necessary and sufficient conditions are derived by using Pontryagin's minimum principle and penalty function method. These conditions leads to a two-point boundary-value problem (TPBVP) with natural, periodic and inequality boundary conditions. In order to solve the TPBVP and to find a global minimum, a numerical algorithm, named two-stage algorithm, is presented. Given initial joint pose, the first stage finds the optimal joint trajectory and its corresponding minimum performance cost. The second stage searches for the optimal initial joint pose with globally minimum cost in the self-motion manifold. The effectiveness of the proposed algorithm is demonstrated through a simulation with a 3-dof planar redundant manipulator.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.13-18
• /
• 2003

This paper proposes a design method of PID controllers in the framework of a constrained optimization problem. Owing to the popularity for the controller's simplicity and robustness, a great deal of literature concerning PID control design has been published, which can be classified into frequency-based and time-based approaches. However, both approaches have to be considered together for a designed PID control to work well with a guaranteed closed-loop stability. For this purpose, a penalty function is formulated to satisfy both frequency- and time-domain specifications, and is minimized by a recet nonlinear optimization algorithm to attain optimal PID control gains. The proposed method is compared with Wang's and Ho's methods on a suite of example systems. Simulation results show that the PID control tuned by the proposed method improves time-domain performance without deteriorating closed-loop stability.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -1
• /
• pp.200-203
• /
• 2002

We suggest a novel approach to the tracking of multiple moving objects in image sequence. The tracking of multiple moving objects include some complex problems(crossing (occluding), entering, disappearing, joining, and dividing) for objects identifying. Our method can settle these problems by optimization of a penalty function and movement prediction. It is executable in .eat time processing (more than 30 ㎐) because it is computed by only location data.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2005년도 춘계학술대회논문집
• /
• pp.436-439
• /
• 2005

Dynamic contact of a cantilever beam with Sap at the end is discussed. The gap in a structure induces dynamic contact, and the contact problem is always accompanied by inequality constraints which mean that the solution of the structure with contact condition should satisfy variational inequality. Inequality, but, can be reduced to equality condition considering convex penalty function. In this paper, formulation of a beam with contact is derived using quasi convex penalty function. General coordinate solution which is needed to increase computational efficiency is applied. Nonlinear behavior of a beam with rigid and elastic contact condition was discussed.

• Communications for Statistical Applications and Methods
• /
• 제12권3호
• /
• pp.615-624
• /
• 2005

In this paper, we review the variable-selection properties of LASSO and SCAD in penalized regression. To improve the weakness of SCAD for high noise level, we propose a new penalty function called MSCAD which relaxes the unbiasedness condition of SCAD. In order to compare MSCAD with LASSO and SCAD, comparative studies are performed on simulated datasets and also on a real dataset. The performances of penalized regression methods are compared in terms of relative model error and the estimates of coefficients. The results of experiments show that the performance of MSCAD is between those of LASSO and SCAD as expected.

• 경영과학
• /
• 제17권2호
• /
• pp.39-54
• /
• 2000

This paper presents a causal forecasting model using guided genetic algorithm in continuous manufacturing process. The guide genetic algorithm(GGA) is an extended genetic algorithm(GA) using penalty function and population diversity index to increase forecasting accuracy. GGA adds to the canonical GA the concept of a penalty function to avoid selecting the unproductive chromosomes and to make a proper searching direction. Also, GGA modifies the current population using the similarity of chromosomes to avoid falling into the trap of local optimal solution. For investigation GGA performance, we used a set of real data that was collected in local glass melting processes, and experimental results show the proposed model results in the better forecasting accuracy than linear regression model and canonical GA.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 하계학술대회 논문집 D
• /
• pp.2242-2244
• /
• 2004

This paper deals with the design of a reduced-order stabilizing controller for the linear system. The coupled lineal matrix inequality (LMI) problem subject to a rank condition is solved by a sequential semidefinite programming (SDP) approach. The nonconvex rank constraint is incorporated into a strictly linear penalty function, and the computation of the gradient and Hessian function for the Newton method is not required. The penalty factor and related term are updated iteratively. Therefore the overall procedure leads to a successive LMI relaxation method. Extensive numerical experiments illustrate the proposed algorithm.