{'fraction_non_alphanumeric': 0.0187192118226601, 'fraction_numerical': 0.0, 'mean_word_length': 5.554838709677419, '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}}
Optimizing Ridesharing Services for Airport Access

This paper addresses the problem of optimally routing and scheduling airport shuttle vehicles that offer pickup and drop-off services to customers through ridesharing. This problem, which is a version of the dial-a-ride problem, is formulated as a mixed integer program. For the solution, an exact approach applying constraint programming in a column generation framework and the adaptation of two existing heuristics are proposed. Implementations of the mathematical program and proposed solution approaches for three operational policies are presented. The performance of the proposed approaches in regard to computational requirements and solution quality was evaluated in a real-world case study involving service records for one service day out of Washington, D.C., Dulles International Airport in Chantilly, Virginia, provided by an actual airport shuttle service provider. Results show that the heuristics provide good approximations to the exact solution.