{'fraction_non_alphanumeric': 0.01972872996300863, 'fraction_numerical': 0.0, 'mean_word_length': 5.151515151515151, '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}}
Scheduling Major League Baseball Umpires and the Traveling Umpire Problem

The scheduling needs of umpires and referees differ from the needs of sports teams. In some sports leagues, such as Major League Baseball in the United States, umpires travel throughout the league's territory; they do not have a “home base.” For such leagues, balancing the need to minimize umpire travel and the objective that an umpire should not handle the games of a particular team too frequently is important. We have used our approach, which is based on network optimization and simulated annealing, to successfully schedule Major League Baseball umpires. To develop this approach, we created the traveling umpire problem, which includes the major umpire scheduling issues and also provides a test bed for alternative techniques.