{'fraction_non_alphanumeric': 0.022267206477732792, 'fraction_numerical': 0.0, 'mean_word_length': 4.651428571428571, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Iterative DCOPF model using distributed slack bus

Loss modelling in DCOPF has seen various versions of implementation in literature. Each one of them strives to model the losses in the most accurate manner possible, depending on the methodology used and assumptions made, in order to obtain locational marginal price (LMP). The methodology proposed in this paper is a variant of the iterative DC approach. In this model, the choice of slack bus changes the solution in terms of cost and LMPs. Instead of keeping β constant based on load magnitude, it is shown that initializing the iterative algorithm by appropriate slack distribution variable (β), and updated based on dispatch obtained, a better solution can be obtained. This inturn has an effect on the loss factors and Generation Shift Factor (GSF), which are a function of β. This leads to a different set of LMPs. With a suitable choice of β, a reasonable result in terms of cost and closeness of LMPs with ACOPF can be obtained.