Abstract 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.
A recourse goal programming approach for airport bus routing problem
Annals of Operations Research ; 251 , 1 ; 383-396
2015-04-02
14 pages
Article (Journal)
Electronic Resource
English
Selective vehicle routing problems under uncertainty without recourse
Online Contents | 2014
|Goal Programming Model for Airport Ground Support Equipment Parking
Springer Verlag | 2002
|A hybrid recourse policy for the vehicle routing problem with stochastic demands
Online Contents | 2019
|A Paired-Vehicle Recourse Strategy for the Vehicle-Routing Problem with Stochastic Demands
Online Contents | 2007