A LAGRANGIAN RELAXATION APPROACH TO ASSIGNING AIRCRAFT TO ROUTES IN HUB AND SPOKE NETWORKS

This paper introduces a model that can assist airline planners with hub and spoke networks in deploying their fleets as efficiently as possible. Specifically, an optimization model is outlined that assigns a fleet of aircraft of different types to routes to maximize profits. The Lagrangian procedure which is used is outlined together with heuristics for converting the Lagrangian solutions into primal feasible solutions and for improving on the solutions. Results, reported from 324 runs spanning a range of problem sizes, suggest that the Lagrangian relaxation is effective at providing an upper bound on the profits and the heuristics yield good solutions when the maximum number of aircraft required to fly all routes in the schedule is less than or equal to the number of available aircraft.

• Availability:
  • Find a library where document is available. Order URL: https://www.library.northwestern.edu/find-borrow-request/requests-interlibrary-loan/lending-institutions.html
• Authors:
  • Daskin, M S
  • PANAYOTOPOULOS, N D
• Publication Date: 1989-5

Media Info

• Features: Figures; References; Tables;
• Pagination: p. 91-99
• Serial:
  • Transportation Science
  • Volume: 23
  • Issue Number: 2
  • Publisher: Institute for Operations Research and the Management Sciences (INFORMS)
  • ISSN: 0041-1655
  • Serial URL: http://transci.journal.informs.org/

Subject/Index Terms

• TRT Terms: Heuristic methods; Hub and spoke systems; Lagrangian functions; Mathematical models; Maximization; Profits
• Old TRIS Terms: Aircraft route assignment
• Subject Areas: Aviation; Highways; Planning and Forecasting;

Filing Info

• Accession Number: 00485536
• Record Type: Publication
• Files: TRIS
• Created Date: Jul 31 1989 12:00AM