{'fraction_non_alphanumeric': 0.019867549668874173, 'fraction_numerical': 0.0, 'mean_word_length': 5.352941176470588, '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 Dynamic Spatial Layout Approach with Backtracking Strategy

This paper proposes a dynamic spatial layout approach with backtracking. Based on tree-search with backtracking, the optimal assembling spatial scheduling problems in the large-sized discrete companies are solved. The problem is complex because of simultaneously considering the spatial layout and the time scheduling. Thus, the pre-scheduling stage is used to arrange the block candidate sets via the time constraint. Then, the spatial scheduling with backtracking is developed to search for the optimal plan. To make the whole calculation simple and feasible, many heuristic methods have been adopted in the paper. Finally, the simulated experiment illustrates the validity of this approach.