{'fraction_non_alphanumeric': 0.022792022792022793, 'fraction_numerical': 0.0, 'mean_word_length': 5.166666666666667, '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}}
Power distribution network reconfiguration based on min-cost flow problem

In this paper a network reconfiguration model aimed to be used in an industrial context is presented. It is based on a min-cost flow problem (MCFP) and a simplified power flow calculation. Mixed Integer Quadratic Constrained Programming (MIQCP) and Mixed Integer Non linear Programming (MINLP) are used and compared to compute the network reconfiguration with off-the-shelf optimization solvers. Two test cases are presented, a small academic network and a real case study. The paper shows experimentally that simplification on model level can be more efficient than simplification on the solving level for real world problems.