96
Views
27
CrossRef citations to date
0
Altmetric
Original Articles

A solution to the hub center problem via a single-relocation algorithm with tabu search

&
Pages 399-411 | Received 01 Aug 1999, Accepted 01 Aug 2000, Published online: 27 Apr 2007

References

  • Aykin , T. ( 1991 ) Networking policies for hub-and-spoke systems with application to the air transportation system . Technical Paper 91–01-TA, Rutgers University , Division of Management Studies , Piscataway , NJ .
  • Aykin , T. ( 1994 ) Lagrangian relaxation based approaches to capacitated hub-and-spokc network design problems . European Journal of Operational Research , 79 , 501 – 523 .
  • Aykin , T. ( 1995 ) The hub location and routing problem . European Journal of Operational Research , 83 . 200 – 219 .
  • Aykin , T. and Brown , G.F. ( 1992 ) Interacting new facilities and location-allocation problems . Transportation Science , 26 , 212 – 222 .
  • Campbell , J.F. ( 1992 ) Location and allocation for distribution systems with transshipments and transportation economies of scale . Annals of Operations Research , 40 , 77 – 99 .
  • Campbell , J.F. ( 1994a ) Integer programming formulations of discrete hub location problems . European Journal of Operational Research , 72 . 387 – 405 .
  • Campbell , J.F. ( 1994b ) Hub location and the p-hub median problem . unpublished manuscript .
  • Campbell , J.F. ( 1994c ) A survey of network hub location . Studies in Locational Analysis , 6 , 31 – 49 .
  • Chan , Y. and Ponder , R.J. ( 1979 ) The small package air freight industry in the United States a review of the Federal Express experience . Transportation Research , 13A , 221 – 229 .
  • Charalambous , C. and Conn , A.R. ( 1978 ) An efficient algorithm to solve the minimax problem directly . SIAM Journal of Numerical Analysis , 15 , 130 – 145 .
  • Dean . J.W. and Evans , J.R. ( 1994 ) Total Quality Management, Organization, and Strategy , West Publishing , New York .
  • Drezner , Z. and Weselowsky , G.O. ( 1980 ) Single facility lp-distance minimax location . SIAM Journal of Algebraic and Discrete Methods , 1 , 315 – 321 .
  • Ernst , A.T. and Krishnamoorthy , M. ( 1996 ) Efficient algorithms for the uncapacitated single allocation p-hub median problem . Location Science , 4 , 139 – 154 .
  • Ernst , A.T. and Krishnamoorthy , M. ( 1998a ) Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem . European Journal of Operational Research , 104 , 100 – 112 .
  • Ernst , A.T. and Krishnamoorthy , M. ( 1998b ) An exact solution approach based on shortest-paths for p-hub median problems . INFORMS Journal on Computing , 10 , 113 – 120 .
  • Glover , F. and Laguna , M. ( 1993 ) Tabu search , in Modern Heuristic Techniques for Combinatorial Problems , C.R. Reeves, (ed) , Wiley and Sons , New York , ch. 3 .
  • Goldman , A.J. ( 1969 ) Optimum locations for centers in a network . Transportation Science , 3 , 352 – 360 .
  • Halpern , J. and Maimon , O. ( 1982 ) Algorithms for the m-center problem a survey . European Journal of Operations Research , 10 , 90 – 99 .
  • Helm , S.A. and Venkatarmanan , M.A. ( 1993 ) Using simulated annealing lo solve the p-hub location problem . IRMIS Working Paper 9304, School of Business , Indiana University , Bloomington , IN .
  • Jacobsen , S.K. ( 1981 ) An algorithm for the minimax Weber problem . European Journal of Operations Research , 6 , 144 – 148 .
  • Kara , B.Y. ( 1999 ) Modelling and analysis of issues in hub location problem . Ph.D. thesis , Bilkent University , Turkey .
  • Kariv , O. and Hakimi , S.L. ( 1979 ) An algorithmic approach to network location problems, I the p-centers . SIAM Journal of Applied Mathematics , 37 , 513 – 537 .
  • Klincewicz , J.G. ( 1991 ) Heuristics for the p-hub location problem . European Journal of Operational Research , 53 , 25 – 37
  • Klincewicz , J.G. ( 1993 ) Avoiding local optima in the p-hub location problem using tabu search and GRASP . Annals of Operations Research , 40 , 283 – 302 .
  • O'Kelly , M.E. ( 1986 ) The location of interacting hub facilities . Transportation Science , 20 . 92 – 106 .
  • O'Kelly , M.E. ( 1987 ) A quadratic integer program for the location of interacting hub facilities . European Journal of Operational Research , 32 , 393 – 404 .
  • O'Kelly , M.E. ( 1992 ) A clustering approach to the planar hub location problem . Annals of Operations Research , 40 , 339 – 353 .
  • O'Kelly , M.E. and Miller , H.J. ( 1994 ) The hub network design problem a review and synthesis . Journal of Transportation Geography , 2 , 31 – 40 .
  • Pamuk , S. ( 1997 ) The hub center problem modelling, tractability and solution via a single-relocation algorithm with tabu search . M.S. thesis , Middle East Technical University , Turkey ,
  • Reeves , C.A. and Bednar , D.A. ( 1994 ) Defining quality alternatives and implications . The Academy of management Review , 19 , 419–445 .
  • Skorin-Kapov , D. and Skorin-Kapov , J. ( 1994 ) On tabu search for the location of interacting hub facilities , European Journal of Operational Research , 73 , 502 – 509 .
  • Skorin-Kapov , D. , Skorin-Kapov , J. and O'Kelly , M.E. ( 1996 ) Tight linear programming relaxations of uncapacitated for p-hub median problems . European Journal of Operational Research , 94 , 582 – 593 .
  • Suzaki , K. ( 1987 ) The New Manufacturing Challenge Techniques for Continuous Improvement , The Free Press , New York .
  • Tansel , B.C. , Francis , R.L. , Lowe , T.J. ( 1983 ) Location on networks a survey, parts I and II. Management Science , 29 , 482 – 511 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.