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 条
  • [1] A branch and cut algorithm for hub location problems with single assignment
    Martine Labbé
    Hande Yaman
    Eric Gourdin
    [J]. Mathematical Programming, 2005, 102 : 371 - 405
  • [2] A branch and cut algorithm for hub location problems with single assignment
    Labbé, M
    Yaman, H
    Gourdin, E
    [J]. MATHEMATICAL PROGRAMMING, 2005, 102 (02) : 371 - 405
  • [3] A RAMP Algorithm for Large-Scale Single Source Capacitated Facility Location Problems
    Oliveira, Oscar
    Matos, Telmo
    Gamboa, Dorabela
    [J]. LEARNING AND INTELLIGENT OPTIMIZATION, LION, 2020, 11968 : 171 - 183
  • [4] Branch-and-price-and-cut algorithm for the capacitated single allocation hub location routeing problem
    Wu, Yuehui
    Qureshi, Ali Gul
    Yamada, Tadashi
    Yu, Shanchuan
    [J]. JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2024, 75 (02) : 410 - 422
  • [5] An effective heuristic for large-scale capacitated facility location problems
    Avella, Pasquale
    Boccia, Maurizio
    Sforza, Antonio
    Vasil'ev, Igor
    [J]. JOURNAL OF HEURISTICS, 2009, 15 (06) : 597 - 615
  • [6] An effective heuristic for large-scale capacitated facility location problems
    Pasquale Avella
    Maurizio Boccia
    Antonio Sforza
    Igor Vasil’ev
    [J]. Journal of Heuristics, 2009, 15 : 597 - 615
  • [7] Lagrangean relaxation for the capacitated hub location problem with single assignment
    Ivan Contreras
    Juan A. Díaz
    Elena Fernández
    [J]. OR Spectrum, 2009, 31 : 483 - 505
  • [8] Lagrangean relaxation for the capacitated hub location problem with single assignment
    Contreras, Ivan
    Diaz, Juan A.
    Fernandez, Elena
    [J]. OR SPECTRUM, 2009, 31 (03) : 483 - 505
  • [9] APPROXIMATE SOLUTIONS TO LARGE-SCALE CAPACITATED FACILITY LOCATION-PROBLEMS
    SHETTY, B
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 1990, 39 (02) : 159 - 175
  • [10] A hybrid iterated local search matheuristic for large-scale single source capacitated facility location problems
    de Almeida, Guilherme Barbosa
    de Sa, Elisangela Martins
    de Souza, Sergio Ricardo
    Souza, Marcone Jamilson Freitas
    [J]. JOURNAL OF HEURISTICS, 2024, 30 (3-4) : 145 - 172
12345