{'fraction_non_alphanumeric': 0.02040816326530612, 'fraction_numerical': 0.002551020408163265, 'mean_word_length': 5.612359550561798, '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}}
USING HYBRID GENETIC ALGORITHMS TO SOLVE DISCRETE LOCATION ALLOCATION PROBLEMS WITH RECTILINEAR DISTANCE

ABSTRACT This paper presents a hybrid genetic algorithm to solve the uncapacitated location allocation problems as a combinatorial optimization problem. The proposed method incorporates a modified K-means algorithm that clusters the customers into groups based on the rectilinear distance, and then the initial population of solutions is calculated according to the derived centers of clusters. The hybrid genetic algorithm consists of two evolutionary processes synchronized with each other. It uses the elite strategy, local search, multi-start mechanism and distance-based mutation to efficiently obtain the optimal or approximated solutions. In order to verify the effectiveness of the proposed method, four GAs—KGA, HGA, LMGA and TGA, are built and compared. Furthermore, using six commonly used test problems, the performance of the proposed method is evaluated relative to the Simulated Annealing method [4] and the SOFMGR method [14] as benchmarks. Experimental results show that the proposed method is excellent in quality of solutions and speed of computation.