Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment

被引：67

作者：

Contreras, Ivan ^{[1
]}

Diaz, Juan A. ^{[2
]}

Fernandez, Elena ^{[1
]}

机构：

[1] Univ Politecn Cataluna, Dept Estadist & Invest Operat, ES-08034 Barcelona, Spain

[2] Univ Americas Puebla, Dept Ingn Ind & Mecan, Cholula 72820, Mexico

来源：

INFORMS JOURNAL ON COMPUTING | 2011年 / 23卷 / 01期

关键词：

hub location; Lagrangean relaxation; column generation; STABILIZED COLUMN GENERATION; SPOKE NETWORK DESIGN; ALLOCATION HUB; VOLUME ALGORITHM; FORMULATIONS; RELAXATION; PROGRAMS; SYSTEMS; BUNDLE;

D O I：

10.1287/ijoc.1100.0391

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper presents a branch-and-price algorithm for the capacitated hub location problem with single assignment, in which Lagrangean relaxation is used to obtain tight lower bounds of the restricted master problem. A lower bound that is valid at any stage of the column generation algorithm is proposed. The process to obtain this valid lower bound is combined with a constrained stabilization method that results in a considerable improvement on the overall efficiency of the solution algorithm. Numerical results on a battery of benchmark instances of up to 200 nodes are reported. These seem to be the largest instances that have been solved to optimality for this problem.

引用

页码：41 / 55

页数：15

共 50 条

[21] Robust optimization approach to capacitated single and multiple allocation hub location problems
Boukani, Fereidoon Habibzadeh
Moghaddam, Babak Farhang
Pishvaee, Mir Saman
[J]. COMPUTATIONAL & APPLIED MATHEMATICS, 2016, 35 (01): : 45 - 60
[22] A cross entropy-based metaheuristic algorithm for large-scale capacitated facility location problems
Caserta, M.
Rico, E. Quinonez
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2009, 60 (10) : 1439 - 1448
[23] A computational evaluation of a general branch-and-price framework for capacitated network location problems
Alberto Ceselli
Federico Liberatore
Giovanni Righini
[J]. Annals of Operations Research, 2009, 167
[24] A computational evaluation of a general branch-and-price framework for capacitated network location problems
Ceselli, Alberto
Liberatore, Federico
Righini, Giovanni
[J]. ANNALS OF OPERATIONS RESEARCH, 2009, 167 (01) : 209 - 251
[25] NETGEN - PROGRAM FOR GENERATING LARGE-SCALE CAPACITATED ASSIGNMENT, TRANSPORTATION, AND MINIMUM COST FLOW NETWORK PROBLEMS
KLINGMAN, D
NAPIER, A
STUTZ, J
[J]. MANAGEMENT SCIENCE SERIES A-THEORY, 1974, 20 (05): : 814 - 821
[26] Capacitated Hub Location Problems with Waiting Time at Hubs
Atashi, Arsham
Abedzadeh, Mostafa
[J]. 2011 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), 2011, : 141 - 145
[27] Single-assignment hub location problems with multiple capacity levels
Correia, Isabel
Nickel, Stefan
Saldanha-da-Gama, Francisco
[J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2010, 44 (8-9) : 1047 - 1066
[28] A price-directed decomposition approach for solving large-scale capacitated part-routing problems
Nsakanda, Aaron Luntala
Diaby, Moustapha
Price, Wilson Leonard
[J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2010, 48 (14) : 4273 - 4295
[29] On solution of the capacitated single allocation hub location problem
Chen, Jeng-Fung
[J]. IMECS 2007: International Multiconference of Engineers and Computer Scientists, Vols I and II, 2007, : 2353 - 2356
[30] A fast heuristic for large-scale capacitated arc routing problems
Wohlk, Sanne
Laporte, Gilbert
[J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2018, 69 (12) : 1877 - 1887

← 1 2 3 4 5 →