A recourse goal programming approach for airport bus routing problem

In this paper, we address the airport bus routing problem (ABRP) described as follows: A company owns several buses located at the airport to transport customers from many hotels and meeting points back to the airport according to their departure times. The ABRP can be viewed as a stochastic vehicle routing problem as the presence of customers at meeting points is random. The aim is to construct a minimum cost set of vehicle routes that satisfies all customers' timing requests and to minimize the customer's traveling time and the airport waiting time. We propose a multi-objective stochastic program (MSP) to model the ABRP. We solve the MSP problem using a goal programming approach and a recourse approach where the recourse decision is to send a special vehicle to customers not served by bus tours. The proposed model is tested using a real life experimental data from a transportation company located in the Tunis-Carthage airport.