HubLocator: an exact solution method for the multiple allocation hub location problem

被引:66
作者
Mayer, G [1 ]
Wagner, B [1 ]
机构
[1] Tech Univ Darmstadt, Inst Operat Res, D-64289 Darmstadt, Germany
关键词
hub location problem; aggregated model; branch-and-bound; dual ascent;
D O I
10.1016/S0305-0548(01)00080-6
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
HubLocator is a new branch-and-bound procedure for the uncapacitated multiple allocation hub location problem. An existing optimal method developed by Klincewicz (Location Sci. 4 (1996) 173) is based on dual ascent and dual adjustment techniques applied to a disaggregated model formulation. These techniques have already successfully been used to solve the closely related simple plant location problem. However, due to the specific structure of the problem at hand, the success of these techniques in reducing the computational effort is rather restricted. Therefore, HubLocator additionally considers an aggregated model formulation enabling us to significantly tighten the lower bounds. Upper bounds which satisfy complementary slackness conditions for some constraints are constructed and improved by means of a simple heuristic procedure. Computational experiments demonstrate that optimal solutions for problems with up to 40 nodes can be found in a reasonable amount of time.
引用
收藏
页码:715 / 739
页数:25
相关论文
共 30 条
[1]   Solution approaches to hub location problems [J].
Abdinnour-Helm, S ;
Venkataramanan, MA .
ANNALS OF OPERATIONS RESEARCH, 1998, 78 (0) :31-50
[2]   A hybrid heuristic for the uncapacitated hub location problem [J].
Abdinnour-Helm, S .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1998, 106 (2-3) :489-499
[3]  
ABDINNOURHELM S, 1993, 9304 IRMIS SCH BUS D
[4]   LAGRANGIAN-RELAXATION BASED APPROACHES TO CAPACITATED HUB-AND-SPOKE NETWORK DESIGN PROBLEM [J].
AYKIN, T .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 79 (03) :501-523
[5]   NETWORKING POLICIES FOR HUB-AND-SPOKE SYSTEMS WITH APPLICATION TO THE AIR TRANSPORTATION SYSTEM [J].
AYKIN, T .
TRANSPORTATION SCIENCE, 1995, 29 (03) :201-221
[6]   INTEGER PROGRAMMING FORMULATIONS OF DISCRETE HUB LOCATION-PROBLEMS [J].
CAMPBELL, JF .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 72 (02) :387-405
[7]   Hub location and the p-hub median problem [J].
Campbell, JF .
OPERATIONS RESEARCH, 1996, 44 (06) :923-935
[8]  
CAMPBELL JF, 1994, STUDIES LOCATIONAL A, V6, P31
[9]   Solving large single allocation p-hub problems with two or three hubs [J].
Ebery, J .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 128 (02) :447-458
[10]   The capacitated multiple allocation hub location problem: Formulations and algorithms [J].
Ebery, J ;
Krishnamoorthy, M ;
Ernst, A ;
Boland, N .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 120 (03) :614-631