• Journal of Astronomy and Space Sciences
• /
• v.25 no.4
• /
• pp.361-374
• /
• 2008

Recently, satellite formation flying has been a topic of significant research interest in aerospace society because it provides potential benefits compared to a large spacecraft. Some techniques have been proposed to design optimal formation trajectories minimizing fuel consumption in the process of formation configuration or reconfiguration. In this study, a method is introduced to build fuel-optimal trajectories minimizing a cost function that combines the total fuel consumption of all satellites and assignment of fuel consumption rate for each satellite. This approach is based on collocation and nonlinear programming to solve constraints for collision avoidance and the final configuration. New constraints of nonlinear equality or inequality are derived for final configuration, and nonlinear inequality constraints are established for collision avoidance. The final configuration constraints are that three or more satellites should form a projected circular orbit and make an equilateral polygon in the horizontal plane. Example scenarios, including these constraints and the cost function, are simulated by the method to generate optimal trajectories for the formation configuration and reconfiguration of multiple satellites.

• Proceedings of the KIEE Conference
• /
• 2001.11b
• /
• pp.330-332
• /
• 2001

Distribution systems is consist of network in physical and radial in electrical aspect. Therefore radial operation is realized by changing the status of sectionalizing switches, and is usually done for loss reduction in the system. In this paper, we propose a optimal method for distribution systems reconfiguration. Specifically we use genetic algorithm method to solve distribution systems reconfiguration for loss minimization problem. A genetic algorithm(GA) is set up, in which some improvements are made on string coding, fitness function and mutation pattern. As a result, premature convergence is avoided.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.9
• /
• pp.1667-1673
• /
• 2009

This paper presents a application of new algorithm for feeder reconfiguration problem in distribution systems. Harmony Search (HS) algorithm, which is motivated from the musical performance, is used to reconfigure distribution systems so that active power losses are globally minimized with turning on/off the sectionalizing and the tie-line switches. In optimization processing, the HS algorithm has searching ability for the global optimal solution, simple coding of the iteration procedure, and fast convergence to get the solution. The HS algorithm is tested on 15 buses and 69 buses distribution systems, and the results prove its effectiveness to determine appropriate switching options without the occurrence of any misdetermination in switching and get the minimum power loss.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.11
• /
• pp.2199-2214
• /
• 1994

In order to sufficiently utilize the potential effectiveness of ATM networks, systematic and effective network management and control systems must be employed. In addition to network design, planning, and call routing techniques used in traditional circuit-switched networks. ATM networks can provide logical VP(Virtual Path) reconfiguration capabilities which can adapt to changes in the network environment. With a proper application of the VP reconfiguration technique, ATM networks can reduce the overhead of frequent network redesign and the overhead of call routing processing. However, ATM VP reconfiguration is a very complex and difficult problem which consists of many facets of optimization subproblems such as VP routing. VP sizing, VP terminating point location and VC routing. Most previous research on the ATM logical network reconfiguration problem dealt with the subset of the problem. This paper mathematically formulates the ATM network reconfiguration problem completely considering all subproblems. Since it is very difficult to derive the optimal solution of the formulated problem, we develop a heuristic method based on a Max min bandwidth allocation principle. We show the feasibility of the proposed heuristic method with a simple example.

• Proceedings of the KIEE Conference
• /
• 2002.07a
• /
• pp.121-123
• /
• 2002

In this paper, we preposed a chaos optimization method to reduce computational effort and enhance optimality of the solution in feeder reconfiguration problem. Chaos method in optimization problem searches the global optimal solution on the regularity of chaotic motions and more easily escapes from local or near optimal solution than stochastic optimization algorithms. The chaos optimization method is tested on 15 buses and 32 buses distribution systems, and the test results indicate that it is able to determine appropriate switching options for global optimum configuration with less computation.

• Proceedings of the KIEE Conference
• /
• 2003.07a
• /
• pp.403-405
• /
• 2003

In this paper, we applied a chaos search method for feeder reconfiguration problem in unbalanced distribution system. Chaos method, in optimization problem, searches the global optimal solution on the regularity of chaotic motions and more easily escapes from local or near optimal solution than stochastic optimization algorithms. The chaos search method applied to the IEEE 13 unbalanced test feeder systems, and the test results indicate that it is able to determine appropriate switching options for global optimum configuration.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.625-628
• /
• 1998

This paper presents an application of genetic algorithms(GAs) for optimal configuration of distribution network. Three problems have been used to show how genetic algorithms are modified and applied. Solutions to the problems are found by minimizing the cost function which is directly related with balancing the loads. Simulation results show that genetic algorithms are technically feasible if they are tailored to meet the needs of real problems.

• Bulletin of the Korean Space Science Society
• /
• 2007.10a
• /
• pp.55-55
• /
• 2007

• Journal of Electrical Engineering and Technology
• /
• v.12 no.4
• /
• pp.1435-1441
• /
• 2017

Distributed generation (DG) in the future will play an important role in the electricity supply systems, in wich can provide DG capacity from a few hundred kW to tens of MW. However, it is connected to the local power grid, DG will have certain influence on the power quality of the power grid. One of the most significant effects is that they will change the configuration of the local power grid as well as affecting the operation mode of the grid. This paper presents a method of finding the optimal open loop, analyzing and selecting the appropriate mode of operation to reduce power losses of power distribution networks that includes DG.

• Journal of Industrial Technology
• /
• v.28 no.B
• /
• pp.15-25
• /
• 2008

This paper is to develop a network reorganization method to consider the constraints which are turn restrictions, U-turns, and P-turns in two way traffic network for Intelligent Transport System(ITS). Several kinds of traffic constraints can be represented in reorganized network using virtual nodes and arc values. The evolution program is also developed to search the multiple shortest paths in this reorganized traffic network within limited time.