A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model

References

• Aarts E., Lenstra J. K.Local Search in Combinatorial Optimization (1997) (John Wiley and Sons, New York) Google Scholar
• Abara J. Applying integer linear programming to the fleet assignment problem. Interfaces (1989) 19:20–28Link, Google Scholar
• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows: Theory, Algorithms and Applications (1993) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Ahuja R. K., Orlin J. B., Sharma D. A composite neighborhood search algorithm for the capacitated minimum spanning tree problem. Oper. Res. Lett. (2001a) 31:185–194Crossref, Google Scholar
• Ahuja R. K., Orlin J. B., Sharma D. Multi-exchange neighborhood search algorithms for the capacitated minimum spanning tree problem. Math. Programming (2001b) 91:71–97Crossref, Google Scholar
• Ahuja R. K., Ergun O., Orlin J. B., Punnen A. P. A survey of very large-scale neighborhood search techniques. Discrete Appl. Math. (2002) 123:75–102Crossref, Google Scholar
• Bard J. F., Hopperstad C. A. Improving through-flight schedules. IIE Trans. (1987) 19:242–251Crossref, Google Scholar
• Barnhart C., Talluri K. T., McGarity A., ReVellepp C. Airlines operations research. Design and Operation of Civil and Environmental Engineering Systems (1997) (Wiley Interscience, New York) 435–469Google Scholar
• Barnhart C., Boland N. L., Clarke L. W., Johnson E. L., Nemhauser G. L., Shenoi R. Flight string models for aircraft fleeting and routing. Transportation Sci. (1998) 32:208–219Link, Google Scholar
• Berge M. E., Hopperstad C. A. Demand driven dispatch: A method for dynamic aircraft capacity assignment, models and algorithms. Oper. Res. (1993) 41:153–168Link, Google Scholar
• Clarke L. W., Hane C. A., Johnson E. L., Nemhauser G. L. Maintenance and crew considerations in fleet assignment. Transportation Sci. (1996) 30:249–260Link, Google Scholar
• Deineko V. G., Woeginger G. J. A study of exponential neighborhoods for the traveling salesman problem and for the quadratic assignment problem. Math. Programming (2000) 87:519–542Crossref, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer, Norwell, MA) Crossref, Google Scholar
• Gopalan R., Talluri K. T. Mathematical models in airline schedule planning: A survey. Ann. Oper. Res. (1998) 76:155–185Crossref, Google Scholar
• Gutin G., Yeo A., Zverovitch A., Gutin G., Punnen A. P. Exponential neighborhoods and domination analysis for the TSP. Traveling Salesman Problem and Its Variations (2003) (Kluwer, Boston, MA) Google Scholar
• Hane C. A., Barnhart C., Johnson E. L., Marsten R. E., Nemhauser G. L., Sigmondi G. The fleet assignment problem: Solving a large-scale integer program. Math. Programming (1995) 70:211–232Crossref, Google Scholar
• Jarrah A. I. Z., Reeb J. C. An optimization model for assigning through flights. (1997) . Technical Document, United Airlines, Chicago, ILGoogle Scholar
• Subramanium R., Scheff R. P., Quillinan J. D., Wiper D. S., Marsten R. E. Coldstart: Fleet assignment at Delta Air Lines. Interfaces (1994) 24:104–120Link, Google Scholar
• Talluri K. T. Swapping applications in a daily fleet assignment. Transportation Sci. (1996) 31:237–248Link, Google Scholar
• Thompson P. M., Orlin J. B. The theory of cyclic transfers. (1989) . Working Paper OR 200-89, Operations Research Center, MIT, Cambridge, MAGoogle Scholar
• Thompson P. M., Psaraftis H. N. Cyclic transfer algorithms for multivehicle routing and scheduling problems. Oper. Res. (1993) 41:935–946Link, Google Scholar