Hybrid column generation for large-size Covering Integer Programs: Application to transportation planning

Authors:
L. Alfandari;J. Sadki;A. Plateau;A. Nagih
Affiliations:
ESSEC Business School, 95021 Cergy-Pontoise, France;Université Paris 13, Sorbonne Paris Cité LIPN, CNRS(UMR 7030), 93430 Villetaneuse, France;CEDRIC, CNAM, 75141 Paris, France;LCOMS, Université de Lorraine, Ile du Saulcy, 57045 Metz Cedex 1, France
Venue:
Computers and Operations Research
Year:
2013

Citing 5
Cited 0

Approximation algorithms for combinatorial fractional programming problems

Mathematical Programming: Series A and B
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
A Branch-First, Cut-Second Approach for Locomotive Assignment

Management Science
On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm

Operations Research
Branching in branch-and-price: a generic scheme

Mathematical Programming: Series A and B

Quantified Score

Hi-index	0.01

Visualization

Abstract

The well-known column generation scheme is often an efficient approach for solving the linear relaxation of large-size Covering Integer Programs (CIP). In this paper, this technique is hybridized with an extension of the best-known CIP approximation heuristic, taking advantage of distinct criteria of columns selection. This extension uses fractional optimization for solving pricing subproblems. Numerical results on a real-case transportation planning problem show that the hybrid scheme accelerates the convergence of column generation both in terms of number of iterations and computational time. The integer solutions generated at the end of the process can also be improved for a significant proportion of instances, highlighting the potential of diversification of the approximation heuristic.