ASBSP Data Set

Published: 4 September 2020| Version 11 | DOI: 10.17632/tt6zhyr3n9.11
Nihat ONER,
Hakan Gultekin,
Çağrı Koç


These data sets contain benchmark instances for airport shuttle scheduling problem which is introduced in the paper titled "The Airport Shuttle Bus Scheduling Problem". The Airport Shuttle Bus Scheduling Problem, ASBSP, the incoming passengers are transferred from the airport to the city center and the outgoing passengers are transferred from the city center to the airport using a number of identical, capacitated vehicles. The flight schedule and the number of passengers that uses the transfer service from each flight are known. The passengers have their associated ready times and due dates, which are associated with their flight times and allowable waiting times. Revenue is earned from each transferred customer. On the other hand, there is a transfer cost associated with empty and loaded transfers of the vehicle. Since this is a private company that aims to maximize the profit, it is possible to reject some customer requests (if it will result in low utilization of the vehicle). In order to maximize the utilization of the vehicles, it is also allowed to split or group the transfer requests of passengers from different flights without overriding allowable waiting time limits. The problem is to determine the schedule of the vehicles and the assignment of the passengers to these vehicles in order to maximize the total profit. You can find the details about parameters used in the instances in "explanation.txt" file. If you find any errors, want to comment, have any suggestions or have any additional benchmark instances, you are welcomed to share and write an e-mail to or or