A threshold accepting algorithm for the uncapacitated single allocation hub location problem

References

• Abdinnour-Helm, S. 1998. “A hybrid heuristic for the uncapacitated hub location problem.” European journal of operational research 106(2–3): 489–499.
   Web of Science ®Google Scholar
• Abdinnour-Helm, S., and M. A. Venkataramanan. 1998. “Solution approaches to hub location problems.” Annals of operations research 78(1–4): 31–50.
   Google Scholar
• Alumur, S., and B. Y. Kara. 2008. “Network hub location problems: the state of the art.” European journal of operational research 190(1): 1–21.
   Web of Science ®Google Scholar
• Aykin, T. 1995. “Networking policies for hub-and-spoke systems with application to the air transportation system.” Transportation science 29(3): 201–221.
   Web of Science ®Google Scholar
• Campbell, J. F. 1994. “Integer programming formulations of discrete hub location problems.” European journal of operational research 72(2): 387–405.
   Web of Science ®Google Scholar
• Campbell, J. F. 1996. “Hub location and the p-hub median problem.” Operations research 44(6): 923–935.
   Web of Science ®Google Scholar
• Campbell, J. F., A. T. Ernst, and M. Krishnamoorthy. 2002. “Hub location problems.” In Facility location: applications and theory, edited by Z. Drezner and H. W. Hamacher, 373–408. Berlin: Springer.
   Google Scholar
• Chen, J. F. 2007. “A hybrid heuristic for the uncapacitated single allocation hub location problem.” Omega 35(2): 211–220.
   Web of Science ®Google Scholar
• Chen, C. H., and C. J. Ting. 2008. “Combining lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem.” Transportation research part E: logistics and transportation review 44(6): 1099–1122.
   Web of Science ®Google Scholar
• Chen, C.H., Ting, C.J., and Meng, L.H., 2009. A threshold accepting algorithm for the capacitated arc routing problem. In: Proceedings of the 10th Asia-Pacific conference on industrial engineering and management systems, 14–16 December, Kitakyushu, Japan, 1177–1185.
   Google Scholar
• Cunha, C. B., and M. R. Silva. 2007. “A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil.” European journal of operational research 179(3): 747–758.
   Web of Science ®Google Scholar
• Dongarra, J., 2011. Performance of various computers using standard linear equations software. Knoxville, TN: University of Mancheste, Report CS-89-85.
   Google Scholar
• Dueck, G., and T. Scheuer. 1990. “Threshold accepting: a general purpose optimization algorithm appearing superior to simulated annealing.” Journal of computational physics 90(1): 161–175.
   Web of Science ®Google Scholar
• Ernst, A. T., and M. Krishnamoorthy. 1996. “Efficient algorithms for the uncapacitated single allocation p-hub median problem.” Location science 4(3): 139–154.
   Google Scholar
• Ernst, A. T., and M. Krishnamoorthy. 1999. “Solution algorithms for the capacitated single allocation hub location problem.” Annals of operations research 86(1–4): 141–159.
   Google Scholar
• Hekmatfar, M., and M. Pishvaee. 2009. “Hub location problem.” In Facility location: concepts, models, algorithms and case studies, edited by R. Z. Farahani and M. Hekmatfar, 243–270. Berlin: Springer-Verlag.
   Google Scholar
• Labbé, M., and H. Yaman. 2004. “Projecting the flow variables for hub location problems.” Networks 44(2): 84–93.
   Web of Science ®Google Scholar
• Love, R.F., Morris, J.G., and Wsolowsky, G., 1988. Facility location: models and methods. Publications in operations research, 57, New York, NY: North-Holland.
   Google Scholar
• O’Kelly, M. E. 1986. “Activity levels at hub facilities in interacting networks.” Geographical analysis 18(4): 343–356.
   Web of Science ®Google Scholar
• O’Kelly, M. E. 1987. “A quadratic integer program for the location of interacting hub facilities.” European journal of operational research 32(3): 393–404.
   Web of Science ®Google Scholar
• O’Kelly, M. E. 1992. “Hub facility location with fixed costs.” Papers in regional science 71(3): 293–306.
   Google Scholar
• Silva, M. R., and C. B. Cunha. 2009. “New simple and efficient heuristics for the uncapacitated single allocation hub location problem.” Computers & operations research 36(12): 3152–3165.
   Web of Science ®Google Scholar
• Skorin-Kapov, D., J. Skorin-Kapov, and M. E. O’Kelly. 1996. “Tight linear programming relaxations of uncapacitated p-hub median problems.” European journal of operational research 94(3): 582–593.
   Web of Science ®Google Scholar
• Topcuoglu, H., et al. 2005. “Solving the uncapacitated hub location problem using genetic algorithms.” Computers & operations research 32(4): 967–984.
   Web of Science ®Google Scholar