{'fraction_non_alphanumeric': 0.01669941060903733, 'fraction_numerical': 0.0, 'mean_word_length': 5.13855421686747, '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 cost-based set-covering location-allocation problem with unknown covering radius

This paper proposes a covering problem in a discrete space where the covering radius is unknown and will be determined according to the distances among existing facilities and candidate points. On the other hand, cost of servicing is considered in our formulation as an important factor for allocating each demand point to the service point which is covered by. The problem is to find coverage radius, minimum number of service points, their locations in such a way that each customer shouldn't travel so far for servicing and the optimal allocation of demand points to service points to minimize the total cost of allocation or transportation. A multi-objective formulation is proposed for this problem and TOPSIS (Technique for Order Preference by Similarity to Ideal Solution) for MODM (Multi Objective Decision Making) will be used for optimizing the problem. Finally a numerical example illustrates the results of proposed model.