{'fraction_non_alphanumeric': 0.01131687242798354, 'fraction_numerical': 0.0, 'mean_word_length': 5.443708609271523, '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 Lagrangian heuristic for the urgency vehicle routing problem

For solving the vehicle routing disruption problem which is caused by vehicles breakdown or traffic accidents in the logistic distribution system, an urgency vehicle scheduling scheme is established based on the theory of disruption management. According to the characteristics of the problem, Lagrangian relaxation approach is applied to simplify and divide the problem into two parts. The column generation and saving approach method are used respectively to obtain the solution, and then the subgradient optimization method is used to iterate to get the Lagrangian multiplier, therefore the initial solution for the original problem is obtained. In Order to solve the infeasibility problem caused by Lagrangian relaxation operation, an insertation algorithm is adopted. In the end of the paper, the feasibility and effectivity of the algorithm giving by the paper are verified by compared with an example.