Abstract
In the discretep-hub location problem, various nodes interact with each other by sending and receiving given levels of traffic (such as telecommunications traffic, data transmissions, airline passengers, packages, etc.). It is necessary to choosep of the given nodes to act as hubs, which are fully interconnected; it is also necessary to connect each other node to one of these hubs so that traffic can be sent between any pair of nodes by using the hubs as switching points. The objective is to minimize the sum of the costs for sending traffic along the links connecting the various nodes. Like many combinatorial problems, thep-hub location problem has many local optima. Heuristics, such as exchange methods, can terminate once such a local optimum is encountered. In this paper, we describe new heuristics for thep-hub location problem, based on tabu search and on a greedy randomized adaptive search procedure (GRASP). These recently developed approaches to combinatorial optimization are capable of examining several local optima, so that, overall, superior solutions are found. Computational experience is reported in which both tabu search and GRASP found “optimal” hub locations (subject to the assumption that nodes must be assigned to the nearest hub) in over 90% of test problems. For problems for which such optima are not known, tabu search and GRASP generated new best-known solutions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.F. Bard and T.A. Feo, An algorithm for the manufacturing equipment selection problem, IIE Trans. 23(1991)83–92.
J.F. Bard and T.A. Feo, Operations sequencing in discrete parts manufacturing, Manag. Sci. 35(1989)249–255.
R.R. Boorstyn and H. Frank, Large-scale network topological optimization, IEEE Trans. Commun. COM-25(1977)29–47.
M.L. Brandeau and S.S. Chiu, An overview of representative problems in location research, Manag. Sci. 35(1989)645–674.
T.A. Feo and J.F. Bard, Flight scheduling and maintenance base planning, Manag. Sci. 35(1989)1415–1432.
T.A. Feo and M.G.C. Resende, A probabilistic heuristic for a computationally difficult set covering problem, Oper. Res. Lett. 8(2)(1989).
T.A. Feo, M.G.C. Resende and S.H. Smith, A greedy randomized adaptive search procedure for maximum independent set, unpublished manuscript (1989).
F. Glover, Heuristics for integer programming using surrogate constraints, Dec. Sci. 8(1977)156–166.
F. Glover, Future paths for integer programming and links to artificial intelligence, Comput. Oper. Res. 13(1986)533–549.
F. Glover, Tabu search methods in artificial intelligence and operations research, ORSA Art. Int. Newsletter 1(2)(1987)6.
F. Glover, Tabu search, Part I, ORSA J. Comput. 1(1989)190–206.
F. Glover, Tabu search, Part II, ORSA J. Comput. 2(1990)4–32.
F. Glover and H.J. Greenberg, New approaches for heuristic search: A bilateral linkage with artificial intelligence, Europ. J. Oper. Res. 39(1989)119–130.
F. Glover, C. McMillan and B. Novick, Interactive decision software and computer graphics for architectural and space planning, Ann. Oper. Res. 5(1985)557–573.
F. Glover and C. McMillan, The general employee scheduling problem: An integration of management science and operations research, Comput. Oper. Res. 13(1986)563–593.
P. Hansen, The steepest ascent mildest descent heuristic for combinatorial programming, presented at theCongress on Numerical Methods in Combinatorial Optimization, Capri, Italy (1986).
J.P. Hart and A.W. Shogan, Semi-greedy heuristics: An empirical study, Oper. Res. Lett. 6(1987)107–114.
A. Hertz and D. de Werra, Using tabu search techniques for graph coloring, Computing 29(1987)345–351.
D.S. Johnson, C.R. Aragon, L.A. McGeoch and C. Schevon, Optimization by simulated annealing: An experimental evaluation (Part I), Oper. Res. 37(1989)865–892.
S. Kirkpatrick, C.D. Gelatt, Jr. and M.P. Vecchi, Optimization by simulated annealing, Science 22(1983)671–680.
J.G. Klincewicz, Heuristics for thep-hub location problem, Europ. J. Oper. Res. 53(1991)25–37.
R.F. Love, J.G. Morris and G.O. Wesolowsky,Facilities Location: Models and Methods, Publications in Operations Research, vol. 7(North-Holland/Elsevier, New York, 1988).
C.L. Monma and D.D. Sheng, Backbone network design and performance analysis: A methodology for packet switching networks, IEEE J. Sel. Areas Commun. SAC-4(1986)946–965.
M.E. O'Kelly, The location of interacting hub facilities, Transp. Sci. 20(1986)92–106.
M.E. O'Kelly, Activity levels at hub facilities in interacting networks, Geographic Anal. 18(1986)343–356.
M.E. O'Kelly, A quadratic integer program for the location of interacting hub facilities, Europ. J. Oper. Res. 32(1987)393–404.
W.B. Powell and Y. Sheffi, Design and implementation of an interactive optimization system for network design in the motor carrier industry, Oper. Res. 37(1989)12–29.
J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem, ORSA J. Comput. 2(1990)33–45.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Klincewicz, J.G. Avoiding local optima in thep-hub location problem using tabu search and GRASP. Ann Oper Res 40, 283–302 (1992). https://doi.org/10.1007/BF02060483
Issue Date:
DOI: https://doi.org/10.1007/BF02060483