An Airspace-Planning and Collaborative Decision-Making Model: Part II--Cost Model, Data Considerations, and Computations

Sherali, Hanif D.; Staats, Raymond W.; Trani, Antonio A.
May 2006
Transportation Science;May2006, Vol. 40 Issue 2, p147
Academic Journal
In Part I of this paper, we presented a large-scale airspace-planning and collaborative decision-making (APCDM) model that is part of a Federal Aviation Administration (FAA)-sponsored effort to enhance the management of the National Airspace System (NAS). Given a set of flights that must be scheduled during some planning horizon, along with alternative surrogate trajectories for each flight, we developed a mixed-integer programming model to select a set of flight plans from among these alternatives, subject to flight safety, airtraffic control workload, and airline equity considerations. The present paper offers insights related to, and a detailed description of, implementing this APCDM model, including the development of a comprehensive cost model, a study for prescribing a set of appropriate parameter values for the overall model, and an investigation on incorporating a suitable set of valid inequalities in the model formulation. Computational results are presented based on several test cases derived from the Enhanced Traffic Management System (ETMS) data provided by the FAA. The results indicate that under plausible probabilistic trajectory error assumptions and with the incorporation of star subgraph convex hull-based valid inequalities, the model offers a viable tool that can be used by the FAA for both tactical and strategic applications.


Related Articles

  • Ordered Weighted Disagreement Functions. Contreras, I. // Group Decision & Negotiation;May2012, Vol. 21 Issue 3, p345 

    In this paper a preference aggregation procedure is proposed for those cases in which decision-makers express their preferences by means of a ranking of alternatives. Among the most commonly applied methods for this purpose are those based on distance measures between individual and collective...

  • UNNETWORKS, WITH APPLICATIONS TO IDLE TIME SCHEDULING. Bartholdi III, John J.; Ratliff, H. Donald // Management Science;Apr1978, Vol. 24 Issue 8, p850 

    Integer linear programs with 0-1 constraint matrices arise frequently in scheduling and staffing models. For many such problems it is natural to model processor availability by columns of the constraint matrix, where l's indicate processor availability for production and 0's indicate idle...

  • Competitive transportation problems. Ishii, Hiroaki // Central European Journal of Operations Research;Feb2004, Vol. 12 Issue 1, p71 

    This paper extends the classical transportation model to the competitive one that demand nodes are divided into some groups. In a classical transportation problem all demand nodes cooperate and reduce the total cost of all transportation costs, and so transportation cost of goods into some...

  • SINGLE-MACHINE SCHEDULING OF UNIT-TIME JOBS WITH EARLINESS AND TARDINESS PENALTIES. Verma, Sushil; Dessouky, Maged // Mathematics of Operations Research;Nov98, Vol. 23 Issue 4, p930 

    The problem of determining a schedule of jobs with unit-time lengths on a single machine that minimizes the total weighted earliness and tardiness penalties with respect to arbitrary rational due-dates is formulated as an integer programming problem. We show that if the penalties meet a certain...

  • Equitable Models for the Stochastic Ground-Holding Problem Under Collaborative Decision Making. Kotnyek, Balázs; Richetta, Octavio // Transportation Science;May2006, Vol. 40 Issue 2, p133 

    The adoption of collaborative decision making within the ground-delay program rendered obsolete much of the published research on the ground-holding problem as the emphasis was on control of individual flights. We focus on two pertinent static-stochastic models that exercise control on groups of...

  • The opportunistic replacement problem: theoretical analyses and numerical tests. Almgren, Torgny; Andréasson, Niclas; Patriksson, Michael; Strömberg, Ann-Brith; Wojciechowski, Adam; Önnheim, Magnus // Mathematical Methods of Operations Research;Dec2012, Vol. 76 Issue 3, p289 

    We consider a model for determining optimal opportunistic maintenance schedules w.r.t. a maximum replacement interval. This problem generalizes that of Dickman et al. (J Oper Res Soc India 28:165-175, ) and is a natural starting point for modelling replacement schedules of more complex systems....

  • AN INTERACTIVE ALGORITHM FOR SOLVING INTEGER GOAL PROGRAMMING PROBLEMS. Suwendy, Maries; Sinuhaji, Theresa A.; Maulana, B.; Prana, Afen; Elyakin, Victor A.; Zarlis, M. // AIP Conference Proceedings;6/20/2011, Vol. 1337 Issue 1, p218 

    Integer goal programming problems arise quite naturally in many real-world applications. In this paper, we propose a reference direction approach and interactive algorithm to solve integer goal programming problem. We use analytic hierarchy process (AHP) to get the reference direction. At each...

  • An Integer Programming Approach to the Bandwidth Packing Problem. Kyungchul Park; Seokhoon Kang; Sungsoo Park // Management Science;Sep96, Vol. 42 Issue 9, p1277 

    We consider the bandwidth packing problem arising from telecommunication networks. The problem is to determine the set of calls and an assignment of them to the paths in an arc-capacitated network to maximize profit. We propose an algorithm to solve the integer programming formulation of the...

  • A LINEAR PROGRAMMING SOLUTION TO THE GENERAL SEQUENCING PROBLEM. von Lanzenauer, Christoph Haehling; Himest, Richard C. // CORS Journal;Jul70, Vol. 8 Issue 2, p129 

    This paper presents, for the general sequencing problem, an integer linear programming formulation with a special structure. The basic feature of the model, which differs from previous integer programming formulations, is that the coefficients in the constraints are zeros and ones only. The...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics