*SUPERCONDUCTING fault current limiters, *ALGORITHMS, *ELECTRIC power transmission, *PROBLEM solving
Abstract
In general, SFCLs can have a negative impact on the protective coordination in power transmission system because of the variable impedance of SFCLs. It is very important to solve the protection problems of the power system for the successful application of SFCLs to real power transmission system. This paper reviews some protection problems which can be caused by the application of 154 kV SFCLs to power transmission systems in South Korea. And then we propose an adaptive protection algorithm to solve the problems. The adaptive protection algorithm uses the real time information of the SFCL system operation. [ABSTRACT FROM AUTHOR]
Abstract: In practice, a train-conflict resolution is decentralized around dispatchers each of whom controls a few segments in a global railway network with her rule-of-thumb to operational data. Conceptually, the global sub-optimality or infeasibility of the decentralized system is resolved by a network controller who coordinates the dispatchers and train operators at the lower layers on a real-time basis. However, such notion of a multi-layer system cannot be effectual unless the top layer is able to provide a global solution soon enough for the dynamic lower layers to adapt in a seamless manner. Unfortunately, a train-conflict resolution problem is NP-hard as formally established in this paper and an effective solution method traded off between computation time and solution quality has been lacking in literature. Thus, we propose a column-generation-based algorithm that exploits the separability of the problem. A key ingredient of the algorithm is an efficient heuristic for the pricing subproblem for column generation. Tested on the real data from the Seoul metropolitan railway network, the algorithm provides near-optimal conflict-free timetables in a few seconds for most cases. The performance of the proposed algorithm is compared to the ones of the previous MIP-based heuristic by and the priority-based heuristic by . [ABSTRACT FROM AUTHOR]