Search NASA⌕ Search

SEARCH · Search NASA

Results for “transaction”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

On Anomaly Detection for Transactive Energy Systems with Competitive Market

Two anomaly-detection criteria are proposed for transactive energy systems with competitive markets. Participants of transactive energy systems seek an optimal power allocation through hybrid economic-control methods to facilitate the integration of various types of distributed energy resources to power distribution systems. In transactive energy systems, every participant is assumed to be a rational entity, and consumers have diminishing marginal utility and suppliers have increasing marginal cost. With the first proposed anomaly-detection criterion, the monotonicity of marginal cost and marginal utility are examined. The impact of line flow constraints is also taken into consideration. Then, the second anomaly-detection criterion is proposed for TESs with marginal cost and marginal utility which change faster than a certain rate. The second criterion is more accurate than the first one for TES with marginal cost and marginal utility which change faster than a certain rate, but it requires the knowledge of that rate. Neither criteria requires more data than those necessary to find the optimal power allocation and the market-clear price in a transactive energy system. Therefore, the proposed criteria do not disclose any more data than necessary. As the monotonicity of marginal cost and marginal utility in a TES with competitive markets results in convex objective functions in an optimization problem and strongly convex ones when marginal cost and marginal utility changes faster than a certain rate, the two detection criteria are also applicable to anomaly detection of general convex optimization problems. Simulations are carried out to show the efficacy of the proposed criteria to detect anomalies caused by cyberattacks.

Wang, Peng↗

The Transactive Energy Network Template Metamodel

While transactive energy, which is defined as an allocation of electricity based on dynamically discovered values or prices, has been extensively studied, its uptake and use has been slow. This report describes a tool, the transactive network template, which should hasten the creation and uptake of transactive energy networks. Some basic principles of transactive energy are familiar from existing wholesale electricity markets. Locational prices are calculated today for zones within bulk electric transmission systems. Locational prices differ while accounting for the locational costs of electricity generation and the losses and constraints incurred when electricity is transmitted from generators and distributed to consumers. A transactive energy network might include these transmission zones. However, current research strives to apply transactive energy also in electricity distribution circuits, buildings, and even for individual generating and consuming devices. At the same time, researchers explore how to apply transactive energy in real time during increasingly shorter time intervals. Automated computational agents become necessary as transactive energy becomes applied to smaller circuit zones and at faster dynamic timescales. A transactive energy network is an example of a multi-agent system. Each zone in the network is represented by its transactive agent, which makes decisions for and acts on behalf of a business entity that is responsible for and manages one of the circuit regions. A transactive energy network is also an example of a decentralized, distributed control system. Control decisions and responsibilities are distributed among the network’s transactive agents. The transactive agents are independent; that is, there typically is no centralized authority or oversight function. Instead, transactive agents exchange transactive signals and thereby negotiate the prices and quantities of electricity that they will exchange. Initially, the circuit regions and responsibilities of transactive agents appear to be very dissimilar. Each circuit region may comprise transmission, distribution, or building-level circuits. Each has a unique position and electrical connectivity within the transactive energy network. Each possesses unique assets that either generate or consume electricity, and these (e.g., renewable energy generator, diesel generator, aggregate utility load, building load, space conditioning, refrigerator, etc.) may further differ in their price flexibility and in their strategies for responding to dynamic electricity prices. Given such diversity, an implementer’s first inclination might be to start from scratch to define all these devices and to engineer their seemingly unique interactions. Given that each implementer’s perspective may be narrow within a transactive energy network, it is unlikely that uniquely engineered systems would interact well. This is where the transactive network template is applicable. The transactive network template is a metamodel that has been developed to guide implementers as they configure their own transactive agent within a network of such agents. The object-oriented design of the transactive network template provides basic code object types that may be used and extended by implementers to represent each of the assets in their circuit region. These objects further facilitate the transactive agent’s necessary computations, which are divided among responsibilities to schedule power usage, balance electric supply and demand, and coordinate the exchange of electricity with the other transactive agents. This report addresses the conceptual transactive network template design. Implementers are directed to more formal design documents and reference implementations. A Python™-based1 reference implementation of the transactive network template has been coded, and three implementations have been configured to represent a national laboratory and two university campuses. Version 2 of the transactive node template generalizes the market class and its methods to facilitate multiple, and more diverse market coordination mechanisms than were facilitated by and demonstrated using Version 1. Version 3 includes new Appendix B, which addresses the designs of methods that would make dynamic prices track approved electricity rates. In the future, the author wishes to make the transactive network template more generally applicable to networks that require more accurate power flow. Development of the transactive network template is jointly funded by the U.S. Department of Energy (DOE) Energy Efficiency and Renewable Energy and the DOE Office of Electricity. In late 2015, one of the first projects to be funded by the DOE Grid Laboratory Modernization Laboratory Consortium was the Clean Energy and Transactive Campus project, led by Pacific Northwest National Laboratory. DOE funds were matched by an investment by the Washington Department of Commerce through its Clean Energy Fund. The transactive network template was developed to guide the implementation of transactive energy networks within this project’s scope.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An EVACS simulation with nested transactions

Documented here is the recent effort of the MISSION Kernel Team on an Extra-Vehicular Activity Control System (EVACS) simulation with nested transactions. The team has implemented the EVACS simulation along with a design for nested transactions. The EVACS simulation is a project wide aid to exploring Mission and Safety Critical (MASC) applications and their support software. For this effort it served as a trial scenario for demonstrating nested transactions and exercising the transaction support design. The EVACS simulation is a simulation of some aspects of the Extra-Vehicular Activity Control System, in particular, just the selection of communication frequencies. Its current definition is quite narrow, serving only as a starting point for prototyping purposes. (EVACS itself may be supplanted in a larger scenario of a lunar outpost with astronauts and a lunar rover.) Initially the simulation of frequency selection was written without consideration of nested transactions. This scenario was then modified to embed its processing in nested transactions. To simplify the prototyping effort, only two aspects of the general design for transaction support have been implemented: the basic architecture and state recovery. The simulation has been implemented in the programming language Smalltalk. It consists of three components: (1) a simulation support code which provides the framework for initiating, interacting and tracing the system; (2) the EVACS application code itself, including its calls upon nested transaction support; and (3) a transaction support code which implements the logic necessary for nested transactions. Each of these components deserves further description, but for now only the transaction support is discussed.

Auty, David↗

Rapid transaction-undo recovery using twin-page storage management

This paper presents a twin-page storage method, which is an alternative to the TWIST (twin slot) approach by Reuter, for rapid transaction-undo recovery. In contrast to TWIST, our twin-page approach allows dirty pages in the buffer to be written at any instant onto disk without the requirement of undo logging, and, when a transaction is aborted, no explicit undo is required. As a result, all locks accumulated by the aborted transaction can be released earlier, allowing other transactions waiting for the locks to proceed. Through maintenance of aborted transaction identifiers, invalid pages written by the aborted transaction coexist with other valid pages and are guaranteed not be accessed by subsequent transactions. Instead of an explicit undo, most of the invalid pages are overwritten by subsequent normal updates. Performance in terms of disk I/O and CPU overhead for transaction-undo recovery is analyzed and compared with TWIST. It is shown that our scheme is particularly suited for applications where there are a large number of updates written onto disk when transactions are aborted, and there are frequent aborts. The approach, however, is not as applicable to environments where transactions are typically short or rarely aborted, or most updates are not written onto disk before a commitment.

Wu, Kun-Lung↗

Improved Particle Swarm Algorithm Using Rubik’s Cube Topology for Bilevel Building Energy Transaction

Following the rapid growth of distributed energy resources (e.g., renewables, battery), localized peer-to-peer energy transactions are receiving more attention for multiple benefits, such as reducing power loss and stabilizing the main power grid. To promote distributed renewables locally, the local trading price is usually set to be within the external energy purchasing and selling price range. Consequently, building prosumers are motivated to trade energy through a local transaction center. This local energy transaction is modeled in bilevel optimization game. A selfish upper level agent is assumed with the privilege to set the internal energy transaction price with an objective of maximizing its arbitrage profit. Meanwhile, the building prosumers at the lower level will response to this transaction price and make decisions on electricity transaction amount. Therefore, this non-cooperative leader-follower trading game is seeking for equilibrium solutions on the energy transaction amount and prices. Additionally, a uniform local transaction price structure (purchase price equals selling price) is considered here. Aiming at reducing the computational burden from classical Karush–Kuhn–Tucker (KKT) transformation and protecting the private information of each stakeholder (e.g., building), swarm intelligence-based solution approach is employed for upper level agent to generate trading price and coordinate the transactive operations. On one hand, to decrease the chance of premature convergence in global-best topology, Rubik’s Cube topology is proposed in this study based on further improvement of a two-dimensional square lattice model (i.e., one local-best topology-Von Neumann topology). Rotating operation of the cube is introduced to dynamically changing the neighborhood and enhancing information flow at the later searching state. Several groups of experiments are designed to evaluate the performance of proposed Rubik’s Cube topology-based particle swarm algorithm. The results have validated the effectiveness of proposed topology and operators comparing with global-best version PSO and Von Neumann topology-based PSO and its scalability on larger scale applications.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Rubik’s Cube Topology Based Particle Swarm Algorithm for Bilevel Building Energy Transaction

Following the rapid growth of distributed energy resources (e.g. renewables, battery), localized peer-to-peer energy transactions are receiving more attention for multiple benefits, such as, reducing power loss, stabilizing the main power grid, etc. To promote distributed renewables locally, the local trading price is usually set to be within the external energy purchasing and selling price range. Consequently, building prosumers are motivated to trade energy through a local transaction center. This local energy transaction is modeled in bilevel optimization game. A selfish upper level agent is assumed with the privilege to set the internal energy transaction price with an objective of maximizing its arbitrage profit. Meanwhile, the building prosumers at the lower level will response to this transaction price and make decisions on electricity transaction amount. Therefore, this non-cooperative leader-follower trading game is seeking for equilibrium solutions on the energy transaction amount and prices. In addition, a uniform local transaction price structure (purchase price equals selling price) is considered here. Aiming at reducing the computational burden from classical Karush-Kuhn-Tucker (KKT) transformation and protecting the private information of each stakeholder (e.g., building), swarm intelligence based solution approach is employed for upper level agent to generate trading price and coordinate the transactive operations. On one hand, to decrease the chance of premature convergence in global-best topology, Rubiks Cube topology is proposed in this study based on further improvement of a two-dimensional square lattice model (i.e., one local-best topology-Von Neumann topology). Rotating operation of the cube is introduced to dynamically changing the neighborhood and enhancing information flow at the later searching state. Several groups of experiments are designed to evaluate the performance of proposed Rubiks Cube topology based particle swarm algorithm. The results have validated the effectiveness of proposed topology and operators comparing with global-best version PSO and Von Neumann topology based PSO and its scalability on larger scale applications.

Feng, Xiaochun↗

Transactive energy systems for distributed blackstart and service recovery

Abstract Current transactive controls use marginal benefits and marginal costs to achieve an economic market efficiency during normal grid operations. However, the transactive mechanisms designed for normal economic operations cannot be applied directly for the contingencies because the grid operations during contingencies are often dictated by technical needs rather than purely economic criteria. For instance, one of the key technical requirements for the blackstart is to have at least one blackstart capable resource cleared which cannot be ensured by the transactive mechanism designed for normal economic operations because they work primarily based on the marginal benefit and marginal cost of the participants. This article presents one of the first attempts to develop a transactive mechanism to be used during grid contingencies. A distributed blackstart and service recovery is used as an example contingency to evaluate the performance of the proposed transactive mechanism. The performance of the proposed transactive mechanism is demonstrated for various use cases using a modified IEEE‐123 node test system. The simulation results demonstrated the proof of concept of applying a transactive mechanism to enable distributed blackstart and service recovery by engaging the mix of blackstart capable and non‐capable distributed energy resources.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Predicting U.S. federal fleet electric vehicle charging patterns using internal combustion engine vehicle fueling transaction statistics

Utilizing fueling transactions from internal combustion engine vehicles (ICEVs), the authors estimated how frequently midday public charging would be required for U.S. federal fleet battery electric vehicles (BEVs). Fueling transaction summary statistics are more widely available than trip-level telematics data, making this methodology more accessible and transferable to other researchers and fleet managers considering BEV replacements. For example, readers can easily apply a linear model using only the count of back-to-back fueling events at gas stations over 57 straight-line miles apart to predict days exceeding range. This linear regression predicted binned days exceeding 250 miles at 80% accuracy on a hold-out test set from the same fleet as the training data and 66 % accuracy on a new fleet displaying different driving behaviors. The authors additionally provide linear equations for days exceeding 200 and 300 miles as alternative range estimates to account for differences in BEV range and temperature impacts. Beyond the single-feature linear models which readers can apply, the authors tuned and trained other machine learning models on a variety of fueling transaction statistics including consecutive transaction distances, transaction distance from garage, estimated miles traveled from fuel economy and fuel quantity, and transaction periodicity. Utilizing a subset of 1678 light-duty federal fleet vehicles which contained daily vehicle miles traveled (VMT) in addition to fueling statistics, the authors determined which fueling transaction statistics were most relevant in predicting driving days exceeding 250 miles (an approximation of BEV rated driving range). In support of the U.S. federal fleet transition to zero-emission vehicles (ZEVs), the authors used these statistics and machine learning models to predict the frequency of BEV midday charging. After training models on the subset with VMT, the authors predicted days exceeding rated range for 112,902 light-duty vehicles operating in similar circumstances in the federal fleet using a Support Vector Regressor (SVR). In conclusion, they then used the projections as part of the ZEV Planning and Charging (ZPAC) tool to identify optimal candidates for BEVs for the federal fleet. An anonymized version of ZPAC is included in the supplementary materials.

25 ENERGY STORAGE↗

The Distribution System Operator with Transactive (DSO+T) Study

The Distribution System Operator with Transactive (DSO+T) study investigates the engineering and economic performance of a transactive energy retail market coordinating a high penetration of customer-side flexible energy assets. The study seeks to answer whether such an implementation is cost effective for customers, recovers sufficient revenue for DSOs, and is equally applicable and beneficial to a range of flexible asset types, renewable generation scenarios, and market assumptions. Using a highly interdisciplinary co-simulation and valuation framework, this assessment encompasses the entire electrical delivery system from bulk system generation and transmission, through the distribution system, to the modeling of individual customer buildings and flexible assets (including heating, ventilation, and air conditioning [HVAC] units, water heaters, batteries, and electric vehicles). The study exercises a transactive energy retail market coordination scheme designed to integrate with an existing day-ahead and real-time competitive wholesale electricity market. Software decision-making agents are designed for the retail market operator as well as various price-responsive flexible assets. The engineering and economic performance of the transactive energy scheme is studied for two separate flexible asset deployments: flexible loads (HVAC units and residential water heaters) and behind-the-meter batteries. The results of each transactive case are compared to a business-as-usual case. These cases are subject to two different renewable generation scenarios, a moderate renewable generation scenario, representative of current levels of renewable generation deployment, and a future high renewables scenario, including the increased deployment of rooftop solar photovoltaic and electric vehicles. The transactive coordination scheme is shown to produce effective and stable control and decrease peak loads 9–15%. The resulting annual demand flexibility provides net economic savings of $3.3–5.0B per year for a region the size of Texas. Detailed analysis shows that net benefits were seen for a range of distribution system operator, customer, and flexible asset types. Both participating customer (with transactive flexible assets) and nonparticipating customers (with nonflexible assets) see reductions in annual utility bills and net annual energy expenses in the range of 10–16%.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Distribution System Operator with Transactive (DSO+T) Study: Volume 1 (Main Report)

The Distribution System Operator with Transactive (DSO+T) study investigates the engineering and economic performance of a transactive energy retail market coordinating a high penetration of customer-side flexible energy assets. The study seeks to answer whether such an implementation is cost effective for customers, recovers sufficient revenue for DSOs, and is equally applicable and beneficial to a range of flexible asset types, renewable generation scenarios, and market assumptions. Using a highly interdisciplinary co-simulation and valuation framework, this assessment encompasses the entire electrical delivery system from bulk system generation and transmission, through the distribution system, to the modeling of individual customer buildings and flexible assets (including heating, ventilation, and air conditioning [HVAC] units, water heaters, batteries, and electric vehicles). The study exercises a transactive energy retail market coordination scheme designed to integrate with an existing day-ahead and real-time competitive wholesale electricity market. Software decision-making agents are designed for the retail market operator as well as various price-responsive flexible assets. The engineering and economic performance of the transactive energy scheme is studied for two separate flexible asset deployments: flexible loads (HVAC units and residential water heaters) and behind-the-meter batteries. The results of each transactive case are compared to a business-as-usual case. These cases are subject to two different renewable generation scenarios, a moderate renewable generation scenario, representative of current levels of renewable generation deployment, and a future high renewables scenario, including the increased deployment of rooftop solar photovoltaic and electric vehicles. The transactive coordination scheme is shown to produce effective and stable control and decrease peak loads 9–15%. The resulting annual demand flexibility provides net economic savings of $3.3–5.0B per year for a region the size of Texas. Detailed analysis shows that net benefits were seen for a range of distribution system operator, customer, and flexible asset types. Both participating customer (with transactive flexible assets) and nonparticipating customers (with nonflexible assets) see reductions in annual utility bills and net annual energy expenses in the range of 10–16%.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Twin-page storage management for rapid transaction-undo recovery

This paper presents and evaluates a new twin-page disk-storage management scheme for rapid database transaction-undo recovery. In contrast to previous twin-page schemes, the present approach uses static page mapping and allows dirty pages in the main memory to be written, at any instant, onto disk without the requirement of undo logging. No explicit undo is required when a transaction is aborted. Transaction undo is implicitly performed by not subsequently fetching from disk the invalid pages updated by the aborted transaction. Performance in terms of disk I/O and CPU overhead for transaction-undo recovery is analyzed and compared with a previous approach TWIST. It is shown that the scheme achieves rapid transaction-undo recovery without degrading average system performance for various workloads, and that the scheme is well suited for applications with a large number of updates and frequent transaction aborts.

Wu, Kun-Lung↗

Reduced Order Model of Transactive Bidding Loads

Transactive energy (TE) has been identified to provide better grid efficiency and reliability by market-based transactive exchanges between energy producers and energy consumers. Simulations of TE systems are crucial to evaluate the benefits and impacts of different transactive mechanisms. However, such simulations can be time consuming due to the information exchange between various participants and complex co-simulation environments. In this paper, we develop a reduced order model to speed up the simulation of transactive systems in TE simulation platform (TESP) while achieving very low error between the reduced order and full model results. Specifically, the developed reduced order model consists of an aggregate responsive load agent which utilizes two Recurrent Neural Networks (RNNs) with Long Short-Term Memory units (LSTMs) to enable transactive elements to collectively participate in the TE system. The proposed aggregate responsive load (ARL) agent is able to produce similar transactive behaviors to the full simulation model while achieving significant simulation time reduction. Finally, we also show that the developed model enables generalization of simulation results across different dates and across different number of loads included in the simulations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Security Constrained Distributed Transaction Model for Multiple Prosumers

Massive access of renewable energy has prompted demand-side distributed resources to participate in regulation and improve flexibility of power systems. With large-scale access of massive, decentralized, and diverse distributed resources, demand-side market members have transformed from traditional “consumers” to “prosumers”. To explore the distributed transaction model of prosumers, in this paper, a multi-prosumer distributed transaction model is proposed, and the Conditional Value-at-Risk (CVaR) theory is applied to quantify potential risks caused by the stochastic characteristics inherited from renewable energy. First, a prosumer model under constraints of the distribution network including photovoltaic units, fuel cells, energy storage system, central air conditioning and flexible loads is established, and a multi-prosumer distributed transaction strategy is proposed to achieve power sharing among multiple prosumers. Second, a prosumer transaction model based on CVaR is constructed to measure risks inherited from the uncertainty of PV output within the prosumer and ensure safety of system operation in extreme PV output scenarios. Then, the alternating direction multiplier method (ADMM) is utilized to solve the constructed model efficiently. Finally, distributed transaction costs of prosumers are distributed fairly based on the generalized Nash equilibrium to maximize social benefits. Simulation results show the multi-prosumer distributed transaction mechanism established under the proposed generalized Nash equilibrium method can encourage power sharing among prosumers, increasing their own income and social benefits. Also, the CVaR can assist decision making of prosumers in weighting the risks and benefits, improving system resilience through energy management of prosumers.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Blockchain Smart Contracts for Transactive Energy Systems

This report demonstrates the impact of blockchain technology underlying a transactive energy system and articulates details and principle components of each of five stages in a transactive energy system. This report depicts the engineering requirements of a sample market system, blockchain features, and the relationship between those requirements and features (Section 2.2). Clear value propositions of blockchain features for transactive energy systems are: identity management, security of data, resiliency, decentralization and smart contract trustworthiness, performance, integrity in a trustless environment and access control. Due to the immutability afforded by blockchain architecture, increased data fidelity could potentially help detect targeted cyber-attacks and increase resiliency of grid integration. A distributed system can be more fault tolerant and enable transactive energy by supporting machine-to-machine transactions that can be integrated directly into complex grid operations without the need of trust in a third party. Energy auctions, and potentially registration processes, can be carried out according to transparent rules implemented as smart contracts (Section 4.0). In this current experiment, we ran a use-case/table-top exercise that imitated a real-time 5-min double auction market. The objective of this demonstration is to investigate the applicability of blockchain with transactive energy systems (Section 3.0).

24 POWER TRANSMISSION AND DISTRIBUTION↗

The Deontic Transaction Model in Multi-Agent Normative Systems

In the area of multi-agent systems, much research is devoted to the coordination of the agents. There exist several issues, two of which are summarized. The first is that, although agents are said to be autonomous, they always react in a predictable way to each message, and they cannot decide to violate the conventions that are hard-wired into the protocol. In fact, there might be circumstances in which the agent violates a convention in order to realize a private goal that it considers to be more important. Another issue is that, if the protocols that agents use to react to the environment are fixed, they have no way to respond to changes. However, an important characteristic of agents is that they eon react to a changing environment. Although transaction models ([BOH92], [GR93]) evolved from the database domain, they establish a general execution paradigm that ideally covers all the subsystems invoked in a sequence of transactions. So transaction models apply to multi-agent systems. Recently, some research has been devoted to overcoming the limitations of the traditional transaction models which are suitable for conventional systems and focus on system integrity, e,g., [SJ97]. Here we solve above issues by turning to a deontic concept: obligation. In multi-agent systems, agents interact with each other according to norms, We use deontic logic ([And58], [Aqv84], [B C96], [JS94], [MW93]) to model norms. Here the norms prescribe how the agents ought to behave, but-- and this is essential-- they do not exclude the possibility of "bad" behavior (i.e., the actual behavior may deviate from the ideal), and so they also prescribe what should be done in circumstances of norm violation. Thus, we propose a new approach --- a deontic transaction model for multi-agent normative systems. Our approach improves the protocol of "abort/commit" of traditional transaction models to a protocol of "abort/exception/commit". In multi-agent normative systems, we can see the violation of a norm as an exception and how the other agents react to the violation as exception handling. This paper concentrates on our formal model.

Huang, Yonghua↗

Tracking transactions using extended memory features

An approach is disclosed that tracks memory transactions by a node. The approach establishes a transaction processing state corresponding to common virtual addresses accessed by a processing threads. Transactions are executed by the threads. A selected transaction is allowed to complete. In response to detecting a conflict in the transaction processing state, completion of a non-selected transaction is inhibited.

Kahle, James Allan↗

DSO+T: Transactive Energy Coordination Framework (DSO+T Study: Volume 3)

This report describes a transactive energy coordination scheme designed to integrate into existing day-ahead and real-time wholesale energy markets. This scheme was evaluated in the Distribution System Operator with Transactive (DSO+T) study to assess the engineering and economic performance of the transactive energy coordination of a large-scale deployment of distributed energy resources (DER). Transactive agents were developed for a range of DERs (heating, ventilation, and air conditioning units, water heaters, batteries, and electric vehicles) that optimize flexibility over a 48-hour horizon and adjust their strategy in response to changes in real-time prices. A transactive energy coordination scheme, executed by a DSO retail market operator, aggregates these DER bids from participating customers and clears them against a DSO supply curve using a double auction market mechanism. The process of constructing the price-quantity DSO supply curve includes distribution-level transportation constraints (for example, substation congestion limits) and forecast locational marginal price of the DSO’s connected transmission node. The resulting day-ahead and real-time quantities are then bid into a competitive wholesale market operated by an independent system operator. This report also details additional capabilities for proper marketplace simulation such as wholesale price, weather, and load forecasting. The report concludes with a discussion of lessons learned and key design features required to ensure successful operation.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗