Abstract
Due to the uncertainty of flight arrival and departure times, the scheduling of apron vehicles in airports has always faced significant challenges. This paper considers the real-time scheduling problem of apron vehicles under dynamic requests, establishing a new parking rule to allow apron vehicles to dynamically adjust parking areas. In order to maximize service level and minimize operational costs, this paper proposes a proactive real-time scheduling method for apron vehicles based on mixed strategies. Through strategies such as flexible waiting and dynamic relocation, this paper responds proactively to future requests. The proposed strategies are validated through implementation in large and medium-sized scale cases at Beijing Capital International Airport and Nanjing Lukou International Airport in China, respectively. Numerical results indicate that the proposed scheduling method is effective and applicable. The flexible waiting strategy significantly reduces vehicle travel distance, while the dynamic relocation strategy is significant in shortening request response times.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.