On interfacing multiobjective optimisation models: the case of the airport gate assignment problem
نویسندگان
چکیده
We present a method to capture decision maker’s preferences in multiobjective problems and we discuss its use as a base for a decision maker – multiobjective optimization model interface. We illustrate the idea on a small but illustrative numerical example of the airport gate assignment problem.
منابع مشابه
Benders’ decomposition algorithm to solve bi-level bi-objective scheduling of aircrafts and gate assignment under uncertainty
Management and scheduling of flights and assignment of gates to aircraft play a significant role to improve the performance of the airport, due to the growing number of flights and decreasing the flight times. This research addresses the assignement and scheduling problem of runways and gates simultaneously. Moreover, this research is the first study that considers the constraint of unavailabil...
متن کاملA Bi-Objective Airport Gate Scheduling with Controllable Processing Times Using Harmony Search and NSGA-II Algorithms
Optimizing gate scheduling at airports is an old, but also a broad problem. The main purpose of this problem is to find an assignment for the flights arriving at and departing from an airport, while satisfying a set of constraints.A closer look at the literature in this research line shows thatin almost all studies airport gate processing time has been considered as a fix parameter. In this res...
متن کاملAirport Gate Assignments Model and Algorithm
Airport gate assignment is to appoint a gate for the arrival or leave flight and to ensure that the flight is on schedule. Assigning the airport gate with high efficiency is a key task among the airport ground busywork. As the core of airport operation, aircraft gate assignment is known as a kind of complicated combinatorial optimization problem. This paper proposed robust assignment model to m...
متن کاملSolving the flight gate assignment problem using dynamic programming
This paper considers the problem of assigning flights to airport gates—a problem which is NP-hard in general. We focus on a special case in which the maximization of flight/gate preference scores is the only objective. We show that for a variable number of flights and gates, this problem is still NP-hard. For a fixed number of gates, we present a dynamic programming approach that solves the fli...
متن کاملTime-Dependence in Multi-Agent MDP Applied to Gate Assignment Problem
Many disturbances can impact gate assignments in daily operations of an airport. Gate Assignment Problem (GAP) is the main task of an airport to ensure smooth flight-to-Gate assignment managing all disturbances. Or, flights schedule often undergoes some unplanned disruptions, such as weather conditions, gate availability or simply a delay that usually arises. A good plan to GAP should manage as...
متن کامل