Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities

被引：11

作者：

Gschwind, Timo ^{[1
]}

Irnich, Stefan ^{[1
]}

机构：

[1] Johannes Gutenberg Univ Mainz, Gutenberg Sch Management & Econ, Chair Logist Management, Jakob Welder Weg 9, D-55128 Mainz, Germany

来源：

OR SPECTRUM | 2017年 / 39卷 / 02期

关键词：

Column generation; Dual inequalities; Stabilization; OPTIMIZATION;

D O I：

10.1007/s00291-016-0463-x

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

We present two new methods to stabilize column-generation algorithms for the temporal knapsack problem (TKP). Caprara et al. (INFORMS J Comp 25(3):560-571, 2013] were the first to suggest the use of branch-and-price algorithms for Dantzig-Wolfe reformulations of the TKP. Herein, the respective pricing problems are smaller-sized TKP that can be solved with a general-purpose MIP solver or by dynamic programming. Our stabilization methods are tailored to the TKP as they use (deep) dual-optimal inequalities, that is, inequalities known to be fulfilled by all (at least some) optimal dual solutions to the linear relaxation. Extensive computational tests reveal that both new stabilization techniques are helpful. Several previously unsolved instances are now solved to proven optimality.

引用

页码：541 / 556

页数：16

共 50 条

[1] Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities
Timo Gschwind
Stefan Irnich
OR Spectrum, 2017, 39 : 541 - 556
[2] Dual-optimal inequalities for stabilized column generation
Ben Amor, Hatem
Desrosiers, Jacques
Valerio de Carvalho, Jose Manuel
OPERATIONS RESEARCH, 2006, 54 (03) : 454 - 463
[3] Dual Inequalities for Stabilized Column Generation Revisited
Gschwind, Timo
Irnich, Stefan
INFORMS JOURNAL ON COMPUTING, 2016, 28 (01) : 175 - 194
[4] Accelerating Column Generation via Flexible Dual Optimal Inequalities with Application to Entity Resolution
Lokhande, Vishnu Suresh
Wang, Shaofei
Singh, Maneesh
Yarkony, Julian
THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 1593 - 1602
[5] A column-generation approach to the multiple knapsack problem with color constraints
Forrest, JJH
Kalagnanam, J
Ladanyi, L
INFORMS JOURNAL ON COMPUTING, 2006, 18 (01) : 129 - 134
[6] A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
Daniel Blado
Alejandro Toriello
Mathematical Programming Computation, 2021, 13 : 185 - 223
[7] A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
Blado, Daniel
Toriello, Alejandro
MATHEMATICAL PROGRAMMING COMPUTATION, 2021, 13 (01) : 185 - 223
[8] Column generation with dual inequalities for railway crew scheduling problems
Nishi T.
Muroi Y.
Inuiguchi M.
Public Transport, 2011, 3 (01) : 25 - 42
[9] A stabilized column generation scheme for the traveling salesman subtour problem
Westerlund, Andreas
Gothe-Lundgren, Maud
Larsson, Torbjorn
DISCRETE APPLIED MATHEMATICS, 2006, 154 (15) : 2212 - 2238
[10] Machine Learning-Supported Prediction of Dual Variables for the Cutting Stock Problem with an Application in Stabilized Column Generation
Kraul, Sebastian
Seizinger, Markus
Brunner, Jens O.
INFORMS JOURNAL ON COMPUTING, 2023, 35 (03) : 692 - 709

← 1 2 3 4 5 →