{'fraction_non_alphanumeric': 0.02466091245376079, 'fraction_numerical': 0.0, 'mean_word_length': 4.71830985915493, '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}}
Two Fast Heuristics for Online Order Dispatching

Order dispatching, a key part in real-time food delivery system, has received a lot of attention over the last decade. Under constraints of on-time rate and some other practical constraints, our goal is to maximize the total efficiency of the whole system. As an online algorithm, the running time of the algorithm for order dispatching is limited within milliseconds. At the same time, the problem is highly dynamic and the complexity of the solution space is huge. In this paper, we design two fast heuristics for order dispatching in real-time food delivery. We compare our algorithm with two state-of-the-art algorithms. With numerical results, we show our algorithms are faster than algorithms in the literature and with similar or better solution quality.