• 경영과학
• /
• 제15권1호
• /
• pp.77-85
• /
• 1998

In this paper a face optimization algorithm is developed for solving the problem (P) of optimizing a linear function over the set of efficient solutions of a multiple objective linear program. Since the efficient set is in general a nonconvex set, problem (P) can be classified as a global optimization problem. Perhaps due to its inherent difficulty, relatively few attempts have been made to solve problem (P) in spite of the potential benefits which can be obtained by solving problem (P). The algorithm for solving problem (P) is guaranteed to find an exact optimal or almost exact optimal solution for the problem in a finite number of iterations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권10호
• /
• pp.5013-5034
• /
• 2019

In the Peer-to-Peer (P2P) streaming systems, peers randomly form a network overlay to share video resources with a data scheduling scheme. A data scheduling scheme can have a great impact on system performance, which should achieve two optimal objectives at the same time ideally. The two optimization objectives are to improve the perceived video quality and maximize the network throughput, respectively. Maximizing network throughput means improving the utilization of peer's upload bandwidth. However, maximizing network throughput will result in a reduction in the perceived video quality, and vice versa. Therefore, to achieve the above two objects simultaneously, we proposed a new data scheduling scheme based on multi-objective particle swarm optimization data scheduling scheme, called MOPSO-DS scheme. To design the MOPSO-DS scheme, we first formulated the data scheduling optimization problem as a multi-objective optimization problem. Then, a multi-objective particle swarm optimization algorithm is proposed by encoding the neighbors of peers as the position vector of the particles. Through extensive simulations, we demonstrated the MOPSO-DS scheme could improve the system performance effectively.

• 환경생물
• /
• 제22권1호
• /
• pp.167-170
• /
• 2004

Phytopathogenic fungi들에 대해 매우 공격적인 Trichoderma hurzianum은 다른 곰팡이들의 세포벽 주성분인 chitin을 분해하는 extracellualr chitinase를 분비하기 때문에 매우 효율적인 biocontrol agent로 사용할 수 있다. Trichoderma harzianum의 생물학적 제어 기능을 이용하기 위하여 extracellualr chitinase의 생산성을 높일 수 있는 batch모드에서의 적정 환경을 찾는 일은 매우 복잡하다. 이러한 문제를 해결할 수 있는 방법이 바로 self-directing optimization이다 이 방법을 이용하여 실험한 결과 6∼7차례의 실험만으로 최적의 온도 혹은 pH 및 폭기율과 교반양을 구할 수 있었다. 그 결과 온도 $32^{\circ}C$, pH4.9, 폭기율 3.22 ι, 교반율 225 rpm에서 chitinase의 최대 생산량 16.825 U를 나타내었다. 이는 온도 $25^{\circ}C$, pH 5, 폭기율 1l, 교반율 150 rpm에서 나타난 chitinase 생산량 4.221 U에 비교하면 3.99배 증가한 효과를 나타내고 있다. 이로서 self-directing optimization방법을 통한 최적화 기술이 효소 생산 기술에 있어 그 최적화 과정을 단축시키고 최종 과정에 도달하는 새로운 기술로 적용할 수 있음을 알 수 있었다.

• Nonlinear Functional Analysis and Applications
• /
• 제26권1호
• /
• pp.65-70
• /
• 2021

We characterize the solution set for a second-order cone linear fractional optimization problem (P). We present sequential Lagrange multiplier characterizations of the solution set for the problem (P) in terms of sequential Lagrange multipliers of a known solution of (P).

• 한국인터넷방송통신학회논문지
• /
• 제15권5호
• /
• pp.155-162
• /
• 2015

본 논문은 운전금지영역을 가진 이차 볼록 발전비용 함수를 적용하는 경제급전의 최적화 문제에 대한 결정론적 최적화 알고리즘을 제안하였다. 제안된 알고리즘은 운전금지구역을 가진 발전기는 운전금지구역을 벗어나도록 분할하고, 초기치 $P_i{\leftarrow}P_i^{max}$에 대해 발전단가가 큰 순서대로 발전량을 감소시키고, $_{max}\{F(P_i)-F(P_i-{\beta})\}$ > $_{min}\{F(P_j+{\beta})-F(P_j)\}$, $i{\neq}j$, ${\beta}=1.0,0.1,0.01,0.001$에 대해 $P_i{\leftarrow}P_i-{\beta}$, $P_j{\leftarrow}P_j+{\beta}$의 교환 최적화 과정을 수행하였다. 제안된 방법을 15-발전기의 3가지 사례에 적용한 결과 간단하면서도 항상 동일한 결과로 휴리스틱 알고리즘들에 비해 최적의 결과를 나타내었다.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2010년도 추계학술대회 논문집
• /
• pp.631-632
• /
• 2010

• ETRI Journal
• /
• 제37권5호
• /
• pp.906-916
• /
• 2015

High-speed I/O channels require adaptive techniques to optimize the settings for filter tap weights at decision feedback equalization (DFE) read channels to compensate for channel inter-symbol interference (ISI) and crosstalk from multiple adjacent channels. Both ISI and crosstalk tend to vary with channel length, process, and temperature variations. Individually optimizing parameters such as those just mentioned leads to suboptimal solutions. We propose a joint optimization technique for crosstalk cancellation (XTC) at DFE to compensate for both ISI and XTC in high-speed I/O channels. The technique is used to compensate for between 15.7 dB and 19.7 dB of channel loss combined with a variety of crosstalk strengths from $60mV_{p-p}$ to $180mV_{p-p}$ adaptively, where the transmit non-return-to-zero signal amplitude is a constant $500mV_{p-p}$.

• 전기학회논문지P
• /
• 제54권2호
• /
• pp.61-66
• /
• 2005

This paper presents an unified method which solves real and reactive power dispatch problems for the economic operation of power systems using evolutionary computation such as genetic algorithms(GA), evolutionary programming(EP), and evolution strategy(ES). Many conventional methods to this problem have been proposed in the past, but most of these approaches have the common defect of being caught to a local minimum solution. The proposed methods, applied to the IEEE 30-bus system, were run for 10 other exogenous parameters and composed of P-optimization module and Q-optimization module. Each simulation result, by which evolutionary computations are compared and analyzed, shows the possibility of applications of evolutionary computation to large scale power systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권1호
• /
• pp.188-210
• /
• 2022

As a promising technique to support tremendous numbers of Internet of Things devices and a variety of applications efficiently, mobile edge computing (MEC) has attracted extensive studies recently. In this paper, we consider a MEC-assisted peer-to-peer (P2P) mobile communication system where MEC servers are deployed at access points to accelerate the communication process between mobile terminals. To capture the tradeoff between the time delay and the energy consumption of the system, a cost function is introduced to facilitate the optimization of the computation and communication resources. The formulated optimization problem is non-convex and is tackled by an iterative block coordinate descent algorithm that decouples the original optimization problem into two subproblems and alternately optimizes the computation and communication resources. Moreover, the MEC-assisted P2P communication system is compared with the conventional P2P communication system, then a condition is provided in closed-form expression when the MEC-assisted P2P communication system performs better. Simulation results show that the advantage of this system is enhanced when the computing capability of the receiver increases whereas it is reduced when the computing capability of the transmitter increases. In addition, the performance of this system is significantly improved when the signal-to-noise ratio of hop-1 exceeds that of hop-2.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1995년도 Proceedings of the Korea Automation Control Conference, 10th (KACC); Seoul, Korea; 23-25 Oct. 1995
• /
• pp.392-395
• /
• 1995

This paper presents a time efficient method for determining a sequence of locations of a mobile manipulator that facilitates tracking of continuous path in cluttered environment. Given the task trajectory in the form of octree data structure, the algorithm performs characterization of task space and subsequent multistage optimization process to determine task feasible locations of the robot. Firstly, the collision free portion of the trajectory is determined and classified according to uniqueness domains of the inverse kinematics solutions. Then by implementing the extent of task feasible subspace into an optimization criteria, a multistage optimization problem is formulated to determines the task feasible locations of the mobile manipulator. The effectiveness of the proposed method is shown through a simulation study performed for a 3-d.o.f. manipulator with generic kinematic structure.