|
[1]Abdinnour-Helm, S., 1998. A hybrid heuristic for the uncapacitated hub location problem. European Journal of Operational Research 106, 489-499. [2]Abdinnour-Helm, S., 2001. Using simulated annealing to solve the p-hub median problem. International Journal of Physical Distribution & Logistics Management 31, 203-220. [3]Abdinnour-Helm, S., Venkataramanan M.A., 1998. Solution approaches to hub location problems. Annals of Operational Research. 78, 31-50. [4]Aykin, T., 1990. On a quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research 46, 409-411. [5]Aykin, T., 1994. Largrangian relaxation based approaches to capacitated hub-and-spoke network design problem. European Journal of Operational Research 79, 501-523. [6]Aykin, T., 1995. Networking policies for hub-and-spoke systems with application to the air transportation system. Transportation Science 29(3), 201-221. [7]Aykin, T., 1995. The hub location and routing problem. European Journal of Operations Research 83, 201-221 [8]Azizi, N., Zolfanghari, S., 2004. Adaptive temperature control for simulated annealing: a comparative study. Computer and Operations Research 31(4), 2439-2451. [9]Bellegundu, A.D., Chandrupatla, T. R., 1999. Optimization Concepts and Applications in Engineering. Prentice Hall. [10]Boland, N., Krishnamoorthy M., Ernst A.T., Ebery J.,. 2004. Preprocessing and cutting for multiple allocation hub location problems. European Journal of Operational Research 155, 638-653. [11]Bryan, D.L., O’Kelly, M.E., 1999. Hub-and-spoke networks in air transportation: an analytical review. Journal of Regional Science 39(2), 275-295. [12]Campbell, J.F., 1994. Integer programming formulations of discrete hub location problems. European Journal of Operational Research 72, 387-405. [13]Campbell, J.F., 1996. Hub location and the p-hub median problem. Operations Research 44(6), 923-935. [14]Chen, J.-F., 2005a. A heuristic for the uncapacipated multiple allocation hub location problem. Journal of the Chinese Institute of Industrial Engineers. (accepted) [15]Chen, J.-F., 2005b. A hybrid heuristc for the uncapacipated single allocation hub location problem. Omega-International Journal of Management Science. (in press) [16]Don T., Et al., 1995. Hub and spoke networks in truckload trucking: configuration, testing, and operational concerns. Logistics and Transportation 31, 209-237. [17]Ebery, J., Krishnamoorthy, M., Ernst A., Natashia, B., 2000. The capacitated multiple allocation hub location problem: formulations and algorithms. European Journal of Operational Research 120, 614-631. [18]Elhedhli, S., Hu, F.X., 2005. Hub-and-spoke network design with congestion. Computers and Operations Research 6, 1615-1632 [19]Ernst A.T., Krishnamoorthy M., 1996. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science 4(3), 139-154. [20]Ernst, A.T., Krishnamoorthy, M., 1998. Exact and heuristic alogorithms for the uncapacitated multiple allocation p-hub median problem. European Journal of Operational Research 104, 100-112. [21]Ernst, A.T., Krishnamoorthy, M., 1999. Solution algorithms for the capacitated single allocation hub location problem. Annals of Operations Research 86, 141-159. [22]Glover, F., 1989. Tabu search. Part I, ORSA Journal on Computing 1, 190-206. [23]Glover, F., 1990. Tabu search. Part II. ORSA, Journal on Computing 2, 14-32. [24]James, E.R., Edward, M., 1992. Optimization Algorithms for Networks and Graphs. New York Marcel Dekker. Inc. [25]Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P., 1983. Optimization by simulated annealing. Science 220, 671-680. [26]Klincewicz, J.G.., 1991. Heuristics for the p-hub location problem. European Journal of Operational Research 53, 25-37. [27]Klincewicz, J.G.., 1992. Avoiding local optima in the p-hub location problem using tabu search and GRASP. Annals of Operations Research 40, 283-302. [28]Klincewicz, J.G.., 1997. A dual algorithm for the uncapacitated hub location problem. Location Science 4(3), 173-184. [29]Klincewicz, J.G.., 1998. Hub location in backbone tributary network design: a review. Location Science 6, 307-335. [30]Kuby, M.J., Gray, R.G., 1993. Hub network design problem with stopovers and feeders: Case of Federal Express. Transportation Research 27, 1 [31]Lumsden, K., Dallari, F., Ruggeri, R., 1999. Improving the efficiency of the hub and spoke system for the SKF European distribution network. International Journal of Physical Distribution & Logistics Management 29 50-64. [32]Marin, A., 2004. Formulating and solving splittable capacitated multiple allocation hub location problems. Computers and Operations Research Available online 7 April 2005 [33]Martin, J.C., Roman, C., 2004. Analyzing competition for hub location in intercontinental aviation markets. Transportation Research 40, 135-150. [34]Metropolis, N., Rosenbluth, A.N., Rosenbluth, M.N., Teller, A.H., 1953. Equation of state calculations by fast computing machines. The Journal of Chemical Physics 21, 1087-1092. [35]O’Kelly, M E., Bryan, D.L., 2002. Interfacility interaction in models of hub and spook networks. Journal of Regional Science 42(1), 145-164. [36]O’Kelly, M.E., 1987. A quadratic integer problem for the location of interacting hub facilities. European Journal of Operational Research 32, 393-404. [37]O’Kelly, M.E., 1992. Hub facility with fixed costs. Papers in Regional Science: The Journal of RSAI. 71(3), 293-306. [38]O’Kelly, M.E., Bryan, D., Skorin-Kapov D., Skorin-Kapov J., 1996. Hub Network design with single and multiple allocation: a computational study. Locational Science 4(3), 125-138. [39]O’Kelly, M.E., Bryan, D.L., 1998. Hub location with flow economies of scale. Transportation Research 32(8), 605-616. [40]O’Kelly, M.E., Skorin-Kapov D., Skorin-Kapov J., 1995. Lower bounds for the hub location problem. Managemant Science 41(4), 713-721. [41]Osman, I.H., 1993. Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41, 421-451. [42]Sasaki, M., Suzuki, A., Drezner, Z., 1999. On the selection of hub airports for an airline hub-and-spoke system. Computers & Operations Research 26, 1411-1422. [43]Skorin-Kapov D., Skorin-Kapov J., 1994. On tabu search for the location of interacting hub facilities. European Journal of Operational Research 73, 502-509 [44]Skorin-Kapov D., Skorin-Kapov J., O’kelly M.., 1996. Tight linear programming relaxations of uncapacitated p-hub median problem. European Journal of Operational Research 94, 582-593. [45]Sohn, J., Park, S., 1997. A linear problem for the two-hub location problem. European Journal of Operational Research 100, 617-622. [46]Sohn, J., Park, S., 1998. Efficient solution procedure and reduced size formulations for p-hub location problems. European Journal of Operational Research 108, 118-126. [47]Toh, R.S., Higgins, R.C., 1985. The impact of hub and spoke network centralization and route monopoly on domestic airline profitability. Transportation Journal 24, 16-27. [48]Topcuoglu H, Corut F, Ermis M, Yilmaz G., 2005. Solving the uncapacitated hub location using genetic algorithms. Computers and Operations Research 32, 967-984. [49]Wong, D.F., Leong, H.W., Liu, C.L., 1998. Simulated Annealing for VLSI Design. Kluwer Academic Publishers.
|