• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• pp.103-111
• /
• 1994

An interactive and iterative design method based on the constraint satisfaction problem (CSP) technique was developed to generate an ergonomically sound layout of a control panel. This control panel layout method attempts to incorporate a variety of relevant ergonomic principles and design constraints, and generate an optimal or, at least, a "satisfactory" solution through iterative interactions with the designer. The existing panel design and layout methods are mostly based on the optimization of single objective function formulated to reflect and trade off all ergonomic design objectives which are largely different in their nature. In fact, the problem of seeking an ergonomically sound panel design should be viewed as a multiple objective optimization problem. Furthermore, most of the design objectives should be understood as constraints rather than objectives to be optimized. Hence, a constraint satisfaction approach is proposed in this study as a framework for the panel designer to search through the design decision space effectively and make various design decisions iteratively. In order to apply the constraint satisfaction approach to the panel design procedure, the ergonomic principles such as frequency-of-use, importance, functional grouping, and sequence-of-use are formalized as CSP terms. With this formalization, a prototype system was implemented and applied to panel layout problems. The results clearly showed the effectiveness of the proposed approach since it permits designers to consider and iteratively evaluate various design constraints and ergonomic principles, and, therefore, aids the panel designer to come up with an ergonomically sound control panel layout.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제17권11호
• /
• pp.3204-3217
• /
• 2023

In this paper, the downlink of the multicast based spatial modulation systems is investigated. Specifically, physical layer multicasting is introduced to increase the number of access users and to improve the communication rate of the spatial modulation system in which only single radio frequency chain is activated in each transmission. To minimize the bit error rate (BER) of the multicast based spatial modulation system, a joint optimizing algorithm of antenna selection and multicast precoding is proposed. Firstly, the joint optimization is transformed into a mixed-integer non-linear program based on single-stage reformulation. Then, a novel iterative algorithm based on the idea of branch and bound is proposed to obtain the quasioptimal solution. Furthermore, in order to balance the performance and time complexity, a low-complexity deflation algorithm based on the successive convex approximation is proposed which can obtain a sub-optimal solution. Finally, numerical results are showed that the convergence of our proposed iterative algorithm is between 10 and 15 iterations and the signal-to-noise-ratio (SNR) of the iterative algorithm is 1-2dB lower than the exhaustive search based algorithm under the same BER accuracy conditions.

• 한국경영과학회지
• /
• 제41권2호
• /
• pp.35-51
• /
• 2016

This paper proposes a new approximate approach to calculate the order fill rate and the probability of filling an entire customer order immediately from the shelf in a business environment under purchase dependence characterized by customer purchase patterns observed in such areas as marketing, manufacturing systems, and distribution systems. The new approximate approach divides customer orders into item orders and calculates fill rates of all order types to approximate the order fill rate. We develop a greed iterative search algorithm (GISA) based on the Gauss-Seidel method to avoid dimensionality and prevent the solution divergence for larger instances. Through the computational analysis that compares the GISA with the simulation, we demonstrate that the GISA is a dependable algorithm for deriving the stationary joint distribution of on-hand inventories in the type-K pure system. We also present some managerial insights.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.8-13
• /
• 2003

This paper considers a continuous-review two-echelon inventory control problem with one-to-one replenishment policy incorporated and with lost sales allowed where demand arrives In a stationary Poisson process The problem Is formulated using METRIC-approximation in a combined approach of pricing and (S-1.S) Inventory policy, for which an iterative solution algorithm is derived with respect to the corresponding one-warehouse multi-retailor supply chain. Specifically, decisions on retail pricing and warehouse inventory policies are made in integration to maximize total profit in the supply chain. The objective function of the model consists of sub-functions of revenue and cost (holding cost and penalty cost). To test the effectiveness and efficiency of the proposed algorithm, numerical experiments are performed The computational results show that the proposed algorithm is efficient and derives quite good decisions

• Earthquakes and Structures
• /
• 제8권3호
• /
• pp.639-663
• /
• 2015

Time history dynamic structural analysis is a time consuming procedure when used for large-scale structures or iterative analysis in structural optimization. This article proposes a new methodology for approximate prediction of extremum point of the response history via wavelets. The method changes original record into a reduced record, decreasing the computational time of the analysis. This reduced record can be utilized in iterative structural dynamic analysis of optimization and hence significantly reduces the overall computational effort. Design examples are included to demonstrate the capability and efficiency of the Reduced Record Method (RRM) when utilized in optimal design of frame structures using meta-heuristic algorithms.

• 정보관리학회지
• /
• 제32권1호
• /
• pp.7-22
• /
• 2015

이 논문은 시스템 성능을 최적화하기 위해 정적 및 동적 튜닝 방법을 이용한 웹 융합검색 연구의 내용을 보고합니다. 기존의 융합 방식을 넘어선 "다이나믹 튜닝"이라는 과정을 도입하여 웹의 다양한 정보소스의 기여를 최적화 시킬 수 있는 융합 공식을 생성하는 방법을 조사한 이 연구의 결과는 웹 검색 환경의 풍요로운 여러 데이터 소스를 활용하는 것이 효과적인 전략이라는 것을 보여주었습니다. 본 연구에서는 즉각적인 시스템 피드백 인지분석을 기반으로 융합 매개 변수를 미세 조정하는 반복적 인 다이나믹 튜닝 과정을 통해 크게 검색 성능을 향상시킬 수 있었습니다.

• 한국정보통신학회논문지
• /
• 제15권2호
• /
• pp.355-363
• /
• 2011

분산 비디오 부호화기법(DVC: Distributed Video Coding)의 성능을 개선하기 위한 한 가지의 방법으로서 보조정보에 대한 반복적인 보정기법에 대한 연구가 활발히 진행되고 있다. 기존의 대표적인 반복적인 보정기법으로서 복원 레벨과 보조정보 사이의 관계를 이용한 기법 또는, 움직임 벡터의 필터링에 기초한 보정기법이 제시하고 있으나 성능 개선은 제한적이다. 기존 방식들의 성능 제한을 극복하기 위해, 본 논문에서는, 먼저, 초기의 보조정보 생성 시에 블록별 비용을 측정하여 적응적 움직임 보상을 수행한다. 그리고 수신되는 비트 플레인 정보를 이용하여 블록별 적응적 예측 모드를 사용함으로써 비대칭적인 물체의 움직임 보상에 효과적인 반복적인 보정기법을 제안한다. 모의실험을 통하여 본 논문에서 제안된 보정기법을 사용함으로써 최대 0.2 dB이상의 성능을 개선함을 보인다.

• 전기전자학회논문지
• /
• 제22권4호
• /
• pp.999-1005
• /
• 2018

본 논문에서는 전력계통에서 정밀하고 변화에 수렴성이 빠른 탐색을 기반으로 하는 주파수 추정 기법을 제안하였다. 제안된 주파수 추정 알고리즘은 고분해능 스펙트럼의 기울기를 추정하여 스펙트럼의 peak 점을 탐색하는 구조를 적용하였다. 과도적으로 주파수 변화가 큰 경우에 기존 방법들의 단점인 수렴속도가 늦는 점을 보완 또는 개선하기 위한 방법으로 Context analysis를 통하여 Full-search 기법과 주파수 추정변수들을 적응적으로 적용하여 주파수 추정의 정밀도와 수렴속도를 향상시키고 대표적인 주파수 추정기법인 DFT(discrete Fourier transform) 방법, ECKF(extended complex Kalman filter), MV(minimum variable)방법들과 비교하여 수렴성과 정밀도가 우수함을 보였다.

• 한국경영과학회지
• /
• 제17권3호
• /
• pp.159-170
• /
• 1992

The size of time constaints is the critical bottleneck of the Crew Scheduling Problem (CSP). This paper deals with a method to extract the minimum required time constraints by k-shortest path algorithm. These time constraints are added as the "insurance constraints" to avoid the unnecessary tree search, which are very time-consuming procedures, for the integer solutions. The computational results show that the problem size in LP formulation could be reduced by our method.

• 한국국방경영분석학회지
• /
• 제7권2호
• /
• pp.63-99
• /
• 1981

The generalized goal decomposition model proposed by Ruefli as a single period decision model is presented for the purpose of a review and extended to make a multiple period planning model. The multiple period planning model in the three level organization is formulated with, linear goal deviations by introducing the goal programming method. Dynamic formulation using the generalized goal decomposition model for each single period problem is also presented. An iterative search algorithm is presented as an appropriate solution method of the dynamic formulation of the multiple period planning model.