TITLE

Airline Scheduling and Routing in a Hub-and-Spoke System

AUTHOR(S)
Dobson, Gregory; Lederer, Phillip J.
PUB. DATE
August 1993
SOURCE
Transportation Science;Aug93, Vol. 27 Issue 3, p281
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
This paper studies the competitive choice of flight schedules and route prices by airlines operating in a hub-and-spoke system. Airlines choose flight schedules and route prices to maximize profit, considering competitors' decisions. This research makes three contributions. First, an expression is derived calculating demand for each route as a function of the service quality and prices of all routes. Second, a mathematical programming heuristic is developed to find the schedule and prices that maximize an airline's profit against fixed schedules and prices for other airlines. Third, the heuristic is used to study competition by allowing each airline to optimize its schedule and prices against the others' choices and by searching for an equilibrium. The performance of the algorithm is evaluated against alternate heuristics and a five-city sample problem is presented. Finally, two competitive examples are presented and analyzed.
ACCESSION #
6799615

 

Related Articles

  • New Heuristics to Stochastic Dynamic Lot Sizing Problem. Şenyığıt, Ercan // Gazi University Journal of Science;Apr2009, Vol. 22 Issue 2, p97 

    Simultaneous consideration of both demand and price uncertainties is not studied extensively in the literature. This problem is mathematically intractable for cases where complex problem structure exists. This study proposes new heuristics that consider demand and purchasing price uncertainties...

  • The Multiregion Dynamic Capacity Expansion Problem, Part I. Fong, C. O.; Srinivasan, V. // Operations Research;Jul/Aug81, Vol. 29 Issue 4, p787 

    Consider the problem of determining a schedule of capacity expansions for m producing regions and a schedule of shipments from the regions to n markets so as to meet the market demands over a T-period planning horizon at minimum discounted capacity expansion and shipment costs. Both of these...

  • INVENTORY CONTROL WITH PROBABILISTIC DEMAND AND PERIODIC WITHDRAWALS. Hausman, Warren H.; Thomas, L. Joseph // Management Science;Jan1972 Part 1, Vol. 18 Issue 5, p265 

    Many manufacturing firms produce component parts both for assembly into new products and to meet orders for spare parts. An inventory model for this situation would involve two types of demands: probabilistic demand as spares and deterministic (or scheduled) withdrawals as components for...

  • Russia Bridges Cargo Service. Keane, Angela Greiling // Traffic World;5/31/2004, Vol. 268 Issue 22, p39 

    Reports on the inauguration of the first scheduled all-cargo flight service from Beijing to Luxembourg by AirBridge Cargo company in Russia. Enhancement on the quality of service; Expansion on the market share of the firm; Level of competitive advantage.

  • Improving connectivity at hub airports. VELDHUIS, JAN // Journal of Airport Management;Spring2013, Vol. 7 Issue 2, p136 

    The paper addresses some critical success factors of hub development. Some factors are 'natural' and not to be influenced by any policies, such as the geographical location strength of the home markets of the hub airport. Other factors are more 'strategic', such as acquiring traffic rights,...

  • WHEN IS THE CLASSROOM ASSIGNMENT PROBLEM HARD? Carter, Michael W.; Tovey, Craig A. // Operations Research;Jan/Feb92 Supplement 1, Vol. 40 Issue 1, p28 

    The classroom assignment (or hotel room or interval scheduling) problem is to assign classes, which meet at different time intervals, to rooms. Two classes may not meet simultaneously in the same room, nor may a class meet in two different rooms. Thousands of colleges and secondary schools face...

  • Heuristic-Programming Solution of a Flowshop-Scheduling Problem. Krone, Martin J.; Steiglitz, Kenneth // Operations Research;May/Jun74, Vol. 22 Issue 3, p629 

    This paper considers the static flowshop-scheduling problem with the objective of minimizing, as a cost function, the mean job-completion time. Within the more general framework of combinatorial optimization problems, it defines a heuristic search technique--an approach that has been successful...

  • A Guaranteed-Accuracy Round-off Algorithm for Cyclic Scheduling and Set Covering. Bartholdi III, John J. // Operations Research;May/Jun81, Vol. 29 Issue 3, p501 

    The problem of cyclic staff scheduling is solved by a linear programming round-off heuristic for which a bound on the absolute error is established. The quality of the bound is independent of the resource requirements. Moreover, the quality of the bound improves as the matrix of resource...

  • An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal. Wenxue Han; Dejax, Pierre // Annals of Operations Research;1994, Vol. 50 Issue 1-4, p263 

    We are concerned in this paper with solving an n jobs, M machines flowshop scheduling problem where the objective function is the minimization of the makespan. We take into account setup, processing and removal times separately. After drawing up a synthesis of existing work which addresses this...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

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

Try another library?
Sign out of this library

Other Topics