{'fraction_non_alphanumeric': 0.028683181225554105, 'fraction_numerical': 0.005215123859191656, 'mean_word_length': 5.79646017699115, '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}}
Problem Solving by General Purpose Solvers

To solve problems abundant in real world applications, we have been proposing an approach of using general purpose solvers, since we cannot afford to develop special purpose algorithms for all individual problems. For this purpose, we have developed solvers for some standard problems such as CSP (constraint satisfaction problem), RCPSP (resource constrained project scheduling problem), GAP (generalized assignment problem) and VRP (vehicle routing problem), among others. These solvers have been successfully applied to many applications. In this talk, we report our recent experience of ITC2007 (International Timetabling Competition), in which we used our general purpose CSP solver to handle the presented benchmarks.