• Title/Summary/Keyword: Cost constraint

Search Result 499, Processing Time 0.026 seconds

Robust Optimization of a Resonant-type Micro-probe Using Gradient Index Based Robust Optimal Design Method (구배 지수에 근거한 강건 최적 설계 기법을 이용한 공진형 미소탐침의 강건 최적화)

  • Han, Jeong-Sam;Kwak, Byung-Man
    • Proceedings of the KSME Conference
    • /
    • 2003.04a
    • /
    • pp.1254-1261
    • /
    • 2003
  • In this paper we present a simple and efficient robust optimal design formulation and its application to a resonant-type micro probe. The basic idea is to use the Gradient Index (GI) to improve robustness of the objective and constraint functions. In the robust optimal design procedure, a deterministic optimization for performance of MEMS structures is followed by design sensitivity analysis with respect to uncertainties such as fabrication errors and change of operating conditions. During the process of deterministic optimization and sensitivity analysis, dominant performance and uncertain variables are identified to define GI. The GI is incorporated as a term of objective and constraint functions in the robust optimal design formulation to make both performance and robustness improved. While most previous approaches for robust optimal design require statistical information on design variations, the proposed GI based method needs no such information and therefore is cost-efficient and easily applicable to early design stages. For the micro probe example, robust optimums are obtained to satisfy the targets for the measurement sensitivity and they are compared in terms of robustness and production yield with the deterministic optimums through the Monte Carlo simulation.

  • PDF

Provisioning Quantity Determination of Consumable Concurrent Spare Part Under Availability Constraint and Cannibalization Allowed (운용가용도 제약하에서 동류전용이 허용될 때 소모성 동시조달부품의 적정구매량 결정)

  • Oh, Geun-Tae;Na, Yoon-Kyoon;Kim, Myung-Soo
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.33 no.3
    • /
    • pp.199-207
    • /
    • 2010
  • In this paper considered is the provisioning quantity determination problem of consumable concurrent spare parts (CSP) of a new equipment system to minimize the procurement cost under the operational availability constraint. When a part fails, repair of the failed part is impossible and the part is replaced and cannibalization is allowed. The failure of a part is assumed to follow a Poisson process and the operational availability in CSP is defined. The solution procedure consists of two parts. Firstly, a heuristic algorithm is developed under the assumption that the failure rate is constant during the CSP period. Secondly, proposed is a simulation search procedure which improves the heuristic solution to the near optimal solution in a reasonable amount of time. An illustrative example is shown to explain the solution procedure.

Tolerance Optimization of Design Variables in Lower Arm by Using Response Surface Model and Process Capability Index (반응표면모델과 공정능력지수를 적용한 로워암 설계변수의 공차최적화)

  • Lee, Kwang Ki;Ro, Yun Cheol;Han, Seung Ho
    • Korean Journal of Computational Design and Engineering
    • /
    • v.18 no.5
    • /
    • pp.359-366
    • /
    • 2013
  • In the lower arm design process, a tolerance optimization of the variance of design variables should be preceded before manufacturing process, since it is very cost-effective compared to a strict management of tolerance of products. In this study, a design of experiment (DOE) based on response surface model (RSM) was carried out to find optimized design variables of the lower arm, which can meet a given requirement of probability constraint for the process capability index (Cpk) of the weight and maximum stress. Then, the design space was explored by using the central composite design method, in which the 2nd order Taylor expansion was applied to predict a standard deviation of the responses. The optimal solutions satisfying the probability constraint of the Cpk were found by considering both of the mean value and the standard deviation of the design variables.

Development of Flight Model of Segmented Nut Type Holding and Release Mechanism Using Burn Wire Cutting Method for On-orbit Verification (열선절단형 분리너트식 구속분리장치의 궤도검증을 위한 비행모델 개발)

  • Lee, Myeong-Jae;Lee, Yong-Keun;Kang, Suk-Joo;Oh, Hyun-Ung
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2014.10a
    • /
    • pp.911-915
    • /
    • 2014
  • Pyrotechnic devices are widely used for space appendages. However, a cube satellite requirements do not permit the use of explosive pyrotechnic device. A nichrome burn wire release has typically been used for holding and release of deployable appendages of the cube satellite due to its simplicity and low cost. However, relatively low mechanical constraint force and system complexity for application of multi-deployable systems are disadvantages of the conventional mechanism. To overcome these drawbacks, we have developed a segmented nut type holding and release mechanism based on the nichrome burn wire release. The great advantages of the mechanism are much lower shock level and larger constraint force than the conventional mechanism using pyro. Flight model for on-orbit verification was developed and verified through release function test, vibration test and thermal vacuum test.

  • PDF

Development of CPLD Technology Mapping Algorithm Improving Run-Time under Time Constraint (시간제약 조건하에서 수행시간을 개선한 CPLD 기술 매핑 알고리즘 개발)

  • 윤충모;김희석
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.4
    • /
    • pp.15-24
    • /
    • 1999
  • In this paper, we propose a new CPLD technology mapping algorithm improving run-time under time constraint. In our technology mapping algorithm, a given logic equation is constructed as the DAG type, then the DAG is reconstructed by replicating the node that outdegree is more than or equal to 2. As a result. it makes delay time and the number of CLBs, run-time to be minimized. Also, after the number of multi-level is defined and cost of each nodes is calculated, the graph is partitioned in order to fit to k that is the number of OR term within CLB. The partitioned nodes are merged through collapsing and bin packing is performed in order to fit to the number of OR term within CLB.

  • PDF

Dynamic Survivable Routing for Shared Segment Protection

  • Tapolcai, Janos;Ho, Pin-Han
    • Journal of Communications and Networks
    • /
    • v.9 no.2
    • /
    • pp.198-209
    • /
    • 2007
  • This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

A study on Developmental and Constraint Factors of Sports Movie

  • MOON, Bo Ra;KIM, Hae Yu;SEO, Won Jae
    • Journal of Sport and Applied Science
    • /
    • v.5 no.2
    • /
    • pp.47-53
    • /
    • 2021
  • Purpose: The purpose of this study is to generate industrial insights for developing sports movie industry. Related studies are scare. Research design, data, and methodology: The study employed case study and selected typical case samples who seem informative about sport movie industry. The authors interviewed six experts who are experienced in sport movie and related academic sector. Interviews were audio-taped and the text were decoded by multiple reading. Through this process, the study categorized significant meanings and produced results. Interviewees reviewed again the final findings to confirm validity, which calls member check. Results: It was suggested that developmental factors of sports movie were the realization of realistic sports scenes by using technologies. Second, participants told that contents of sport movie need to reflect real stories and it should tell the stories. Regarding constraints of sport movies, movie producers feel difficulty to make scenes in that sports are inherently quickly performed. Another constraints are that production cost is expensive but audiences are barely attended. Conclusions: For promoting economic outcomes and developing sport movie industry, government needs to financially support related markets to support sport movie producers assisting them to concentrate their movie works. Future directions for related-studies were discussed.

Robust Transfer Alignment Method based on Krein Space (크레인 공간에 기반한 강인한 전달정렬 기법)

  • Sung-Hye Choe;Ki-Young Park;Hyoung-Min Kim;Cheol-Kwan Yang
    • Journal of Advanced Navigation Technology
    • /
    • v.25 no.6
    • /
    • pp.543-549
    • /
    • 2021
  • In this paper, a robust transfer alignment method is proposed for a strapdown inertial navigation system(SDINS) with norm-bounded parametric uncertainties. The uncertainties are described by the energy bound constraint, i.e., sum quadratic constraint(SQC). It is shown that the SQC can be coverted into an indefinite quadratic cost function in the Krein space. Krein space Kalman filter is designed by modifying the measurement matrix and the variance of measurement noises in the conventional Kalman filter. Since the proposed Krein space Kalman filter has the same recursive structure as a conventional Kalman filter, the proposed filter can easily be designed. The simulation results show that the proposed filter achieves robustness against measurement time delay and high dynamic environment of the vehicle.

Improvement for Facility Location Problem of Perishable Commodities (부패상품 임시물류센터에 대한 위치 문제 개선)

  • Lee, Sang-Un
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.3
    • /
    • pp.209-214
    • /
    • 2018
  • This paper suggests simple algorithm of facility location problem in perishable commodities that satisfy with minimum total transportation cost and within the transportation time constraint $L^*$. For this problem, Lee[4] suggests very complex algorithm that decides candidate facility locations, computes total transportation cost for each candidate facility location, then moving the location to optimal location for top two facilities. On the other hand, this paper simply determines the candidate facility locations within $L^*$ using subtree concept, and decides optimal minimal total transportation cost for top two locations in centralized area of required quantity using neighborhood concept.

Development of Water Supply System under Uncertainty

  • Chung, Gun-Hui;Kim, Tae-Woong;Kim, Joong-Hoon
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2009.05a
    • /
    • pp.2179-2183
    • /
    • 2009
  • As urbanization is progressed, the network for distributing water in a basin become complex due to the spatial expansion and parameter uncertainties of water supply systems. When a long range water supply plan is determined, the total construction and operation cost has to be evaluated with the system components and parameter uncertainties as many as possible. In this paper, the robust optimization approach of Bertsimas and Sim is applied in a hypothetical system to find a solution which remains feasible under the possible parameter uncertainties having the correlation effect between the uncertain coefficients. The system components to supply, treatment, and transport water are included in the developed water supply system and construction and expansion of the system is allowed for a long-range period. In this approach, the tradeoff between system robustness and total cost of the system is evaluated in terms of the degree of conservatism which can be converted to the probability of constraint violation. As a result, the degree of conservatism increases, the total cost is increased due to the installation of large capacity of treatment and transportation systems. The applied robust optimization technique can be used to determine a long-range water supply plan with the consideration of system failure.

  • PDF