{'fraction_non_alphanumeric': 0.01639344262295082, 'fraction_numerical': 0.0, 'mean_word_length': 5.576923076923077, '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}}
A Distributed Algorithm for Economic Dispatch Over Time-Varying Directed Networks With Delays

In power system operation, the economic dispatch problem (EDP) aims to minimize the total generation cost while meeting the demand and satisfying generator capacity limits. This paper proposes an algorithm based on the gradient push-sum method to solve the EDP in a distributed manner over communication networks potentially with time-varying topologies and communication delays. This paper shows that the proposed algorithm is guaranteed to solve the EDP if the time-varying directed communication network is uniformly jointly strongly connected. Moreover, the proposed algorithm is also able to handle arbitrarily large but bounded time-varying delays on communication links. Numerical simulations are used to illustrate and validate the proposed algorithm.