{'fraction_non_alphanumeric': 0.019315188762071993, 'fraction_numerical': 0.014925373134328358, 'mean_word_length': 5.404494382022472, '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': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Optimal vehicle routing with lower and upper bounds on route durations

This article is concerned with the problem of finding optimal vehicle routes to minimize the overall travel time, with constraints on the minimum and maximum amount of time spent on each route. The problem extends previous work on the distance‐constrained vehicle routing problem by introducing lower bounds on route durations to ensure that the resulting routes are balanced. The article also explicitly addresses the situation where a solution is artificially balanced as a result of inoptimal orders of visits. The article describes alternative ways in which the restrictions on route connectivity, duration, and artificial balancing can be formulated, and introduces an exact algorithm based on cutting planes and mixed‐integer linear programming. To the best of our knowledge, this is the first exact algorithm proposed for such a problem that explicitly addresses artificially balanced routes. Computational results are presented for three versions of the exact algorithm using TSPLIB instances. © 2015 Wiley Periodicals, Inc. NETWORKS, Vol. 65(2), 166–179 2015