{'fraction_non_alphanumeric': 0.016877637130801686, 'fraction_numerical': 0.0, 'mean_word_length': 5.8768115942028984, '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}}
Enhancing and extending the classical GRASP framework with biased randomisation and simulation

Abstract Greedy Randomised Adaptive Search Procedure (GRASP) is one of the best-known metaheuristics to solve complex combinatorial optimisation problems (COPs). This paper proposes two extensions of the typical GRASP framework. On the one hand, applying biased randomisation techniques during the solution construction phase enhances the efficiency of the GRASP solving approach compared to the traditional use of a restricted candidate list. On the other hand, the inclusion of simulation at certain points of the GRASP framework constitutes an efficient simulation–optimisation approach that allows to solve stochastic versions of COPs. To show the effectiveness of these GRASP improvements and extensions, tests are run with both deterministic and stochastic problem settings related to flow shop scheduling, vehicle routing, and facility location.