Annals of Operations Research

, Volume 251, Issue 1–2, pp 383–396 | Cite as

A recourse goal programming approach for airport bus routing problem

  • Fouad Ben Abdelaziz
  • Hatem Masri
  • Houda Alaya


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.


Multi-objective stochastic vehicle routing problem Multi-objective stochastic programming Taxi planning Airport routing problems 


  1. Ben Abdelaziz, F. (2012). Solution approaches for the multiobjective stochastic programming. European Journal of Operational Research, 216(1), 1–16.CrossRefGoogle Scholar
  2. Bertsimas, D. J., & Van Ryzin, G. (1993). Stochastic and dynamic vehicle routing in the Euclidean plane with multiple capacitated vehicles. Operations Research, 41(1), 60–76.CrossRefGoogle Scholar
  3. Bianchi, L., Birattari, M., Chiarandini, M., Manfrin, M., Mastrolilli, M., Paquete, L., Rossi-Doria, O., & Schiavinotto, T. (2004). Metaheuristics for the vehicle routing problem with stochastic demands. In X. Yao, E. Burke, J. A. Lozano, J. Smith, J. J. Merelo Guervos, J. A. Bullinaria, J. Rowe, P. Tino, A. Kaban, & H.-P. Schwefel (Eds.), Proceedings of the 8th International Conference on Parallel Problem Solving from Nature (PPSN VIII), vol 3242 of Lecture Notes in Computer Science, (pp. 450–460). Berlin: Springer.Google Scholar
  4. Deng, C. C., Ong, H. L., Ang, B. W., & Goh, T. N. (1992). A modelling study of a taxi service operation. International Journal of Operations & Production Management, 12(11), 65–78.CrossRefGoogle Scholar
  5. Desrochers, M., & Laporte, G. (1991). Improvements and extensions to the Miller–Tucker–Zemlin subtour elimination constraints. Operations Research Letters, 10(1), 27–36.CrossRefGoogle Scholar
  6. Dror, M., Laporte, G., & Trudeau, P. (1989). Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Science, 23(3), 166–176.CrossRefGoogle Scholar
  7. Fan, J. (2011). The vehicle routing problem with simultaneous pickup and delivery based on customer satisfaction. Procedia Engineering, 15, 5284–5289.CrossRefGoogle Scholar
  8. Gendreau, M., Laporte, G., & Séguin, R. (1995). An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transportation Science, 29(2), 143–155.CrossRefGoogle Scholar
  9. Gendreau, M., Laporte, G., & Séguin, R. (1996). Stochastic vehicle routing. European Journal of Operational Research, 88(1), 3–12.CrossRefGoogle Scholar
  10. Jozefowiez, N., Semet, F., & Talbi, E. G. (2008). Multi-objective vehicle routing problems. European Journal of Operational Research, 189(2), 293–309.CrossRefGoogle Scholar
  11. Laporte, G., & Louveaux, F. V. (1993). The integer L-shaped method for stochastic integer programs with complete recourse. Operations Research Letters, 13(3), 133–142.CrossRefGoogle Scholar
  12. Murata, T., & Itai, R. (2007). Local search in two-fold EMO algorithm to enhance solution similarity for multi-objective vehicle routing problems. In: S. Obayashi, K. Deb, C. Poloni, T. Hiroyasu and T. Murata (Eds.), EMO 2007 Vol. 4403, (pp. 201–215). Springer-Verlag.Google Scholar
  13. Osman, I. H., & Laporte, G. (1996). Metaheuristics: A bibliography. Annals of Operations Research, 63(5), 511–623.CrossRefGoogle Scholar
  14. Shen, Z., Ordónez, F., & Dessouky, M. M. (2009). The stochastic vehicle routing problem for minimum unmet demand. chap. IV. Springer Optimization and Its Applications (pp. 349–371). Boston, MA: Springer.Google Scholar
  15. Stewart, W. R, Jr, & Golden, B. L. (1983). Stochastic vehicle routing: A comprehensive approach. European Journal of Operational Research, 14(4), 371–385.CrossRefGoogle Scholar
  16. Tan, K. C., Cheong, C. Y., & Goh, C. K. (2007). Solving multiobjective vehicle routing problem with stochastic demand via evolutionary computation. European Journal of Operational Research, 177(2), 813–839.CrossRefGoogle Scholar
  17. Teodorović, D., & Pavković, G. (1992). A simulated annealing technique approach to the vehicle routing problem in the case of stochastic demand. Transportation Planning and Technology, 16(4), 261–273.CrossRefGoogle Scholar
  18. Tillman, F. A. (1969). The multiple terminal delivery problem with probabilistic demands. Transportation Science, 3(3), 192–204.CrossRefGoogle Scholar
  19. Wang, C. H., & Li, C. H. (2011). Optimization of an established multi-objective delivering problem by an improved hybrid algorithm. Expert Systems with Applications, 38(4), 4361–4367.CrossRefGoogle Scholar
  20. Zhao, Y., Li, C., Zhang, J. L., Ren, X., & Ren, W. (2012). Research on vehicle routing problem with stochastic demand based on multi-objective method. In D.S. Huang, Y. Gan, V. Bevilacqua & J. C. Figueroa (Eds.), Advanced Intelligent Computing, Lecture Notes in Computer Science, vol. 6838, (pp. 153–161). Springer: Berlin.Google Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  • Fouad Ben Abdelaziz
    • 1
  • Hatem Masri
    • 2
  • Houda Alaya
    • 3
  1. 1.NEOMA Business SchoolMont-Saint-AignanFrance
  2. 2.College of Business AdministrationUniversity of BahrainSakhirKingdom of Bahrain
  3. 3.Institut Supérieur de GestionUniversity of TunisLe BardoTunisia

Personalised recommendations