• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.12
• /
• pp.584-590
• /
• 2001

This paper presents a windows program package for solving security constrained OPF in interconnected Power systems, which is based on the combined application of evolutionary programming(EP) and sequential quadratic programming(SQP). The objective functions are the minimization of generation fuel costs and system power losses. The control variables are the active power of the generating units, the voltage magnitude of the generator, transformer tap settings and SYC setting. The state variables are the bus voltage magnitude, the reactive power of the generating unit, line flows and the tie line flow In OPF considering security, the outages are selected by contingency ranking method. The resulting optimal operating point has to be feasible after outages such as any single line outage(respect of voltage magnitude, reactive power generation and power flow limits). The OPF package proposed is applied to IEEE 14 buses and 10 machines 39 buses model system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.8
• /
• pp.656-661
• /
• 2013

In Guided Scrambling (GS) encoding for the holographic storage, after scrambling augmented source word into codeword, the best codeword satisfying modulation constraint is determined. Modulation constraints considered in this paper are strength which is the minimum number of transition between '0' and '1' in each row and column of codeword array and the symbol balancedness of codeword array. In this paper, we show that GS encoding procedure can be formulated as an integer programming model and develop a fast neighborhood search heuristic for fast computation of control bits. In the simulation, we compared the performance of heuristic algorithm with the integer programming model for various array and control bit size combinations.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3113-3118
• /
• 2000

A framework proposed in this paper includes representations of multi-objectives rule-basd constraint satisfaction problem(RCSP) and especially, flexible structure of RCSP which provides adequate solution sithin an expectation time and adaptively considers some change of constratraints on the RCSP. In this study, the power system implemented by above framework is entirely programmed by using a modeling system for the quantitative model and a rule-based constraint programming tool for the qualitative model. The results of an exemplary cse show how the structure that involves the problem representation gives the scheduler an effective decision and what are the advantages of the easy and diverse representation for considering the techmical characteristics of the units on the RCSP over the traditional problem.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.25 no.4
• /
• pp.40-45
• /
• 2002

An AS/RS construction cost minimization model under throughput rate requirement constraint has been developed, whose objective function includes S/R machine cost, storage rack cost, and interrace conveyor cost. S/R machine cost is a function of the storage rack height, the unit load weight, and the control logic used by the system, while storage rack cost is a function of the storage rack height, the weight and the volume of the unit load. Since the model is a nonlinear integer programming problem which is very hard to solve exactly with large problem size, a solution procedure is developed to determine the height and the length of the storage rack with a fixed number of S/R machines, while increasing the number of S/R machines one by one to meet the throughput rate requirement.

• Journal of the military operations research society of Korea
• /
• v.26 no.2
• /
• pp.143-158
• /
• 2000

This paper deals with the problem of redundancy allocation for the mixed reliability system in an optimal way. Two kinds of the reliability system are considered for optimal allocation of parallel redundancy. The problem is approached as the optimization problems using th standard method of dynamic programming(DP). The algorithm for solving the optimal redundancy allocation is proposed and then the DP algorithm is applied to two numerical examples such as maximization of reliability subject to an allowable cost-constraint and minimization of the total cost subject to the specified minimum reliability-constraint. A consequence of this study is that the developed computer program package can be applied to the optimal redundancy allocation for the mixed reliability system.

• Journal of the Korea Society for Simulation
• /
• v.9 no.4
• /
• pp.41-50
• /
• 2000

We have many simulation constraints to meet as a modeled system becomes large and complex. Real-time simulations are the examples in that they are constrained by certain non-function constraints (e.g., timing constraints). In this paper, an enhanced hierarchical modeling methodology is proposed to efficiently deal with constraint-simulations. The proposed modeling method enhances hierarchical modeling methods to provide multi-resolution model. A simulation model is composed by determining the optimal level of abstraction that is guaranteed to meet the given simulation constraints. Four modeling activities are defined in the proposed method: 1) Perform the logical architectural design activity to produce a multi-resolution model, 2) Organize abstraction information of the multi-resolution model with AT (Abstraction Tree) structure, 3) Formulate the given constraints based on U (Integer Programming) approach and embrace the constraints to AT, and 4) Compose a model based on the determined level of abstraction with which the multi-resolution model can satisfy all given simulation constraints. By systematically handling simulation constraints while minimizing the modeler's interventions, we provide an efficient modeling environment for constraint-simulations.

• Journal of the Korea Safety Management & Science
• /
• v.6 no.2
• /
• pp.141-154
• /
• 2004

The objective of this paper is to develop the efficient heuristic method for solving the minimum makespan problem of the job shop scheduling. The proposed heuristic method is based on a constraint satisfaction problem technique and a improved randomizing search algorithm. In this paper, ILOG programming libraries are used to embody the job shop model, and a constraint satisfaction problem technique is developed for this model to generate the initial solution. Then, a improved randomizing search algorithm is employed to overcome the increased search time of constrained satisfaction problem technique on the increased problem size and to find a improved solution. Computational experiments on well known MT and LA problem instances show that this approach yields better results than the other procedures.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.11
• /
• pp.29-38
• /
• 1997

As the trend of the automation is increasing, the usage of the programmable automation equipments like programmable controller(PC), numerical controller(NC), distributed control systems(DCS) and robot controller is greatly expanding in the area of the industrial equipments. But the development of the programing language for the programmable automatic equipment is rarely accomplished. In this paper, we propose design and implementation technique of the real-time mechanism control language by adding time constraint constructs and timing analysis constructs ot conditional statement and iteration statement of a programming language. Moreover, we made it possible to predict plausibility of time constraint constructs of a real time application program at compilation time and developing execution time analysiss technique.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.410-417
• /
• 2002

We consider the constraint based explicit routing problem in MPLS based IP Network. In this problem, we are given a set of traffic demands and a network with different link capacities. The problem is to assign the demand commodities to the paths in the network while minimizing the maximum link load ratio. We formulate this problem as an integer programming problem and propose an efficient column generation technique. To strengthen the formulation, we consider some valid inequalities. We also incorporate the column generation technique with variable fixing scheme Computational results show that the algorithm gives high quality solutions in a short execution time.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.1213-1216
• /
• 2005

In this paper, we suggested the integer linear programming (ILP) models that went through constraint scheduling to simple cycle operation during the delay time. The delayed scheduling can determine a schedule with a near-optimal number of control steps for given fixed hardware constraints. In this paper, the resource-constrained problem is addressed, for the DFG optimization for multiprocessor design problem, formulating ILP solution available to provide optimal solution. The results show that the scheduling method is able to find good quality schedules in reasonable time.