{'fraction_non_alphanumeric': 0.018136850783182192, 'fraction_numerical': 0.0, 'mean_word_length': 5.1938775510204085, '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}}
A robust crew pairing based on Multi-agent Markov Decision Processes

Airline scheduling is a real challenge in the context of the airline industry; this includes a lot of planning and operational decision problems and deals with a large number of interdependent resources. A prominent problem in airline scheduling is crew scheduling, specially pairings or Tour-of-Duty planning problem. The objective is to ensure optimal allocation of crews to flights by specifying the set of pairings that minimize the planned cost. The widely used algorithms assume no disruptions. However, airline operations often undergo stochastic disturbances that have to be taken into account in order to minimize the real operating cost. Recently, great interest has been given to robust crew scheduling with consideration of the stochastic nature of disturbances like technical breakdowns or bad weather conditions. In this paper, we develop a stochastic model of crew pairing problem based on Multi-agent Markov Decision Processes (MMDP); thus, the problem will be treated as finding the optimal policy to adopt in stochastic cases of disturbances. Also, a computational study is conducted to ensure validity of our proposed model.