A dual ascent procedure for the set partitioning problem

  • Authors:

  • M. A. Boschetti;A. Mingozzi;S. Ricciardelli

  • Affiliations:

  • Department of Mathematics, University of Bologna, Bologna, Italy;Department of Mathematics, University of Bologna, Bologna, Italy;Department of Computer Science, Systems and Production, University "Tor Vergata", Rome, Italy

  • Venue:
  • Discrete Optimization
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The set partitioning problem is a fundamental model for many important real-life transportation problems, including airline crew and bus driver scheduling and vehicle routing. In this paper we propose a new dual ascent heuristic and an exact method for the set partitioning problem. The dual ascent heuristic finds an effective dual solution of the linear relaxation of the set partitioning problem and it is faster than traditional simplex based methods. Moreover, we show that the lower bound achieved dominates the one achieved by the classic Lagrangean relaxation of the set partitioning constraints. We describe a simple exact method that uses the dual solution to define a sequence of reduced set partitioning problems that are solved by a general purpose integer programming solver. Our computational results indicate that the new bounding procedure is fast and produces very good dual solutions. Moreover, the exact method proposed is easy to implement and it is competitive with the best branch and cut algorithms published in the literature so far.