Transmission planning in a deregulated environment

The worldwide trend for the deregulation of the electricity generation and transmission industries has led to dramatic changes in system operation and planning procedures. The optimum approach to transmission-expansion planning in a deregulated environment is an open problem especially when the responsibilities of the organisations carrying out the planning work need to be addressed. To date there is a consensus that the system operator and network manager perform the expansion planning work in a centralised way. However, with an increasing input from the electricity market, the objectives, constraints and approaches toward transmission planning should be carefully designed to ensure system reliability as well as meeting the market requirements. A market-oriented approach for transmission planning in a deregulated environment is proposed. Case studies using the IEEE 14-bus system and the Australian national electricity market grid are performed. In addition, the proposed method is compared with a traditional planning method to further verify its effectiveness.

A real options based method for power system planning

A deregulated electricity market is characterized with uncertainties, with both long and short terms. As one of the major long term planning issues, the transmission expansion planning (TEP) is aiming at implementing reliable and secure network support to the market participants. The TEP covers two major issues: technical assessment and financial evaluations. Traditionally, the net present value (NPV) method is the most accepted for financial evaluations, it is simple to conduct and easy to understand. Nevertheless, TEP in a deregulated market needs a more dynamic approach to incorporate a project's management flexibility, or the managerial ability to adapt in response to unpredictable market developments. The real options approach (ROA) is introduced here, which has clear advantage on counting the future course of actions that investors may take, with understandable results in monetary terms. In the case study, a Nordic test system has been testified and several scenarios are given for network expansion planning. Both the technical assessment and financial evaluation have been conducted in the case study.

Expansion-based algorithms for finding single pair shortest path on surface

Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path planning system, and surface nearest neighbor query in spatial database, etc. Currently, to solve the problem, existing algorithms must traverse the entire polyhedral surface. With the rapid advance in areas like Global Positioning System (CPS), Computer Aided Design (CAD) systems and laser range scanner, surface models axe becoming more and more complex. It is not uncommon that a surface model contains millions of polygons. The single pair shortest path problem is getting harder and harder to solve. Based on the observation that the single pair shortest path is in the locality, we propose in this paper efficient methods by excluding part of the surface model without considering them in the search process. Three novel expansion-based algorithms are proposed, namely, Naive algorithm, Rectangle-based Algorithm and Ellipse-based Algorithm. Each algorithm uses a two-step approach to find the shortest path. (1) compute an initial local path. (2) use the value of this initial path to select a search region, in which the global shortest path exists. The search process terminates once the global optimum criteria are satisfied. By reducing the searching region, the performance is improved dramatically in most cases.