• Food Science and Biotechnology
• /
• v.17 no.5
• /
• pp.904-911
• /
• 2008

Covalent cross-links between a number of proteins and peptides explain why transglutaminase may be widely used by food processing industries. The objective of this work was optimization of the fermentation process to produce transglutaminase from a new microbial source, the Streptomyces sp. P20. The strategy adopted to modify the usual literature media was: (1) fractional factorial design (FFD) to elucidate the key medium ingredients, (2) central composite design (CCD) to optimise the concentration of the key components. Optimization of the medium resulted in not only an 86% increase in microbial transglutaminase activity as compared to the media cited in the literature, but also a reduction in the production cost. Optimal fermentation conditions - namely temperature and agitation rate - were also studied, using CCD methodology. Usual conditions of $30^{\circ}C$ and 100 rpm were within the optimal area. All other parameters for enzyme production were experimentally proven to be optimum fermentation conditions.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.44 no.2
• /
• pp.36-42
• /
• 2021

This paper deals with a vehicle routing problem with resource repositioning (VRPRR) which is a variation of well-known vehicle routing problem with pickup and delivery (VRPPD). VRPRR in which static repositioning of public bikes is a representative case, can be defined as a multi-objective optimization problem aiming at minimizing both transportation cost and the amount of unmet demand. To obtain Pareto sets for the problem, famous multi-objective optimization algorithms such as Strength Pareto Evolutionary Algorithm 2 (SPEA2) can be applied. In addition, a linear combination of two objective functions with weights can be exploited to generate Pareto sets. By varying weight values in the combined single objective function, a set of solutions is created. Experiments accomplished with a standard benchmark problem sets show that Variable Neighborhood Search (VNS) applied to solve a number of single objective function outperforms SPEA2. All generated solutions from SPEA2 are completely dominated by a set of VNS solutions. It seems that local optimization technique inherent in VNS makes it possible to generate near optimal solutions for the single objective function. Also, it shows that trade-off between the number of solutions in Pareto set and the computation time should be considered to obtain good solutions effectively in case of linearly combined single objective function.

• Journal of the Korea Society for Simulation
• /
• v.22 no.4
• /
• pp.149-156
• /
• 2013

In this research, we dealt with an optimization problem which aims to minimize total cost of resources usage and network routing in a smart node environment. Toward this, we briefly introduced technology trends in smart nodes, methods in resource optimization fields, economic effects of smart network and content delivery (or distribution) network (CDN). Moreover, based on CDN we proposed and implemented a mathematical (mixed integer) programming model to combine replica placement and requests distribution problem (RPRDP) and routing problem. Computational result of an example on RPRDP+Routing problem is also provided.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.160-163
• /
• 2000

Due to the complexities of the real-world system, a water resource management program has to deal with various types of data. It appears that management personnel who has to use the program usually suffers from the technical burdens of handling large amount of data and understanding the optimization theory when they try to interpret the results. By combining the capabilities of database technology and modeling technique with optimization procedure we can develop a reliable decision supporting tool for multi-reservoir operation planning, which yields operating schedule for each dam in a river basin. We introduce two special data handling methodology for the real world application. First, by treating dams, hydro-electric power generating facilities and demand sites as separate database tables, the proposed data handling scheme can be applied to general water resource system in Korea. Second, by assigning variable names using predetermined key words, we can save searching time for identifying the moaning of the variables, so that we can quickly save the results of the optimization run to the database.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.11
• /
• pp.1891-1908
• /
• 2011

Cyber-physical systems (CPSs) are an emerging discipline that involves engineered computing and communicating systems interfacing the physical world. The widespread applications of CPSs still face enormous challenges because of the lack of theoretical foundations. In this technical survey, we review state-of-the-art design techniques from various angles. The aim of this work is to provide a better understanding of this emerging multidisciplinary methodology. The features of CPSs are described, and the research progress is analyzed using the following aspects: energy management, network security, data transmission and management, model-based design, control technique, and system resource allocation. We focus on CPS resource optimization, and propose a system performance optimization model with resource constraints. In addition, some classic applications (e.g., integrating intelligent road with unmanned vehicle) are provided to show that the prospects of CPSs are promising. Furthermore, research challenges and suggestions for future work are outlined in brief.

• Proceedings of the IEEK Conference
• /
• 2003.11a
• /
• pp.99-102
• /
• 2003

Computing environments of Embedded Systems are different from those of desktop computers so that they have resource constraints such as CPU processing, memory capacity, power, and etc.. Thus, when a desktop S/W is ported into embedded systems, optimization should be seriously considered. In this paper, we investigate several S/W optimization techniques to be considered for porting H.263 encoder into a high performance DSP, TMS320C6711. Through experiments, it is found that optimization techniques employed can make a big performance improvement.

• Journal of the military operations research society of Korea
• /
• v.35 no.3
• /
• pp.47-59
• /
• 2009

A hybrid Genetic Algorithm is applied to military resource allocation problem. Since military uses many resources in order to maximize its ability, optimization technique has been widely used for analysing resource allocation problem. However, most of the military resource allocation problems are too complicate to solve through the traditional operations research solution tools. Recent innovation in computer technology from the academy makes it possible to apply heuristic approach such as Genetic Algorithm(GA), Simulated Annealing(SA) and Tabu Search(TS) to combinatorial problems which were not addressed by previous operations research tools. In this study, a hybrid Genetic Algorithm which reinforces GA by applying local search algorithm is introduced in order to address military optimization problem. The computational result of hybrid Genetic Algorithm on Missile Interceptor Allocation problem demonstrates its efficiency by comparing its result with that of a simple Genetic Algorithm.

• International conference on construction engineering and project management
• /
• 2005.10a
• /
• pp.881-885
• /
• 2005

Scheduling repetitive projects under limitations on the amounts of available resources (labor and equipment) has been an active subject because of its practical relevance. Traditionally, the limitation is specified as a deterministic (fixed) number, such as 1000 labor-hours. The limitation, however, is often exposed to uncertainty and variability, especially when the project is lengthy. This paper presents a stochastic optimization model to treat the situations where the limitations of resources are expressed as probability functions in lieu of deterministic numbers. The proposed model transfers each deterministic resource constraint into a corresponding stochastic one and then solves the problem by the use of a chance-constrained programming technique. The solution is validated by comparison with simulation results to show that it can satisfy the resource constraints with a probability beyond the desired confidence level.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.5
• /
• pp.1638-1653
• /
• 2014

A sequential optimization algorithm (SOA) for resource allocation in a cyclic-prefixed single-carrier cognitive relay system is proposed in this study. Both subcarrier pairing (SP) and power allocation are performed subject to a primary user interference constraint to minimize the mean squared error of frequency-domain equalization at the secondary destination receiver. Under uniform power allocation at the secondary source and optimal power allocation at the secondary relay, the ordered SP is proven to be asymptotically optimal in maximizing the matched filter bound on the signal-to-interference-plus-noise ratio. SOA implements the ordered SP before power allocation optimization by decoupling the ordered SP from the power allocation. Simulation results show that SOA can optimize resource allocation efficiently by significantly reducing complexity.

• Journal of Communications and Networks
• /
• v.18 no.4
• /
• pp.629-638
• /
• 2016

In this paper, we investigate an energy-efficient resource allocation problem in a two-way relay (TWR) network consisting of multiple user pairs and an amplify-and-forward (AF) relay. As the users and relay have individual energy efficiencies (EE), we formulate a multi-objective optimization problem (MOOP). A single-objective optimization problem (SOOP) of the MOOP is introduced using a weighted-sum method, which achieves a single Pareto optimal point of the MOOP. To derive the algorithm for the SOOP, we propose a more tractable equivalent problem using the Karush-Kuhn-Tucker conditions of the SOOP, which guarantees convergence at the local optimal points. The proposed equivalent problem can be efficiently solved by the proposed iterative algorithm. Numerical results demonstrate the effectiveness of the proposed algorithm in achieving the optimal EE in multi-user AF TWR networks.