{'fraction_non_alphanumeric': 0.018001800180018002, 'fraction_numerical': 0.0, 'mean_word_length': 4.5879396984924625, '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}}
Models and Algorithms for the Constrained Orienteering Problem

The constrained orienteering problem (COP) can be expressed as: Given an undirected weighted graph G = (V, E) and a subset S V. Each node has a score, each edge has a weight indicating distance or time between the two adjacent nodes. The starting node and ending node are specified. Given a fixed amount of weight denoting the total distance or total time, the goal is to determine a walk from the starting node to the ending node through a subset of nodes including all the nodes in S, in order to maximize the total score of the walk. This problem is a generalization of the orienteering problem or a special case of the Steiner Tree problem. In this paper, we first formulate the COP problem into an integer linear programming based on network flow theory and solve it to obtain the exact optimal solution for examples of small size. Then we give a heuristic algorithm for solving the large instances of the problem. Finally, we give computational results of both exact and heuristic algorithms which demonstrate the efficient of the algorithm.