On the single-assignment p-hub center problem

被引:121
作者
Kara, BY
Tansel, BÇ [1 ]
机构
[1] Bilkent Univ, Dept Ind Engn, TR-06533 Bilkent, Ankara, Turkey
[2] McGill Univ, Fac Management, Montreal, PQ H3A 1G5, Canada
关键词
hub location; modeling; complexity;
D O I
10.1016/S0377-2217(99)00274-X
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
We study the computational aspects of the single-assignment p-hub center problem on the basis of a basic model and a new model. The new model's performance is substantially better in CPU time than different linearizations of the basic model. We also prove the NP-Hardness of the problem. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:648 / 655
页数:8
相关论文
共 13 条
[1]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theoryof NP-Completeness
[2]   THE HUB LOCATION AND ROUTING PROBLEM [J].
AYKIN, T .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1995, 83 (01) :200-219
[3]   INTEGER PROGRAMMING FORMULATIONS OF DISCRETE HUB LOCATION-PROBLEMS [J].
CAMPBELL, JF .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 72 (02) :387-405
[4]   Hub location and the p-hub median problem [J].
Campbell, JF .
OPERATIONS RESEARCH, 1996, 44 (06) :923-935
[5]  
Ernst A. T., 1996, Location Science, V4, P139, DOI 10.1016/S0966-8349(96)00011-3
[6]   Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem [J].
Ernst, AT ;
Krishnamoorthy, M .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 104 (01) :100-112
[7]  
KLINCEWICZ JG, 1998, UNPUB HUB LOCATION B
[8]   THE HUB NETWORK DESIGN PROBLEM WITH STOPOVERS AND FEEDERS - THE CASE OF FEDERAL EXPRESS [J].
KUBY, MJ ;
GRAY, RG .
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 1993, 27 (01) :1-12
[10]   THE LOCATION OF INTERACTING HUB FACILITIES [J].
OKELLY, ME .
TRANSPORTATION SCIENCE, 1986, 20 (02) :92-106