• Proceedings of the KIEE Conference
• /
• 2003.07a
• /
• pp.649-651
• /
• 2003

In the framework of competitive electricity market, the Market Power due to the transmission congestion, lack of demand-side response, various uncertain factors etc. have been significant problem. This paper reviews the market rules of Korea power system and the uplift scheme for constrained on/off generators. Then, this paper points out several problems and the mitigation measures of local market power concerning the compensation for constrained-off generators.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.6
• /
• pp.2889-2909
• /
• 2017

Wireless sensor networks (WSNs) have attracted lots of attention in recent years due to their potential for various applications. In this paper, we seek how to efficiently deploy relay nodes into traditional static WSNs with constrained locations, aiming to satisfy specific requirements of the industry, such as average energy consumption and average network reliability. This constrained relay node deployment problem (CRNDP) is known as NP-hard optimization problem in the literature. We consider addressing this multi-objective (MO) optimization problem with an improved Artificial Bee Colony (ABC) algorithm with a linear local search (MOABCLLS), which is an extension of an improved ABC and applies two strategies of MO optimization. In order to verify the effectiveness of the MOABCLLS, two versions of MO ABC, two additional standard genetic algorithms, NSGA-II and SPEA2, and two different MO trajectory algorithms are included for comparison. We employ these metaheuristics on a test data set obtained from the literature. For an in-depth analysis of the behavior of the MOABCLLS compared to traditional methodologies, a statistical procedure is utilized to analyze the results. After studying the results, it is concluded that constrained relay node deployment using the MOABCLLS outperforms the performance of the other algorithms, based on two MO quality metrics: hypervolume and coverage of two sets.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.10 no.2
• /
• pp.161-167
• /
• 2000

In this paper, we propose a design method for BAMs(bidirectiona1 associative memories) which can perform the function of bidirectional association efficiently. Based on the theoretical investigation about the properties of BAMs, we first formulate the problem of finding a BAM that can store the given pattern pairs as stable states with high error correction ratio in the form of a constrained optimization problem. Next, we transform the constrained optimization problem into a GEVP(genera1ized eigenvalue problem), which can be solved by recently developed interior point methods. The applicability of the proposed method is illustrated via design examples.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.1
• /
• pp.1-9
• /
• 2011

This paper presents a new method that can solve the integrated problem of combined location routing and inventory problem (CLRIP) efficiently. The CLRIP is used to establish facilities from several candidate depots, to find the optimal set of vehicle routes, and to determine the inventory policy in order to minimize the total system cost. We propose a mathematical model for the CLRIP with budget constrained. Because this model is a nonpolynomial (NP) problem, we propose a endosymbiotic evolutionary algorithm (EEA) which is a kind of symbiotic evolutionary algorithm (SEA). The heuristic method is used to obtaining the initial solutions for the EEA. The experimental results show that EEA perform very well compared to the existing heuristic methods with considering inventory control decisions.

• Journal of Korean Institute of Industrial Engineers
• /
• v.31 no.1
• /
• pp.10-19
• /
• 2005

The minimum spanning tree (MST) problem is one of the traditional optimization problems. Unlike the MST, the degree constrained minimum spanning tree (DCMST) of a graph cannot, in general, be found using a polynomial time algorithm. So, finding the DCMST of a graph is a well-known NP-hard problem of importance in communications network design, road network design and other network-related problems. So, it seems to be natural to use evolutionary algorithms for solving DCMST. Especially, when applying an evolutionary algorithm to spanning tree problems, a representation and search operators should be considered simultaneously. This paper introduces a new tree representation scheme and a genetic operator for solving combinatorial tree problem using evolutionary algorithms. We performed empirical comparisons with other tree representations on several test instances and could confirm that the proposed method is superior to other tree representations. Even it is superior to edge set representation which is known as the best algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.3
• /
• pp.95-108
• /
• 2013

The problem of constrained sequencing of a set of jobs on a conveyor system with the objective of minimizing setup cost is investigated in this paper. A setup cost is associated with extra material, labor, or energy required due to the change of attributes in consecutive jobs at processing stations. A finite set of attributes is considered in this research. Sequencing is constrained by the availability of conveyor junctions. The problem is motivated by the paint purge reduction problem at a major U.S. automotive manufacturer. We first model a diverging junction with a sequence-independent setup cost and predefined attributes as an assignment problem and this model is then extended for a more general situation by relaxing the initial assumptions in various ways.

• Transactions on Control, Automation and Systems Engineering
• /
• v.2 no.4
• /
• pp.221-227
• /
• 2000

This paper combines the constrained model predictive control with the feedback linearization to solve a nonlinear system control problem with input constraints. The combined approach consists of two steps: Firstly, the nonlinear model is linearized by the feedback linearization. Secondly, based on the linearized model, the constrained model predictive controller is designed taking input constraints into consideration. The proposed controller is applied to two link robot system, and tracking performances of the controller are investigated via some simulations, where the comparisons are done for the cases of unconstrained, constrained input in feedback linearization.

• Communications for Statistical Applications and Methods
• /
• v.20 no.4
• /
• pp.321-327
• /
• 2013

Bayesian and empirical Bayesian methods have become quite popular in the theory and practice of statistics. However, the objective is to often produce an ensemble of parameter estimates as well as to produce the histogram of the estimates. For example, in insurance pricing, the accurate point estimates of risk for each group is necessary and also proper dispersion estimation should be considered. Well-known Bayes estimates (which is the posterior means under quadratic loss) are underdispersed as an estimate of the histogram of parameters. The adjustment of Bayes estimates to correct this problem is known as constrained Bayes estimators, which are matching the first two empirical moments. In this paper, we propose a way to apply the constrained Bayes estimators in insurance pricing, which is required to estimate accurately both location and dispersion. Also, the benefit of the constrained Bayes estimates will be discussed by analyzing real insurance accident data.

• Nonlinear Functional Analysis and Applications
• /
• v.26 no.4
• /
• pp.839-853
• /
• 2021

Let 𝕽ⁿ be an Euclidean space and g : 𝕽ⁿ → 𝕽ⁿ be a monotone and continuous mapping. Suppose the convex constrained nonlinear monotone equation problem x ∈ 𝕮 s.t g(x) = 0 has a solution. In this paper, we construct an inertial-type algorithm based on the three-term derivative-free projection method (TTMDY) for convex constrained monotone nonlinear equations. Under some standard assumptions, we establish its global convergence to a solution of the convex constrained nonlinear monotone equation. Furthermore, the proposed algorithm converges much faster than the existing non-inertial algorithm (TTMDY) for convex constrained monotone equations.

• Journal of Korean Institute of Industrial Engineers
• /
• v.10 no.1
• /
• pp.41-45
• /
• 1984

A resource constrained scheduling problem that involves trade-off between resources and time is considered. Models are considered. Models are presented as zero-one integer program and objectives of models include minimum project completion time and minimum total project cost.