The airport gate assignment problem: a survey
- 1 Industrial Engineering Department, College of Engineering, King Saud University, P.O. Box 800, Riyadh 11421, Saudi Arabia.
- PMID: 25506074
- PMCID: PMC4258332
- DOI: 10.1155/2014/923859
The airport gate assignment problem (AGAP) is one of the most important problems operations managers face daily. Many researches have been done to solve this problem and tackle its complexity. The objective of the task is assigning each flight (aircraft) to an available gate while maximizing both conveniences to passengers and the operational efficiency of airport. This objective requires a solution that provides the ability to change and update the gate assignment data on a real time basis. In this paper, we survey the state of the art of these problems and the various methods to obtain the solution. Our survey covers both theoretical and real AGAP with the description of mathematical formulations and resolution methods such as exact algorithms, heuristic algorithms, and metaheuristic algorithms. We also provide a research trend that can inspire researchers about new problems in this area.
- Research Support, Non-U.S. Gov't
- Data Collection*
- Nonlinear Dynamics
- Stochastic Processes
Help | Advanced Search
Title: simulating the flight gate assignment problem on a trapped ion quantum computer.
Abstract: We study the flight gate assignment problem on IonQ's Aria trapped ion quantum computer using the variational quantum eigensolver. Utilizing the conditional value at risk as an aggregation function, we demonstrate that current trapped ion quantum hardware is able to obtain good solutions for this combinatorial optimization problem with high probability. In particular, we run the full variational quantum eigensolver for small instances and we perform inference runs for larger systems, demonstrating that current and near-future quantum hardware is suitable for addressing combinatorial optimization problems.
- Download PDF
- Other Formats
References & Citations
- INSPIRE HEP
- Google Scholar
- Semantic Scholar
BibTeX formatted citation
Bibliographic and Citation Tools
Code, data and media associated with this article, recommenders and search tools.
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .
Solving airport gate assignment problem using Genetic Algorithms approach
- Change Username/Password
- Update Address
- Payment Options
- Order History
- View Purchased Documents
- Communications Preferences
- Profession and Education
- Technical Interests
- US & Canada: +1 800 678 4333
- Worldwide: +1 732 981 0060
- Contact & Support
- About IEEE Xplore
- Nondiscrimination Policy
- Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity. © Copyright 2023 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.