Home > Papers

 
 
Research on the Flight Gate Pre-Assignment Problem Based on Dynamic Programming-Indefinite Length Tabu Search
Zhang Gaotian,Zhuang Yufeng *
Modern Post School, Beijing University of Posts and Telecommunications, Beijing 100876;Modern Post School, Beijing University of Posts and Telecommunications, Beijing 100876
*Correspondence author
#Submitted by
Subject:
Funding: none
Opened online:18 March 2022
Accepted by: none
Citation: Zhang Gaotian,Zhuang Yufeng.Research on the Flight Gate Pre-Assignment Problem Based on Dynamic Programming-Indefinite Length Tabu Search[OL]. [18 March 2022] http://en.paper.edu.cn/en_releasepaper/content/4756790
 
 
The increasing popularity of air transportation as national income rises and the e-commerce and logistics industry grows means that more and more flights need to stop in airports. In addition, due to the advent of COVID-19, more and more cargo flights are transporting anti-epidemic materials, which further increases the difficulty of flight scheduling and parking space allocation. In this paper, we investigate the flight gate pre-assignment problem to reduce the pressure on airports. Firstly, this paper establishes a gate pre-assignment model with multiple objectives based on real flight ground operation processes and gate pre-assignments scenarios. Secondly, this paper proposes a dynamic programming-indefinite length tabu search algorithm to solve the model. Finally, this paper verifies the effectiveness and superiority of the algorithm through experiments.
Keywords:Transportation Planning and Management; Flight gate assignment; Tabu search; Indefinite tabu length; Dynamic programming
 
 
 

For this paper

  • PDF (0B)
  • ● Revision 0   
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags

Add yours

Related Papers

Statistics

PDF Downloaded 3
Bookmarked 0
Recommend 0
Comments Array
Submit your papers