• Journal of applied mathematics & informatics
• /
• 제19권1_2호
• /
• pp.215-229
• /
• 2005

In this paper, constraint aggregation is combined with the adjoint and multiple shooting strategies for optimal control of differential algebraic equations (DAE) systems. The approach retains the inherent parallelism of the conventional multiple shooting method, while also being much more efficient for large scale problems. Constraint aggregation is employed to reduce the number of nonlinear continuity constraints in each multiple shooting interval, and its derivatives are computed by the adjoint DAE solver DASPKADJOINT together with ADIFOR and TAMC, the automatic differentiation software for forward and reverse mode, respectively. Numerical experiments demonstrate the effectiveness of the approach.

• 대한지리학회지
• /
• 제46권2호
• /
• pp.197-211
• /
• 2011

공간 상호작용의 복잡성, 공간적 재현과 모델링의 필요성에 의해서 공간 상호작용 데이터의 합역이 불가피하다. 이러한 상황에서 본 연구의 목적은 공간 상호작용 데이터를 스케일을 달리하여 합역하거나 혹은 동일 스케일에서 합역 방식을 달리하여 합역하였을 때, 공간 상호작용 모델의 결과가 어떻게 달라지는지 평가하는 것이다. 공간 상호작용 데이터의 합역은 공간단위 수정가능성의 문제(Modifiable Areal Unit Problem: MAUP)를 야기한다. 공간 상호작용 데이터의 합역을 위하여 무작위로 구역 시드를 선정한 후 인접한 공간단위를 할당하는 방법, 구역 시드와 공간단위 사이의 연구 가중 거리를 최소화하는 방법, 구역 내 상호작용 비율을 최대화하는 방법, 구역 내 상호작용 비율을 최소화하는 방법을 사용하였다. MAUP의 영향을 평가하기 위한 공간 상호작용 모텔로 기원지-목적지 제약 포아송 회귀 모델을 이용하였다. 분석 결과는 모델 잔차의 공간적 특성뿐만 아니라 파라미터 추정값, 적합도 등이 MAUP의 영향을 받는다는 것을 보여주었다. 모델은 합역 방식 보다는 합역 수준에 더 민감하게 반응하였고, 모델에 대한 스케일 효과는 구획 방식에 따라 상이하게 나타났다.

• 대한전기학회논문지:전력기술부문A
• /
• 제50권9호
• /
• pp.424-430
• /
• 2001

A multi-level optimal power flow(OPF) algorithm has been evolved from a simple two stage optimal Power flow algorithm for constrained power economic dispatch control. In the proposed algorithm, we consider various constraints such as ower balance, generation capacity, transmission line capacity, transmission losses, security equality, and security inequality constraints. The proposed algorithm consists of four stages. At the first stage, we solve the aggregated problem that is the crude classical economic dispatch problem without considering transmission losses. An initial solution is obtained by the aggregation concept in which the solution satisfies the power balance equations and generation capacity constraints. Then, after load flow analysis, the transmission losses of an initial generation setting are matched by the slack bus generator that produces power with the cheapest cost. At the second stage we consider transmission losses. Formulation of the second stage becomes classical economic dispatch problem involving the transmission losses, which are distributed to all generators. Once a feasible solution is obtained from the second stage, transmission capacity and other violations are checked and corrected locally and quickly at the third stage. The fourth stage fine tunes the solution of the third stage to reach a real minimum. The proposed approach speeds up the two stage optimization method to an average gain of 2.99 for IEEE 30, 57, and 118 bus systems and EPRI Scenario systems A through D testings.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 C
• /
• pp.926-928
• /
• 1998

A fast optimization algorithm has been evolved from a simple two stage optimal power flow(OPF) algorithm for constrained power economic dispatch. In the proposed algorithm, we consider various constraints such as power balance, generation capacity, transmission line capacity, transmission losses, security equality, and security inequality constraints. The proposed algorithm consists of four stages. At the first stage, we solve the aggregated problem that is the crude classical economic dispatch problem without considering transmission losses. An initial solution is obtained by the aggregation concept in which the solution satisfies the power balance equations and generation capacity constraints. Then, after load flow analysis, the transmission losses of an initial generation setting are matched by the slack bus generator that produces power with the cheapest cost. At the second stage we consider transmission losses. Formulation of the second stage becomes classical economic dispatch problem involving the transmission losses, which are distributed to all generators. Once a feasible solution is obtained from the second stage, transmission capacity and other violations are checked and corrected locally and quickly at the third stage. The fourth stage fine tunes the solution of the third stage to reach a real minimum. The proposed approach speeds up the coupled LP based OPF method to an average gain of 53.13 for IEEE 30, 57, and 118 bus systems and EPRI Scenario systems A through D testings.

• Journal of Electrical Engineering and Technology
• /
• 제7권4호
• /
• pp.501-512
• /
• 2012

Social welfare maximization in a double-sided auction market is performed by implementing an aggregation-based particle swarm optimization (CAPSO) algorithm for optimal placement and sizing of one Static Synchronous Series Compensator (SSSC) device. Dallied simulation results (without/with line flow constraints and without/with SSSC) are generated to demonstrate the impact of SSSC on the congestion levels of the modified IEEE 14-bus test system. The proposed CAPSO algorithm employs conventional quadratic smooth and augmented quadratic nonsmooth generator cost curves with sine components to improve the accurate of the model by incorporating the valve loading effects. CAPSO also employs quadratic smooth consumer benefit functions. The proposed approach relies on particle swarm optimization to capture the near-optimal GenCos and DisCos, as well as the location and rating of SSSC while the Newton based load flow solution minimizes the mismatch equations. Simulation results of the proposed CAPSO algorithm are compared to solutions obtained by sequential quadratic programming (SQP) and a recently implemented Fuzzy based genetic algorithm (Fuzzy-GA). The main contributions are inclusion of customer benefit in the congestion management objective function, consideration of nonsmooth generator characteristics and the utilization of a coordinated aggregation-based PSO for locating/sizing of SSSC.

• 한국통신학회논문지
• /
• 제31권4B호
• /
• pp.303-310
• /
• 2006

센서 네트워크 환경에서 각 센서 노드는 크기의 제약으로 인해 적은 파워를 장비할 수밖에 없다. 그리고 센서 노드들이 컴퓨팅 능력까지 지니게 됨으로써 제한된 파워를 효율적으로 소비 하는 것이 중요하다. 센서 노드의 파워 소모는 데이터 연산에 비해 데이터 전송에 더 큰 영향을 받으므로 데이터 전송량을 최소화할 필요가 있다. 그리고 센서 네트워크는 근본적으로 높은 전송 에러율과 센서의 이동으로 인한 문제를 가진다. 따라서 본 논문에서는 센서 네트워크에서 신뢰성이 높고 데이터 전송량을 줄이기 위한 신뢰성 있는 데이터 병합 기법(RDAP)을 제안한다. RDAP는 라우팅 과정과 데이터 병합 쿼리 삽입 과정을 동시에 수행함으로써 각 라우팅 구간 사이의 네트워크 변화에 따른 비신뢰성을 보완하고, 데이터 병합 쿼리의 삽입 과정이 없음에도 주기적인 라우팅 과정을 수행함으로써 발생하는 불필요한 파워 소모를 줄인다. 또한, 본 논문에서는 센서 네트워크에서의 잦은 에러에 대한 대응 알고리즘을 제시한다.

• ETRI Journal
• /
• 제27권6호
• /
• pp.733-746
• /
• 2005

In the context of multi-protocol label switching (MPLS) traffic engineering, this paper proposes a scalable constraintbased shortest path first (CSPF) routing algorithm with multiple QoS metrics. This algorithm, called the multiple constraint-based shortest path first (M_CSPF) algorithm, provides an optimal route for setting up a label switched path (LSP) that meets bandwidth and end-to-end delay constraints. In order to maximize the LSP accommodation probability, we propose a link weight computation algorithm to assign the link weight while taking into account the future traffic load and link interference and adopting the concept of a critical link from the minimum interference routing algorithm. In addition, we propose a bounded order assignment algorithm (BOAA) that assigns the appropriate order to the node and link, taking into account the delay constraint and hop count. In particular, BOAA is designed to achieve fast LSP route computation by pruning any portion of the network topology that exceeds the end-to-end delay constraint in the process of traversing the network topology. To clarify the M_CSPF and the existing CSPF routing algorithms, this paper evaluates them from the perspectives of network resource utilization efficiency, end-to-end quality, LSP rejection probability, and LSP route computation performance under various network topologies and conditions.

• 한국철도학회논문집
• /
• 제9권1호
• /
• pp.50-56
• /
• 2006

This paper presents a mathematical model of the long-term track tamping scheduling problem in the Korean highspeed railway system. The presented model encompasses various operational field constraints, moreover improves a state-of-the-art model in extending the feasible space. We show the model is sized up to intractable scale, then propose another approximation model that is possible to handle with the present computer system and commercial optimization package, directly. The aggregated index, lot, is selected, considering the resolution of the planning horizon as well as scheduling purpose. Lastly, this paper presents two test results for the approximation model. The results expose the approximation model to quite promising in deploying it into an operational software program for the long-term track tamping scheduling problem.

• ETRI Journal
• /
• 제27권6호
• /
• pp.725-732
• /
• 2005

The reconfiguration management scheme changes a logical topology in response to changing traffic patterns in the higher layer of a network or the congestion level on the logical topology. In this paper, we formulate a reconfiguration scheme with a shared buffer-constrained cost model based on required quality-of-service (QoS) constraints, reconfiguration penalty cost, and buffer gain cost through traffic aggregation. The proposed scheme maximizes the derived expected reward-cost function as well as guarantees the required flow's QoS. Simulation results show that our reconfiguration scheme significantly outperforms the conventional one, while the required physical resources are limited.

• 정보보호학회논문지
• /
• 제18권6B호
• /
• pp.233-248
• /
• 2008

Advances in electronics and wireless communication technologies have enabled the development of large-scale wireless sensor networks (WSNs). There are numerous applications for wireless sensor networks, and security is vital for many of them. However, WSNs suffer from many constraints, including low computation capability, small memory, limited energy resources, susceptibility to physical capture, and the lack of infrastructure, all of which impose unique security challenges and make innovative approaches desirable. In this paper, we present a survey on security issues in wireless sensor networks. We address several network models for security protocols in WSNs, and explore the state of the art in research on the key distribution and management schemes, typical attacks and corresponding countermeasures, entity and message authentication protocols, security data aggregation, and privacy. In addition, we discuss some directions of future work.