{'fraction_non_alphanumeric': 0.022916666666666665, 'fraction_numerical': 0.010416666666666666, 'mean_word_length': 5.493243243243243, '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}}
Memetic algorithm for solving resource constrained project scheduling problems

Resource constrained project scheduling problem (RCPSP) is considered to be an NP hard problem. Over the last few decades, many different approaches have been developed in order to solve RCPSPs optimally within a reasonable time limit. However, no existing approach is well-accepted in this regard. In this paper, for efficiently solving RCPSPs, a memetic algorithm is proposed. The proposed algorithm incorporates local search techniques and adaptive mutation with a carefully designed genetic algorithm. To judge the performance of the proposed algorithm, we have solved 31 benchmark problems (16 with 30 activities, and 15 problems with 60 activities), and compared the quality of solutions and computational time with other state-of-the-art algorithms. The results show that our proposed algorithm achieved good quality solutions with a significantly lower computational time.