• 대한산업공학회지
• /
• 제30권2호
• /
• pp.93-106
• /
• 2004

This paper studied a maximal covering location problem with cost restrictions, to maximize level of service within predetermined cost. It is assumed that all demand have to be met. If the demand node is located within a given range, then its demand is assumed to be covered, but if it is not, then its demand is assumed to be uncovered. An uncovered demand is received a service but at an unsatisfactory level. The objective function is to maximize the sum of covered demand, Two heuristics based on the Lagrangean relaxation of allocation and decoupling are presented and tested. Upper bounds are found through a subgradient optimization and lower bounds are by a cutting algorithm suggested in this paper. The cutting algorithm enables the Lagrangean relaxation to be proceeded continually by allowing infeasible solution temporarily when the feasible solution is not easy to find through iterations. The performances are evaluated through computational experiments. It is shown that both heuristics are able to find the optimal solution in a relatively short computational time for the most instances, and that decoupling relaxation outperformed allocation relaxation.

• 한국위성정보통신학회논문지
• /
• 제7권1호
• /
• pp.53-58
• /
• 2012

본 논문에서는 sparse 채널에서 대표적인 채널 추정 기법들의 오차 성능을 비교 및 분석한다. 오차 성능을 비교하기 위해 크라머-라오 경계를 이용하여 최소평균자승오차 추정기법의 하한 경계를 구하고 이를 정합 추적 기법의 상한 경계와 분석한다. 분석 결과로부터 추정 탭 개수와 신호 대 잡음비에 따라 기존에 sparse 채널에서 효율적인 추정기법으로 알려진 정합 추적 기법보다 최소평균 자승오차 추정기법의 오차가 적을 수 있음을 보인다. 레일리이 페이딩 분포를 갖는 두 개의 sparse 채널에 대한 전산모의실험 결과 신호 대 잡음비에 따라 두 추정 기법의 오차 성능이 반전되는 경우를 보였다.

• Interaction and multiscale mechanics
• /
• 제5권3호
• /
• pp.211-228
• /
• 2012

This paper reports the development of a generalized inverse analysis formulation for the parameter estimation of four-parameter Burger model. The analysis is carried out by formulating the problem as a mathematical programming formulation in terms of identification of the design vector, the objective function and the design constraints. Thereafter, the formulated constrained nonlinear multivariable problem is solved with the aid of fmincon: an in-built constrained optimization solver module available in MatLab. In order to gain experience, a synthetic case-study is considered wherein key issues such as the determination and setting up of variable bounds, global optimality of the solution and minimum number of data-points required for prediction of parameters is addressed. The results reveal that the developed technique is quite efficient in predicting the model parameters. The best result is obtained when the design variables are subjected to a lower bound without any upper bound. Global optimality of the solution is achieved using the developed technique. A minimum of 4-5 randomly selected data-points are required to achieve the optimal solution. The above technique has also been adopted for real-time settlement of four oil refineries with encouraging results.

• 한국지능시스템학회논문지
• /
• 제20권6호
• /
• pp.755-760
• /
• 2010

일반적으로 이산 최적화에서의 라그랑지안 방법은 제약조건을 쉽게 다루기 위한 기법이다. 이 방법은 전형적으로 분지한계법에서 상한을 찾을 때 사용한다. 본 논문은 여러 개의 제약조건이 있는 다중 배낭 문제를 위한 새로운 라그랑지안 방법을 제안한다. 기존 라그랑지안 접근법과는 달리 제안한 방법은 라그랑지안 벡터의 새로운 특징에 기초하여 품질 좋은 하한(즉, 가능 해)을 효율적으로 찾을 수 있다. 잘 알려진 큰 규모의 벤치마크 데이터에서 실험을 하였고 제안한 라그랑지안 방법은 기존 방법의 성능을 개선하였다.

• 산업경영시스템학회지
• /
• 제40권4호
• /
• pp.137-146
• /
• 2017

For the competitive business environment under purchase dependence, this paper proposes a new approximate calculation of order fill rate which is a probability of satisfying a customer order immediately using the existing inventory. Purchase dependence is different to demand dependence. Purchase dependence treats the purchase behavior of customers, while demand dependence considers demand correlation between items, between regions, or over time. Purchase dependence can be observed in such areas as marketing, manufacturing systems, and distribution systems. Traditional computational methods have a difficulty of the curse of dimensionality for the large cases, when deriving the stationary joint distribution which is utilized to calculate the order fill rate. In order to escape the curse of dimensionality and protect the solution from diverging for the large cases, we develop a greedy iterative search algorithm based on the Gauss-Seidel method. We show that the greedy iterative search algorithm is a dependable algorithm to derive the stationary joint distribution of on-hand inventories in the retailer system by conducting a comparison analysis of a greedy iterative search algorithm with the simulation. In addition, we present some managerial insights such as : (1) The upper bound of order fill rate can be calculated by the one-item pure system, while the lower bound can be provided by the pure system that consists of all items; (2) As the degree of purchase dependence declines while other conditions remain same, it is observed that the difference between the lower and upper bounds reduces, the order fill rate increases, and the order fill rate gets closer to the upper bound.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2008년도 추계학술대회B
• /
• pp.2744-2749
• /
• 2008

Numerical calculations are carried out for the natural convection induced by temperature difference between a cold outer square cylinder and a hot inner circular cylinder for Rayleigh number of $Ra=10^7$. This study investigates the effect of the inner cylinder location on the heat transfer and fluid flow. The location of inner circular cylinder ($\delta$) is changed vertically along the center-line of square enclosure. The natural convection bifurcates from unsteady to steady state according to $\delta$. Two critical positions of ${\delta}_{C,L}$ and ${\delta}_{C,U}$ as a lower bound and an upper bound are ${\delta}_{C,L}=0.05$ and ${\delta}_{C,U}=0.18$, respectively. Within the defined bounds, the thermal and flow fields are steady state. When the inner cylinder locates at ${\delta}{\geq}{\delta}_{C,U}$, the space between the upper surface of inner cylinder and the top surface of the enclosure forms a relatively shallow layer where the natural convection characterized as the pure Rayleigh-Benard convection forms alternately the upwelling and downwelling plums, as a result that a series of cells known as Benard cells is derived.

• Geomechanics and Engineering
• /
• 제38권4호
• /
• pp.367-380
• /
• 2024

In this study, a prediction model for the cutting force evolution in brittle rocks was developed. This model is based on indentation tests using a conical pick at a cutting depth of 9 mm. The behavior of the indentation mechanism was analyzed in three phases by using Evans' cutting mode. The peak values in the force history identified these phases. The variation in the local strength of the rock caused a large offset in the model prediction of chipping. Regression analyses showed that there is a strong power relationship between the upper bound of the cutting force along with chipping and depth of cut. The slope of the three crushing phases has been found to increase sequentially (α₁<α₂<α₃). In addition, a positive correlation existed between the Schmidt hardness and brittleness index that affects the lower and upper bounds of chipping. Consequently, the results clearly demonstrate that the new model can reasonably predict the evolution of the cutting force based on experimental data. These results would be beneficial for engineers to design and select the optimum excavation machine to reduce mechanical vibration and enhance cutting efficiency.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1805-1810
• /
• 1991

This paper derives the upper and the lower bound of the mean cycle time and the mean service time of the class 6 and the class 4, within which the minimum utilization constrain of the class 4 is guaranteed. Also, derived are conditions under which the token bus network is stable or unstable. These bounds and stable conditions are represented in terms of the high priority token hold time, the token rotation time and the arrival rate and the total station number etc. This paper suggest a parameter tuning algorithm in a partially symmetric token bus network with two classes, which maximizes the token rotation time for a suitable high priority token hold time and at the same time meets the stability condition of the network, the real time constraint and the minimum utilization constraint of the class 4.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권2호
• /
• pp.830-842
• /
• 2015

Trust and trustworthiness of web services and organizations is calculated as scalar values. But there is still a certain level of risk for the overall reliability of this value. In this article, we focus on calculating trust values as intervals between upper and lower bounds based on predefined confidence values through an additional confidence probability. This will give us a more realistic approach to the trust assessments between individuals and organizations. We also developed a web-based software tool, TAST (Trust Assessment Software Tool) that collects the web services' evaluation of different customer groups for similar organizations through the user interface and calculates the trust intervals for predefined and previously selected confidence values. Our model uses a weighted calculation of mean and variances of customer groups in specific periods and analyses the total and incremental trust of different customer groups.

• 대한수학회지
• /
• 제57권6호
• /
• pp.1407-1433
• /
• 2020

Parts I-IV showed that the number of ways to place q nonattacking queens or similar chess pieces on an n × n chessboard is a quasipolynomial function of n whose coefficients are essentially polynomials in q. For partial queens, which have a subset of the queen's moves, we proved complete formulas for these counting quasipolynomials for small numbers of pieces and other formulas for high-order coefficients of the general counting quasipolynomials. We found some upper and lower bounds for the periods of those quasipolynomials by calculating explicit denominators of vertices of the inside-out polytope. Here we discover more about the counting quasipolynomials for partial queens, both familiar and strange, and the nightrider and its subpieces, and we compare our results to the empirical formulas found by Kotššovec. We prove some of Kotššovec's formulas and conjectures about the quasipolynomials and their high-order coefficients, and in some instances go beyond them.