A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem

References

• Aardal K., Pochet Y., Wolsey L. A. Capacitated Facility Location: Valid Inequalities and Facets. Math. Opns. Res. (1995) 20:562–582Link, Google Scholar
• Aardal K. Reformulations of Capacitated Facility Location Problems: How Redundant Information Can Help. (1997) . Working Paper, Department of Computer Science, Utrecht University, Utrecht, The NetherlandsGoogle Scholar
• Ahuja R. K., Magnanti T. L., Orlin J. B.Network Flows, Theory, Algorithms and Applications (1993) (Prentice Hall)Google Scholar
• Akinc U., Khumawala B. M. An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem. Management Sci. (1977) 23:585–594Link, Google Scholar
• Balakrishnan A., Magnanti T. L., Mirchandani P., Dell'amico M., Maffioli F., Martello S. Network Design. Annotated Bibliographies in Combinatorial Optimization (1997) (Wiley, Chichester, U.K) Google Scholar
• Barnhart C., Scheur R. R. Air Network Design for Express Shipment Service. Opns. Res. (1996) 44:852–863Link, Google Scholar
• Beasley J. E. An Algorithm for Solving Large Capacitated Warehouse Location Problems. Eur. J. Oper. Res. (1988) 33:314–325Crossref, Google Scholar
• Beasley J. E. Lagrangean Heuristics for Location Problems. Eur. J. Oper. Res. (1993) 65:383–399Crossref, Google Scholar
• Braklow J. W., Graham W. W., Hassler S. M., Peck K. E., Powell W. B. Interactive Optimization Improves Service and Performance for Yellow Freight System. Interfaces (1989) 22:147–172Link, Google Scholar
• Büdenbender K. Entwicklung und Implementierung von Lösungsverfahren für das Direktflugproblem. (1998) . Diploma thesis (in German), Lehrstuhl für Unternehmensforschung, RWTH Aachen, GermanyGoogle Scholar
• Christofides N., Beasley J. E. Extensions to a Lagrangean Relaxation Approch for The Capacitated Warehouse Location Problem. Eur. J. Oper. Res. (1983) 12:19–28Crossref, Google Scholar
• Crainic T. G., Laporte G. Planning Models for Freight Transportation. Eur. J. Oper. Res. (1997) 97:409–438Crossref, Google Scholar
• Cornuéjols G., Fisher M. L., Nemhauser G. L. Location of Bank Accounts to Optimize Float: An Analytical Study of Exact and Approximate Algorithms. Management Sci. (1977) 23:789–810Link, Google Scholar
• Cornuéjols G., Sridharan R., Thizy J. M. A Comparison of Heuristics and Relaxations for the Capacitated Plant Location Problem. Eur. J. Oper. Res. (1991) 50:280–297Crossref, Google Scholar
• Using the Cplex Callable Library (1995) (Cplex Optimization, Inc., Incline Village, NV) . CplexGoogle Scholar
• Daskin M. S.Network and Discrete Location, Models, Algorithms, and Applications (1995) (Wiley, New York) Crossref, Google Scholar
• Dejax P. J., Crainic T. G. A Review of Empty Flows and Fleet Management Models in Freight Transportation. Transp. Sci. (1987) 21:227–247Link, Google Scholar
• Feldman E., Lehrer F. A., Ray T. L. Warehouse Location under Continuous Economies of Scale. Management Sci. (1966) 12:670–684Link, Google Scholar
• Garey M. R., Johnson D. S.Computers and Intractability. A Guide to the Theory of NP-Completeness (1979) (W. H. Freeman and Company, New York) Google Scholar
• Geoffrion A., Mcbride R. Lagrangean Relaxation Applied To Capacitated Facility Location Problems. AIIE Trans. (1978) 10:40–47Crossref, Google Scholar
• Glover F. Future Paths for Integer Programming and Links to Artificial Intelligence. Comput. Opns. Res. (1986) 13:533–549Crossref, Google Scholar
• Glover F. Candidate List Strategies and Tabu Search. (1989) . Working Paper, Graduate School of Business, University of Colorado at Boulder, COGoogle Scholar
• Glover F., Klingman D., Phillips N.Network Models In Optimization And Their Applications In Practice (1992) (Wiley, New York) Crossref, Google Scholar
• Glover F., Laguna M.Tabu Search (1997) (Kluwer, Boston) Crossref, Google Scholar
• Irnich S. A Multi-Depot Pickup-and-Delivery Problem with a Single Hub and Heterogeneous Vehicles. Eur. J. Oper. Res. (1999) . to appearGoogle Scholar
• Jacobsen S. K. Heuristics for the Capacitated Plant Location Model. Eur. J. Oper. Res. (1983) 12:253–261Crossref, Google Scholar
• Kuehn A. A., Hamburger M. J. A Heuristic Program for Locating Warehouses. Management Sci. (1963) 9:643–666Link, Google Scholar
• Labbé M., Louveaux F. V., Dell'amico M., Maffioli F., Martello S. Location Problems. Annotated Bibliographies in Combinatorial Optimization (1997) (Wiley, Chichester, U.K) Google Scholar
• Leung J. M. Y., Magnanti T. L., Singhal V. Routing in Point-to-Point Delivery Systems: Formulation and Solution Heuristics. Transp. Sci. (1990) 24:245–259Link, Google Scholar
• Magnanti T. L., Wong R. T. Network Design and Transportation Planning. Transp. Sci. (1984) 18:1–55Link, Google Scholar
• Mautor T., Michelon P. Mimausa: A New Hybrid Method Combining Exact Solution and Local Search. (1997) Sophia Antipolis, FranceTalk Presented at the 2nd International Conference on MetaheuristicsGoogle Scholar
• Powell W. B., Sheffi Y. Design and Implementation of an Interactive Optimization System for Network Design in the Motor Carrier Industry. Opns. Res. (1992) 37:12–29Link, Google Scholar
• Sridharan R. The Capacitated Plant Location Problem. Eur. J. Oper. Res. (1995) 87:203–213Crossref, Google Scholar
• Van Roy T. J. A Cross Decomposition Algorithm for Capacitated Facility Location. Opns. Res. (1986) 34:145–163Link, Google Scholar