Modeling and Resolution of the Allocation Problem of the Time Slots in Dakar Airport


  •  Youssouf Ahamada    
  •  Salimata Diagne    
  •  Amadou Coulibaly    
  •  D'ethi'e Dione    
  •  N'dogotar Nlio    
  •  Youssou Gningue    

Abstract

In this article, we proposed a programming linear model in integer numbers(PLIN) for the optimal allocation of the time slots in the  international  Leopold Sedar Senghor airport of Dakar (L.S.S). The slots  are specific allocated periods which allow an aircraft to land or take off in a saturated airport. Their attribution depends on the
configuration of the airport, more particularly on its capacity. We maximize the confirmed demand in each slot and take the number of aircrafts and the number of manageable passengers with an optimal quality service into account. We used the CPLEX software so that to test the effectiveness of the linear model. Firstly, in the proposed model linear in integer numbers, any unmet demand was isolated. Secondly, the rejected demands  by introducing a model and an algorithm of resolution based on the dynamic programming.


This work is licensed under a Creative Commons Attribution 4.0 License.
  • ISSN(Print): 1916-9795
  • ISSN(Online): 1916-9809
  • Started: 2009
  • Frequency: bimonthly

Journal Metrics

  • h-index (February 2019): 18
  • i10-index (February 2019): 48
  • h5-index (February 2019): 7
  • h5-median (February 2019): 10

( The data was calculated based on Google Scholar Citations. Click Here to Learn More. )

Contact