Large-scale optimization with the primal-dual column generation method

Abstract

The primal-dual column generation method (PDCGM) is a general-purpose column generation technique that relies on the primal-dual interior point method to solve the restricted master problems. The use of this interior point method variant allows to obtain suboptimal and well-centered dual solutions which naturally stabilizes the column generation. As recently presented in the literature, reductions in the number of calls to the oracle and in the CPU times are typically observed when compared to the standard column generation, which relies on extreme optimal dual solutions. However, these results are based on relatively small problems obtained from linear relaxations of combinatorial applications. In this paper, we investigate the behaviour of the PDCGM in a broader context, namely when solving large-scale convex optimization problems. We have selected applications that arise in important real-life contexts such as data analysis (multiple kernel learning problem), decision-making under uncertainty (two-stage stochastic programming problems) and telecommunication and transportation networks (multicommodity network flow problem). In the numerical experiments, we use publicly available benchmark instances to compare the performance of the PDCGM against recent results for different methods presented in the literature, which were the best available results to date. The analysis of these results suggests that the PDCGM offers an attractive alternative over specialized methods since it remains competitive in terms of number of iterations and CPU times even for large-scale optimization problems.

A Column Generation-Based Heuristic for the Split Delivery Vehicle Routing Problem with Time Windows

“…The CG-based heuristic was coded in C++ and relies on the BP framework of Munari and Gondzio [27] designed for the VRPTW, and the BC algorithm of Munari and Savelsbergh [29] designed for the SDVRPTW. The BP algorithm used to solve VRPTW instance is based on the primal-dual column generation method and relies on interior point solutions to stabilize column and cut generation [22,23]. The BP algorithm is called three times in the first phase of the heuristic, and in the second and third calls, we initialize the master problem with the columns obtained in previous call.…”

The Robust Vehicle Routing Problem with Time Windows: Compact Formulation and Branch-Price-and-Cut Method

“…Stabilization techniques try to overcome these drawbacks by controlling the oscillation of dual solutions, which has been shown to be successful for a variety of problems (Briant et al 2008, Ben Amor et al 2009. We rely on the technique known as the primal-dual column generation method (Gondzio et al 2013, Gondzio et al 2016, which uses a primal-dual interior point algorithm to naturally control the distance between dual solutions. Each RMP is solved by the interior point algorithm within a given optimality tolerance ε > 0 that is dynamically adjusted at each CG iteration according to the relative gap in the CG method.…”

Improving the linear relaxation of maximum k-cut with semidefinite-based constraints

“…We solve the SDP and LP relaxations of the max-k-cut using the interior point method (IPM) of MOSEK [3]. Our computational tests indicated that the default IPM is not efficient so, inspired by the PDCGM solver [19], we considerably modified the IPM to improve the CPA performance. This section discusses the main changes; some of them are also applicable to other solvers.…”