• Communications for Statistical Applications and Methods
• /
• 제7권1호
• /
• pp.357-370
• /
• 2000

This study has adapted a genetic algorithm for an optimal design for the first time. the models that was used a simulation are the first and second order response surfaces model, Using an genetic algorithm in D-opimal it is more efficient than previous algorithms to get an object function. Not like other algorithm without any restrictions like troublesome about the initial solution not falling into a local optimal solution it's the most suitable algorithm.

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

This paper presents an application of a newly designed Adaptive Genetic Algorithm (AGA) to solve the Optimal Feeder Routing (OFR) problem for distribution system planning. The main objective of the OFR problem usually is to minimize the total cost that is the sum of investment costs and system operation costs. We propose a properly designed AGA, in this paper, which can handle the horizon-year expansion planning problem of power distribution network in which the location of substation candidates, the location and amount of forecasted demands are given. In the proposed AGA, we applied adaptive operators using specially designed adaptive probabilities. we also a Simplified Load Flow (SLF) technique for radial networks to improve a searching efficiency of AGA. The proposed algorithm has been evaluated with the practical 32, 69 bus test system to show favorable performance. It is also shown that the proposed method for the OFR can also be used for the network reconfiguration problem in distribution system.

• 대한전기학회논문지:전력기술부문A
• /
• 제49권11호
• /
• pp.566-574
• /
• 2000

This paper propose a heuristic algorithm based on the Branch-Exchange (BE) method to solve Optimal feeder Routing(OFR) problem for the distribution system planning. The cost function of the OFR problem is consisted of the investment cost representing the feeder installation and the system operation cost representing the system power loss. We propose a properly designed heuristic strategy, which can handle the horizon-year expansion planning problem of power distribution network. We also used the loop selection method which can define the maximum loss reduction in the network to reduce calculation time, and proposed a new index of power loss which is designed to estimate the power loss reduction in the BE. The proposed index, can be considered with both sides, the low voltage side and voltage side branch connected with tie one. The performances of the proposed algorithms and loss index were shown with 32, 69 example bus system.

• 한국컴퓨터정보학회논문지
• /
• 제18권7호
• /
• pp.85-92
• /
• 2013

본 논문에서는G. Wang의 대리서명 방식과 Schnorr 은닉서명 방식을 이용하여 안전한 대리은닉서명방식을 제안한다. 대리은닉 서명은 대리서명과 은닉서명을 결합한 전자서명 방식이다. G. Wang은 두-참가자 Schnorr 서명방식에 기반한 안전성 증명 가능한 대리서명 방식을 제안하였다. 이 논문에서는, G. Wang의 대리서명 방식과 또한, 제안하는 대리 은닉 서명 방식을 이용하여 전자 투표를 위한 대리 에이전트를 고안한다. 그리고, 제안하는 서명 방식이 대리 서명과 은닉 서명의 안전성 요구사항을 모두 만족시키며 최적화된 효율적인 대리 은닉 서명 방식임을 보인다.