{'fraction_non_alphanumeric': 0.015019762845849802, 'fraction_numerical': 0.0, 'mean_word_length': 5.267326732673268, '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 simulated annealing method for solving multi-area unit commitment problem in deregulated environment

This paper presents a new approach to solve the multi-area unit commitment problem (MAUC) in deregulated environment using a simulated annealing method. The objective of this paper is to maximizing or minimize the operating cost among generating companies (GENCO'S) in multiple areas that are interconnected via tie-lines. Joint operation of generation resources can result in significant operational cost savings. The simulated annealing method is used to solve multi area unit commitment problem, allocated generation for each area and find the operating cost of generation for each hour. Power transfer between the areas through tie lines depends upon the operating cost of generation at each hour and tie line transfer limits. The tie line transfer limits were considered as a set of constraints during the optimization process to ensure system security and reliability. The overall algorithm can be implemented on an IBM-PC, which can process a fairly large system in a reasonable period of time. Experimental results shows the application of this method have the potential to solve multi area power generation scheduling in deregulated electricity market.