Location of hubs in a competitive environment

European Journal of Operational Research

Volumn 114, Issue 2, 1999, Pages 363-371

  Marianov, Vladimir ^a   Serra, Daniel ^b   Revelle, Charles ^c  

^a PONTIFICIA UNIVERSIDAD CATÓLICA DE CHILE   (Chile)

^b UNIVERSITAT POMPEU FABRA   (Spain)

^c The Johns Hopkins University   (United States)

Author keywords

Hub; Location; Tabu search

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; DECISION THEORY; MATHEMATICAL MODELS; SCHEDULING; STATISTICAL METHODS;

ORIGIN-DESTINATION FLOW; TABU SEARCH METHOD;

STRATEGIC PLANNING;

EID: 0038929390     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(98)00195-7     Document Type: Article

References (30)

1. Aykin T. Lagrangian relaxation based approaches to capacitated hub- and spoke network design problems. European Journal of Operational Research. 79:1994;501-523.
2. Aykin T. The hub location and routing problem. European Journal of Operational Research. 83:1995;200-219.
3. Campbell J.F. Continuous and discrete demand hub location problems. Transportation Research B. 27B:1993;473-482.
4. Campbell, J.F., 1994a. Integer programming formulations of discrete hub location problem. European Journal of Operational Research 72, 387-405.
5. Campbell, J.F., 1994b. A survey of network hub location. Studies in Locational Analysis 6, 31-49.
6. Campbell J.F. Hub location and the p-hub median problem. Operations Research. 44:1996;923-935.
7. Densham, P., Rushton, G., 1992a. A more efficient heuristic for solving large p-median problems. Papers in Regional Science 71, 307-327.
8. Densham, P., Rushton, G., 1992b. Strategies for solving large location-allocation problems by heuristic methods. Environment and Planning A 24, 289-304.
9. Ernst A., Krishnamoorthy M. Efficient algorithms for the uncapacitated single allocation p-hub median problem. Location Science. 4:1996;151-166.
10. Ernst, A., Krishnamoorthy, M., forthcoming. Efficient algorithms for the uncapacitated multiple allocation p-hub median problem. European Journal of Operational Research.
11. Fotheringham, A.S., O'Kelly, M.E., 1989. Spatial Interaction Models: Formulations and Applications. Kluwer Academic Publishers, Boston, MA.
12. Gavish B. Topological design of telecommunications networks - Local access design methods. Annals of Operations Research. 33:1991;17-71.
13. Gendreau M., Hertz A., Laporte G. A tabu search algorithm for the vehicle routing problem. Management Science. 40:1994;1276-1290.
14. Glover F. Heuristic for integer programming using surrogate constraints. Decision Sciences. 8:1977;156-166.
15. Glover F. Tabu search, Part 1. ORSA Journal on Computing. 1:1989;190-206.
16. Glover F. Tabu search, Part 2. ORSA Journal on Computing. 2:1990;4-32.
17. Glover, F., Laguna, M., 1993. Tabu search. In: Reeves, C. (Ed.), Modern Heuristic Techniques for Combinatorial Problems. Blackwell, Oxford.
18. Klincewicz, J.G., 1989. Avoiding local optima in the p-hub location problem using tabu search and grasp. AT & T Bell Laboratories.
19. Klincewicz J.G. Heuristics for the p-hub location problem. European Journal of Operational Research. 53:1991;25-37.
20. Marianov, V., Perez, M., Rios, M., 1995. Location of nodes on communications networks considering a user pre-specified minimum reliability under failures. In: Third International Conference on Telecommunications Systems: Modelling and Analysis, Nashville, TN.
21. O'Kelly M.E. Activity levels at hub facilities in interacting networks. Geographical Analysis. 18:1986;343-356.
22. O'Kelly M.E. The location of interacting hub facilities. Transportation Science. 20:1986;92-106.
23. O'Kelly M.E. A quadratic integer program for the location of interacting hub facilities. European Journal of Operational Research. 32:1987;393-404.
24. O'Kelly M.E. Hub facility location with fixed costs. Papers in Regional Science: The Journal of the RSAI. 71:1992;293-306.
25. O'Kelly M.E., Bryan D., Skorin-Kapov D., Skorin-Kapov J. Hub network design with single and multiple allocation: A computational study. Location Science. 4(3):1996;125-138.
26. Pirkul H., Nagarajan V. Locating concentrators in centralized computer networks. Annals of Operations Research. 36:1992;247-262.
27. Pirkul H., Narasimhan S., De P. Locating concentrators for primary and secondary coverage in a computer communications network. IEEE Transactions on Communications. 36(4):1988;247-262.
28. Skorin-Kapov D., Skorin-Kapov J. On tabu search for the location of interacting hub facilities. European Journal of Operational Research. 73:1994;502-509.
29. Skorin-Kapov D., Skorin-Kapov J., O'Kelly M. Tight linear programming relaxations of uncapacitated p-hub median problems. European Journal of Operational Research. 94:1996;582-593.
30. Tietz M.B., Bart P. Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research. 16:1968;955-961.