• Title/Summary/Keyword: Two-stage optimization

Search Result 264, Processing Time 0.026 seconds

Optimization of Fed-Batch Fermentation for Production of Poly-$\beta$-Hydroxybutyrate in Alcaligenes eutrophus

  • Lee, In-Young;Choi, Eun-Soo;Kim, Guk-Jin;Nam, Soo-Wan;Shin, Yong-Cheol;Chang, Ho-Nam;Park, Young-Hoon
    • Journal of Microbiology and Biotechnology
    • /
    • v.4 no.2
    • /
    • pp.146-150
    • /
    • 1994
  • Production of poly-$\beta$-hydroxybutyrate (PHB) in fed-batch fermentation was studied. Utilization of carbon for PHB biosynthesis was investigated by using feeding solutions with different ratios of carbon to nitrogen (C/N). It was observed that at a high C/N ratio carbon source was more preferably utilized for PHB accumulation while its consumption for cellular metabolism appeared to be more favored at a low C/N value. A high cell concentration (184 g/l) was achieved when ammonium hydroxide solution was fed to control the pH, which was also utilized as the sole nitrogen source. For the mass production of PHB, two-stage fed-batch operations were carried out where PHB accumulation was observed to be stimulated by switching the ammonium feeding mode to the nitrogen limiting condition. A large amount of PHB (108 g/l) was obtained with cellular content of 80% within 50 hrs of operation.

  • PDF

A Study on the Optimization Method using the Genetic Algorithm with Sensitivity Analysis (민감도가 고려된 알고리듬을 이용한 최적화 방법에 관한 연구)

  • Lee, Jae-Gwan;Sin, Hyo-Cheol
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.24 no.6 s.177
    • /
    • pp.1529-1539
    • /
    • 2000
  • A newly developed optimization method which uses the genetic algorithm combined with the sensitivity analysis is presented in this paper. The genetic algorithm is a probabilistic method, searching the optimum at several points simultaneously, requiring only the values of the object and constraint functions. It has therefore more chances to find global solution and can be applied various problems. Nevertheless, it has such shortcomings that even it approaches the optimum rapidly in the early stage, it slows down afterward and it can't consider the constraints explicitly. It is only because it can't search the local area near the current points. The traditional method, on the other hand, using sensitivity analysis is of great advantage in searching the near optimum. Thus the combination of the two techniques makes use of the individual advantages, that is, the superiority both in global searching by the genetic algorithm and in local searching by the sensitivity analysis. Application of the method to the several test functions verifies that the method suggested is very efficient and powerful to find the global solutions, and that the constraints can be considered properly.

Structural damage detection based on residual force vector and imperialist competitive algorithm

  • Ding, Z.H.;Yao, R.Z.;Huang, J.L.;Huang, M.;Lu, Z.R.
    • Structural Engineering and Mechanics
    • /
    • v.62 no.6
    • /
    • pp.709-717
    • /
    • 2017
  • This paper develops a two-stage method for structural damage identification by using modal data. First, the Residual Force Vector (RFV) is introduced to detect any potentially damaged elements of structures. Second, data of the frequency domain are used to build up the objective function, and then the Imperialist Competitive Algorithm (ICA) is utilized to estimate damaged extents. ICA is a heuristic algorithm with simple structure, which is easy to be implemented and it is effective to deal with high-dimension nonlinear optimization problem. The advantages of this present method are: (1) Calculation complexity can be decreased greatly after eliminating many intact elements in the first step. (2) Robustness, ICA ensures the robustness of the proposed method. Various damaged cases and different structures are investigated in numerical simulations. From these results, anyone can point out that the present algorithm is effective and robust for structural damage identification and is also better than many other heuristic algorithms.

Design Optimization of Centrifugal Pumps (원심 펌프의 최적 설계)

  • Oh, Hyoung Woo;Chung, Myung Kyoon;Kim, Sang Chul;Yang, Keun Yung;Ha, Jin Soo
    • Transactions of the Korean Society of Mechanical Engineers B
    • /
    • v.23 no.2
    • /
    • pp.254-261
    • /
    • 1999
  • An optimal design code for centrifugal pumps has been developed to determine geometric and fluid dynamic variables under appropriate design constraints. The optimization problem has been formulated with a nonlinear objective function to minimize one, two or all of the fluid dynamic losses, the net positive suction head required and the product price of a pump stage depending on the weighting factors selected as the design compromise. The optimal solution Is obtained by means of the Hooke and Jeeves direct search method. The performance analysis Is based on the mean streamline analysis using the present state-of-the-art loss correlations. The optimized efficiency and design variables of centrifugal pumps are presented in this paper as a function of non-dimensional specific speed in the range, $0.5{\leq}N$, ${\leq}1.3$. The diagrams presented herein can be used efficiently in the preliminary design phase of centrifugal pumps.

Economic Analysis of Snow Damage on Sugi (Cryptomeria japonica) Forest Stands in Japan Within the Forest Stand Optimization Framework

  • Yoshimoto, Atsushi;Kato, Akio;Yanagihara, Hirokazu
    • Journal of Forest and Environmental Science
    • /
    • v.24 no.3
    • /
    • pp.143-149
    • /
    • 2008
  • We conduct economic analysis of the snow damage on sugi (Cryptomeria japonica) forest stands in Toyama Prefecture, Japan. We utilize a single tree and distant independent growth simulator called "Silv-Forest." With this growth simulator, we developed an optimization model by dynamic programming, called DP-Silv (Dynamic Programming Silv-Forest). The MS-PATH (multiple stage projection alternative technique) algorithm was embedded as a searching algorithm of dynamic programming. The height / DBH ratio was used to constrain the thinning regime for snow damage protection. The optimal rotation age turned out to be 65 years for the non-restricted case, while it was 50 years for the restricted case. The difference in NPV of these two cases as the induced costs ranged from 179,867 to 1,910,713yen/ha over the rotation age of 20 to 75 years. Under the optimal rotation of 65 years, the cost became 914,226 yen/ha. The estimated annual payment based on the difference in NPV, was from 9,869 yen/ha/yr to 85,900 yen/ha/yr. All in all, 10,000 yen/ha/yr to 20,000 yen/ha/yr seems to cover the payment from the rotation age of 35 to 75 years.

  • PDF

Optimization of Switching Time from Growth to Product Formation for Maximum Productivity of Recombinant Escherichia coli Fermentation (유전자 재조합 대장균 발효의 최대 생산성을 위한 생육에서 제품 생성으로 전환시기의 최적화)

  • Anant Y. Patkar
    • Microbiology and Biotechnology Letters
    • /
    • v.18 no.4
    • /
    • pp.394-400
    • /
    • 1990
  • Maximization of productivity of recombinant cell fermentations requires consideration of the inverse relationship between the host cell growth rate and product formation rate. The problem of maximizing a weighted performance index was solved by using optimal control theory for recombinant E. coli fermentation. Concentration of a growth inhibitor was used as a control variable to manipulate the specific growth rate, and consequently the cloned-gene expression rate. Using a simple unstructured model to describe the main characteristics of this system, theoretical analysis showed that the optimal control profile results in an initial high growth rate phase followed by a low growth rate and high product formation rate phase. Numerical calculations were done to determine optimal switching times from the growth to the production stage for two representative cases corresponding to different dependency of the product formation rate on the growth rate. For the case when product formation rate is sensitive to the specific growth rate, the optimized operation yields about 60% increase in the final product concentration compared with a simple batch fermentation.

  • PDF

Relaying Protocols and Delay Analysis for Buffer-aided Wireless Powered Cooperative Communication Networks

  • Zhan, Jun;Tang, Xiaohu;Chen, Qingchun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.8
    • /
    • pp.3542-3566
    • /
    • 2018
  • In this paper, we investigate a buffer-aided wireless powered cooperative communication network (WPCCN), in which the source and relay harvest the energy from a dedicated power beacon via wireless energy transfer, then the source transmits the data to the destination through the relay. Both the source and relay are equipped with an energy buffer to store the harvested energy in the energy transfer stage. In addition, the relay is equipped with a data buffer and can temporarily store the received information. Considering the buffer-aided WPCCN, we propose two buffer-aided relaying protocols, which named as the buffer-aided harvest-then-transmit (HtT) protocol and the buffer-aided joint mode selection and power allocation (JMSPA) protocol, respectively. For the buffer-aided HtT protocol, the time-averaged achievable rate is obtained in closed form. For the buffer-aided JMSPA protocol, the optimal adaptive mode selection scheme and power allocation scheme, which jointly maximize the time-averaged throughput of system, are obtained by employing the Lyapunov optimization theory. Furthermore, we drive the theoretical bounds on the time-averaged achievable rate and time-averaged delay, then present the throughput-delay tradeoff achieved by the joint JMSPA protocol. Simulation results validate the throughput performance gain of the proposed buffer-aided relaying protocols and verify the theoretical analysis.

Low-Complexity Energy Efficient Base Station Cooperation Mechanism in LTE Networks

  • Yu, Peng;Feng, Lei;Li, Zifan;Li, Wenjing;Qiu, Xuesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.10
    • /
    • pp.3921-3944
    • /
    • 2015
  • Currently Energy-Saving (ES) methods in cellular networks could be improved, as compensation method for irregular Base Station (BS) deployment is not effective, most regional ES algorithm is complex, and performance decline caused by ES action is not evaluated well. To resolve above issues, a low-complexity energy efficient BS cooperation mechanism for Long Time Evolution (LTE) networks is proposed. The mechanism firstly models the ES optimization problem with coverage, resource, power and Quality of Service (QoS) constraints. To resolve the problem with low complexity, it is decomposed into two sub-problems: BS Mode Determination (BMD) problem and User Association Optimization (UAO) problem. To resolve BMD, regional dynamic multi-stage algorithms with BS cooperation pair taking account of load and geographic topology is analyzed. And then a distributed heuristic algorithm guaranteeing user QoS is adopted to resolve UAO. The mechanism is simulated under four LTE scenarios. Comparing to other algorithms, results show that the mechanism can obtain better energy efficiency with acceptable coverage, throughput, and QoS performance.

Impact of Revenue Sharing Contract on the Performance of Vendor

  • Chungsuk RYU
    • The Journal of Industrial Distribution & Business
    • /
    • v.14 no.9
    • /
    • pp.21-30
    • /
    • 2023
  • Purpose: Focusing on the role of the special contract to collaborate the supply chain operations, this study investigates how the revenue sharing contract affects the performance of Vendor Managed Inventory (VMI). Research design, data, and methodology: The optimization model is formulated to represent two stage supply chain system where the supplier and retailer manage the operations to maximize their own profits. Three supply chain models including the traditional system, VMI, and VMI with revenue sharing contract are compared in the numerical examples. Results: According to the numerical analysis, the entire supply chain system has greater profit under VMI than the traditional system, while VMI alone sacrifices the supplier's profit. With the proper sets of revenue share ratio and wholesale price discount rate, VMI with revenue sharing contract results in the increased profit for both supplier and retailer compared with VMI alone as well as the traditional system. Conclusions: The numerical examples imply that VMI, when it is combined with the revenue sharing contract, can be the effective collaboration program that satisfies every supply chain member. To make VMI with revenue sharing contract to be fair to all supply chain members, they need to agree on the appropriate contract content.

Optimization of Soil-Nailing Designs Considering Three Failure Modes (쏘일네일링의 세 가지 파괴모드를 고려한 설계 최적화에 대한 연구)

  • Seo, Hyung-Joon;Lee, Gang-Hyun;Park, Jeong-Jun;Lee, In-Mo
    • Journal of the Korean Geotechnical Society
    • /
    • v.28 no.7
    • /
    • pp.5-16
    • /
    • 2012
  • Soil-nailing is the most popular method of reinforcing for slope stability. In general, two factors are considered as failure modes during the soil-nailing design stages: pullout failure mode and shear failure mode that will occur on the most probable failure plane. In many cases, however, shallow failure can also occur when the ground near the slope face is swept away by the horizontal stress release during the staged top-down excavation. In this paper, an optimized soil-nailing design methodology is proposed by considering the three failure modes mentioned above: pullout failure; shear failure; and shallow failure. The variables to be optimized include the bonded length and number of soil-nailings, and the confining pressure that should be applied at the slope face. The procedure to obtain the optimized design variables is as follows: at first, optimization of soil-nailings, i.e. bonded length and number, against pullout and shear failure modes; and then, optimization of confining pressure at each excavation stage that is needed to prevent shallow failure. Since the two processes are linked with each other, they are repeated until the optimized design variables can be obtained satisfying all the constrained design requirements in both of the two processes.