{'fraction_non_alphanumeric': 0.024054982817869417, 'fraction_numerical': 0.0, 'mean_word_length': 5.37956204379562, '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}}
Optimizing truck scheduling in a cross-docking system with preemption and unloading/loading sequence constraint

To solve the truck scheduling problem with preemption and unloading/loading sequence requirement in a multi-door cross-docking system, preemption rules are analyzed and a mathematical programming model is formulated aiming at minimizing total operation time. Then, a hybrid meta-heuristic algorithm based on particle swarm optimization and tabu search (PSO-TS) is proposed. Using Taguchi method, PSO-TS is tuned to attain the best robustness. Finally, computational experiments are carried out by using problem instances with different scales to compare the performances of PSO-TS and an improved PSO in the literature. Results show that PSO-TS had a significant advantage in computational time and produced better solutions with the increase of problem sizes.