{'fraction_non_alphanumeric': 0.02849740932642487, 'fraction_numerical': 0.007772020725388601, 'mean_word_length': 5.0390625, '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}}
2L-CVRP: A GRASP resolution scheme based on RCPSP

This paper addresses an extension of the well-known Capacitated Vehicle Routing Problem (CVRP) where the customer demands represented by two-dimensional weighted items have to be packed into the vehicles. This problem, denoted 2L-CVRP, is NP-hard and it is particularly difficult to solve in practice. We propose a GRASP algorithm in which the loading constraint is handled by a Resource Constraint Project Scheduling Problem (RCPSP) heuristic specially tuned to address the bin-packing part of the problem. The effectiveness of our approach is demonstrated through computational experiments on both CVRP and non-sequential 2L-CVRP instances. Three new best average costs for class 2–5 are provided for 2L-CVRP instances.