{'fraction_non_alphanumeric': 0.013569937369519834, 'fraction_numerical': 0.0, 'mean_word_length': 5.2272727272727275, '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}}
Bi-level Simulated Annealing Algorithm for Facility Location Problem

The essence of all the facility location problems is to determine the location of the facility and the allocation of the demands of customers, which under the condition of the minimum of the cost. Based on this character and the idea of the standard simulated annealing algorithm, an all-purpose bi-level simulated annealing algorithm (BSA) is presented for the facility location problem. The BSA is divided into two layers as inner layer and outer layer to solve the problem. The outer algorithm is optimization for the decision of the facility location, and the inner algorithm is optimization for the allocation of customerpsilas demand under the given decision of the outer algorithm. Applications of two numerical examples with different scale denoted the algorithm is more effective than standard simulated annealing and other algorithms proposed to solve facility location problem.