A decision support framework for multi-fleet routing and multi-stop flight scheduling

Transportation Research Part A: Policy and Practice

Volumn 30, Issue 5 PART A, 1996, Pages 379-398

  Yan, Shangyao ^a   Young, Hwei Fwa ^a  

^a NATIONAL CENTRAL UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

AIR TRANSPORT; DECISION SUPPORT SYSTEM; FLIGHT SCHEDULING; MULTIFLEET ROUTING; TRANSPORT PLANNING;

AIR TRAFFIC CONTROL; ALGORITHMS; CARGO AIRCRAFT; DECISION SUPPORT SYSTEMS; SIMULATION;

MULTI-FLEET ROUTING; MULTI-STOP FLIGHT SCHEDULING;

AIR TRANSPORTATION;

EID: 0030244759     PISSN: 09658564     EISSN: None     Source Type: Journal    
DOI: 10.1016/0965-8564(95)00029-1     Document Type: Article

References (24)

1. Abara J. (1989) Applying integer linear programming to the fleet assignment problem. Interfaces 19, 20-28.
2. Ahuja R. K., Magnanti T. L. and Orlin J. B. (1993) Network Flows, Theory, Algorithms, and Applications. Prentice Hall, Englewood Cliffs.
3. Balakrishnan A., Chien T. and Wong R. (1990) Selecting aircraft routes for long-haul operations: a formulation and solution method. Transpn Res. 24B, 57-72.
4. Camerini P. K., Fratta L. and Maffioli F. (1975) On improving relaxation methods by modified gradient techniques. Mathl. Progm. Stud. 3, 6-25.
5. China Airlines (1993) China Airlines Annual Report 1992. Taipei, R.O.C.
6. Civil Aeronautics Administration (1984) CAA's Fare Regulation for Using Airport Buildings, Land, and Other Relative Equipment. Ministry of Transportation and Communication, Taipei, R.O.C.
7. Etschmaier M. and Mathaisel D. (1984) Aircraft scheduling: The state of the art. AGIFORS XXIV, 181-209.
8. Fisher M. L. (1981) The Lagrangian relaxation method for solving integer programming problems. Mgmt. Sci. 27, 1-18.
9. Fisher M. L. (1985) An application oriented guide to Lagrangian relaxation. Interfaces 15, 10-21.
10. Garey M. R. and Johnson D. S. (1979) Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman & Company, San Francisco.
11. Hyman W. and Gordon L. (1978) Commercial airline scheduling technique. Transpn Res. 12, 23-29.
12. Jarrah A. I., Yu G., Krishnamurthy N. and Rakshit A. (1993) A decision support framework for airline flight cancellations and delays. Transpn Sci. 27, 266-280.
13. Kennington J. L. and Helgason R. V. (1980) Algorithms for Network Programming, John Wiley, New York.
14. Lee B. C. (1986) Routing Problem With Service Choices. Flight Transportation Laboratory, Report R86-4, Massachusetts Institute of Technology, MA.
15. Levin A. (1969) Some Fleet Routing and Scheduling Problems for Air Transportation Systems. Flight Transportation Laboratory, Report R-68-5, Massachusetts Institute of Technology, MA.
16. Levin A. (1971) Scheduling and fleet routing models for transportation systems. Transpn Sci. 5, 232-255.
17. Powell W. B. (1989) A review of sensitivity results for linear networks and a new approximation to reduce the effects of degeneracy. Transpn Sci. 23, 231-243.
18. Powell W. B. and Ioannis A. K. (1992) Shipment routing algorithms with tree constraints. Transpn Sci. 26, 230-245.
19. Simpson R. W. (1969) Scheduling and Routing Models for Airline Systems. Flight Transportation Laboratory, Report R-68-3. Massachusetts Institute of Technology, MA.
20. Teodorovic D. (1988) Airline Operation Research. Gordon and Breach Science, New York.
21. Teodorovic D. and Guberinic S. (1984) Optimal dispatching strategy on an airline network after a schedule perturbation. Eur. J. Oper. Res. 15, 178-182.
22. Teodorovic D. and Krcmar-Nozic E. (1989) Multicriteria model to determine flight frequencies on an airline network under competitive conditions. Transpn Sci. 23, 14-25.
23. Yan S. (1991) Intermodal Pricing and Operations Using Network Flow Techniques. Ph.D. Dissertation, Department of Civil Engineering, Massachusetts Institute of Technology.
24. Yan S., Bernstein D. and Sheffi Y. (1995) Intermodal pricing using network flow techniques. Transpn Res. 29B, 171-180.