• 대한전기학회논문지:전력기술부문A
• /
• 제54권12호
• /
• pp.597-602
• /
• 2005

The introduction of competition in electricity market emphasizes the importance of sufficient transmission capacities to guarantee various electricity transactions. Therefore, when dispatch scheduling, transmission security constraints should be considered for the economic and stable electric power system operation. In this paper, we propose an optimal dispatch scheduling algorithm incorporating transmission security constraints. For solving these constraints, the dispatch scheduling problem is decomposed into a master problem to calculate a general optimal power flow (OPF) without transmission security constraints and several subproblems to inspect the feasibility of OPF solution under various transmission line contingencies. If a dispatch schedule given by the master problem violates transmission security constraints, then an additional constraint is imposed to the master problem. Through these iteration processes between the master problem and subproblems, an optimal dispatch schedule reflecting the post-contingency rescheduling is derived. Moreover, since interruptible loads can positively participate as generators in the competitive electricity market, we consider these interruptible loads active control variables. Numerical example demonstrates efficiency of the proposed algorithm.

• 한국컴퓨터정보학회논문지
• /
• 제22권9호
• /
• pp.9-16
• /
• 2017

The course timetabling problem is a problem assigning a set of subjects to the given classrooms and different timeslots, while satisfying various hard constraints and soft constraints. This problem is defined as a constraint satisfaction optimization problem and is known as an NP-complete problem. Various methods has been proposed such as integer programming, constraint programming and local search methods to solve a variety of course timetabling problems. In this paper, we propose an iterative improvement search method to solve the problem based on constraint programming. First, an initial solution satisfying all the hard constraints is obtained by constraint programming, and then the solution is repeatedly improved using constraint programming again by adding new constraints to improve the quality of the soft constraints. Through experimental results, we confirmed that the proposed method can find far better solutions in a shorter time than the manual method.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.187-190
• /
• 2003

Many manufacturing companies consider the integrated and concurrent scheduling because they need the global optimization technology that could manufacture various products more responsive to customer needs. In this paper, we propose an advanced scheduling model to generate the schedules considering resource constraints and precedence constraints in make-to-order (MTO) manufacturing environments. Precedence of work- in-process(WIP) and resources constraints have recently emerged as one of the main constraints in advanced scheduling problems. The advanced scheduling problems is formulated as a multiobjective mathematical model for generating operation schedules which are obeyed resources constraints, alternative workstations of operations and the precedence constraints of WIP in MTO manufacturing. For effectively solving the advanced scheduling problem, the multi-objective hybrid genetic algorithm (m-hGA) is proposed in this paper. The m-hGA is to minimize the makespan, total flow time of order, and maximum tardiness for each order, simultaneously. The m-hGA approach with local search-based mutation through swap mutation is developed to solve the advanced scheduling problem. Numerical example is tested and presented for advanced scheduling problems with various orders to describe the performance of the proposed m-hGA.

• 대한안전경영과학회지
• /
• 제7권1호
• /
• pp.159-166
• /
• 2005

It is not difficult to see the road repairing. There are many and various machines which crush road surface. The efficiency and power of the machine depend on crushing head-shape, crushing interval, crushing load, crushing stress, machine's dropping height and roller's kind. The objective of this study is to select the optimal model among ten models of crushing machine with constraints such as crushing depth, variation, and crushed particle size. And then this paper provides the valid theoretical base on selected model. The data for this study are chosen from the site of construction in Kangnung during three months (2004. 6. 1${\~}$2004. 8. 31). The provided methodology in this paper will be fruitful not only for the selection of crushing machine but also for the aspects of construction period, cost, work efficacy according to the condition from the various sites of construction.

• 전자공학회논문지A
• /
• 제31A권2호
• /
• pp.94-103
• /
• 1994

In testing for practical scan disigned logic circuits, there may exist logic value constraints on some part of primary inputs due to various requirements on design and test. This paper presents a logic value system called taboo logic values which targets the test pattern generation of logic circuits under logic value constraints. The taboo logic system represents the logic value constraints and identifies additional logic value constraints through the implication of the tqaboo logic values using a taboo logic calculus. Those identified logic value constraints will guide the search during the test pattern generation of avoid the unfruitful searches and to identify redundant faults due to the logic value constraints very quickly. Finally, experimental results on ISCAS85 benchmark circuits will demonstrate the efficiency of the taboo logic values.

• 대한조선학회논문집
• /
• 제28권2호
• /
• pp.187-194
• /
• 1991

양단이 병진 및 회전에 대해 탄성구속되고 다양한 중간구속조건 즉, 임의 갯수의 집중질량, 병진 스프링, 회전스프링 구속이 있는 보-기둥의 진동에 대해 우선 Hamilton 원리, Laplace 변환방법을 원용한 엄밀해법을 제시했다. 그러나 이 방법이 중간구속조건이 여러 개 있을 경우 그 연산과정이 매우 복잡함을 고려하여 기준계 즉, 중간구속 조건이 없는 계의 고유함수를 이용하는 Rayleigh-Ritz 방법에 의한 근사해법도 검토했다. 근자에 발표된 타연구 결과와의 비교검토목적의 다양한 수치계산예를 통해, 첫째 본 연구의 엄밀해의 타당성이 확인되었고, 또 기준계의 고유함수를 이용하는 Rayleight Ritz방법이 중간구속조건의 다양한 변화에 대해 동일함수를 이용하는 장점과 더불어 진동파형가정함수의 항수에 따른 수렴성도 양호하며 좋은 정도를 보장하면서 편리하게 적용될 수 있음이 확인되었다.

• Journal of Information Technology Applications and Management
• /
• 제9권1호
• /
• pp.27-44
• /
• 2002

Performance evaluations of database algorithms are usually conducted on a set of queries for a given test database. For more detailed evaluation results, it is often necessary to use different query workloads several times. Each query workload should reflect the querying patterns of the application domain in real world, which are non-uniform in the usage frequencies of attributes in queries of the workload for a given database. It is not trivial to generate many different query workloads manually, while considering non-uniform distributions of attributes'usage frequencies. In this paper we propose a technique to generate non-uniform distributions, which will help construct query workloads more efficiently. The proposed algorithm generates a query-attribute usage distribution based on given constraints on usage frequencies of attributes and qreries. The algorithm first allocates as many attributes to queries as Possible. Then it corrects the distribution by considering attributes and queries which are not within the given frequency constraints. We have implemented and tested the performance of the proposed algorithm, and found that the algorithm works well for various input constraints. The result of this work could be extended to help automatically generate SQL queries for various database performance benchmarking.

• 로봇학회논문지
• /
• 제10권3호
• /
• pp.133-138
• /
• 2015

This paper presents a modified task structure of coupled-constraints consensus based bundle algorithm especially to resolve the cooperative transportation problem. The cooperative transportation mission has various types of constraints. A modified framework to generate activities and subtasks to solve time and task constraints of the transportation mission by using coupled-constraints consensus based bundle algorithm is suggested. In this paper modifications on task structure, reward function and arrival time calculation are suggested to handle the constraints of cooperative transportation mission.

• 한국해양공학회:학술대회논문집
• /
• 한국해양공학회 2004년도 학술대회지
• /
• pp.40-44
• /
• 2004

A fact that limits a company's ability to achieve more of its goal is referred to as a 'constraint' shipbuilding industries need to identify and manage constraints. The theory of constraints is evolved out of the problems of bottleneck formation. This happens and is conserved for the formulation if various real time problems for arriving standard uniquely addressed problems If, for example, the goal of a shipbuilding industry is to make money now and in the future, it is suggested that TOC will enable th mangers of the company to do so. TOC, focuses the organization scare resources on improving the performance of the true constraints, and therefore the bottom line of the organization. An attempt is made for the implantation of the theory into real world shipyard decision support mechanism.

• 한국안전학회지
• /
• 제30권3호
• /
• pp.32-37
• /
• 2015

In the fields of plant layout optimization, the main goal is to minimize the construction cost including pipelines as satisfying all constraints such as safety and operating issues. However, what is the lacking of considerations in previous researches is to consider proper safety and maintenance spaces for a complex plant. Based on the mathematical programming, MILP(Mixed Integer Linear Programming) problems including various constraints can be formulated to find the optimal solution which is to achieve the best economic benefits. The objective function of this problem is the sum of piping cost, pumping cost and area cost. In general, many conventional optimization solvers are used to find a MILP problem. However, it is really hard to solve this problem due to complex inequality and equality constraints, since it is impossible to use the derivatives of objective functions and constraints. To resolve this problem, the PSO (Particle Swarm Optimization), which is one of the representative sampling approaches and does not need to use derivatives of equations, is employed to find the optimal solution considering various complex constraints in this study. The EO (Ethylene Oxide) plant is tested to verify the efficacy of the proposed method.