{'fraction_non_alphanumeric': 0.019409282700421943, 'fraction_numerical': 0.0, 'mean_word_length': 4.900497512437811, '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 Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem

This paper introduces a network design problem with a structure that is encountered in many transportation processes. The general organization of these systems is as follows. Freight has to be transported between a large number of origins and destinations. To consolidate the freight, it is first shipped to a terminal. Next, it is transported directly to a terminal where it is re-loaded and shipped to its destination. The task is to decide which terminals have to be used and how the freight is transported among the terminals. We describe an application where the terminals are airports and the freight is letter mail. Here, the transportation between terminals is by air, which is required due to temporal constraints. The economical impact of these decisions is huge because air transportation is costly and the process is repeated every night. We show how the problem can be modeled as a capacitated warehouse location problem with side constraints and propose a hybrid Tabu Search/Branch-and-Bound algorithm, which solves large real-world instances with acceptable computation times.