{'fraction_non_alphanumeric': 0.013295346628679962, 'fraction_numerical': 0.0, 'mean_word_length': 5.2, '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}}
The Static Rebalancing Problem in Bicycle-Sharing Systems with Unusable Bicycles

This paper addresses the static bicycle rebalancing problem with multiple vehicles and multiple visits. The objective is to rebalance the stations of a bicycle-sharing system to reach the target number of good bicycles minimizing the total travelling time using a fleet of homogeneous vehicles. The vehicles have identical capacities and service time limits, and are allowed to visit the stations multiple times. One major challenge is that the unusable bicycles and the maintenance operations of bicycles are considered. In this paper, we propose a mixed integer programming model for solving the problem. The repair station is introduced to the model and all unusable bicycles at stations are delivered to the repair station. Considering the possibility of being outsourced to a third-party service company, our study requires that all vehicles depart from and return to the depot with no bicycles. The mathematical formulation of the problem is computationally tested.