{'fraction_non_alphanumeric': 0.0153015301530153, 'fraction_numerical': 0.0, 'mean_word_length': 5.212290502793296, '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 HYBRID TABU-SA ALGORITHM FOR LOCATION-INVENTORY MODEL WITH CONSIDERING CAPACITY LEVELS AND UNCERTAIN DEMANDS

In this paper, we present a complex distribution network design problem in supply chain system which includes location and inventory decisions. Customers' demand is generated randomly and each distribution center maintains a certain amount of safety stock in order to achieve a certain service level for the customers it services. Unlike most of past research, our model allows for multiple levels of capacities available to the distribution centers. This consideration helps to achieve the capacity utilization to a high level as our computational results show this fact. We show that this problem can be formulated as a non-linear integer programming model. A hybrid heuristic combining Tabu search with Simulated Annealing (SA) sharing the same tabu list is developed for solving the problem. We comprise the hybrid algorithm with the optimal solution, Simulated Annealing algorithm and Tabu search algorithm. The results indicate that the method is efficient for a wide variety of problem sizes.