{'fraction_non_alphanumeric': 0.017336485421591805, 'fraction_numerical': 0.0, 'mean_word_length': 5.1352657004830915, '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 Decision Support System for a Multi-trip Vehicle Routing Problem with Trucks and Drivers Scheduling

Many real-world transportation problems can be modeled as variants of the well-known vehicle routing problem (VRP), where a fleet of vehicles based at a central depot is used to deliver freight to clients at a minimum cost. Frequently, the problems defined in the VRP literature and the corresponding solution algorithms do not catch all the problem features incurred by the companies in their every-day activity, and further flexibility is needed during the decision process to make adjustments on the fly. In this paper, we present a decision support system developed for an Italian pharmaceutical distribution company to deal with a Multi-Trip VRP characterized by additional constraints and Truck and Driver Scheduling. The problem is solved in the software with a two-phase algorithm: the first phase consists of an Iterated Local Search metaheuristic that defines the vehicle routes, whereas the second phase invokes a mathematical model to assign trucks and drivers to the routes. The software allows, between the two phases, changes in the solution to better fit the company requirements. Computational results prove the effectiveness of the proposed method.