The matching relaxation for a class of generalized set partitioning problems

This paper introduces a discrete relaxation for the class of combinatorial optimization problems which can be described by a set partitioning formulation under packing constraints. We present two combinatorial relaxations based on computing maximum weighted matchings in suitable graphs. Besides providing dual bounds, the relaxations are also used on a variable reduction technique and a matheuristic. We show how that general method can be tailored to sample applications, and also perform a successful computational evaluation with benchmark instances of a problem in maritime logistics.

[1]  Gautam Mitra,et al.  Graph theoretic relaxations of set covering and set partitioning problems , 1995 .

[2]  M. Padberg,et al.  Solving airline crew scheduling problems by branch-and-cut , 1993 .

[3]  Marco A. Boschetti,et al.  A dual ascent procedure for the set partitioning problem , 2008, Discret. Optim..

[4]  Cid C. de Souza,et al.  A Relax-and-Cut algorithm for the set partitioning problem , 2008, Comput. Oper. Res..

[5]  David W. Pentico,et al.  Assignment problems: A golden anniversary survey , 2007, Eur. J. Oper. Res..

[6]  Alexandre César Muniz de Oliveira,et al.  A Hybrid Column Generation Approach for the Berth Allocation Problem , 2008, EvoCOP.

[7]  Olinto César Bassi de Araújo,et al.  Matheuristics for the capacitated p-median problem , 2015, Int. Trans. Oper. Res..

[8]  Candace A. Yano,et al.  A Multiplier Adjustment Approach for the Set Partitioning Problem , 1992, Oper. Res..

[9]  Stefan Voß,et al.  Operations research at container terminals: a literature update , 2007, OR Spectr..

[10]  Stefan Voß,et al.  POPMUSIC as a matheuristic for the berth allocation problem , 2014, Annals of Mathematics and Artificial Intelligence.

[11]  Vittorio Maniezzo,et al.  Matheuristics: Hybridizing Metaheuristics and Mathematical Programming , 2009 .

[12]  M. Fisher,et al.  Optimal solution of set covering/partitioning problems using dual heuristics , 1990 .

[13]  David M. Ryan,et al.  The Solution of Massive Generalized Set Partitioning Problems in Aircrew Rostering , 1992 .

[14]  George L. Nemhauser,et al.  Optimal set partitioning, matchings and lagrangian duality , 1979 .

[15]  V. M. Glushkov,et al.  Using dual network bounds in algorithms for solving generalized set packing partitioning problems , 1996, Comput. Optim. Appl..

[16]  Agha Iqbal Ali,et al.  A network relaxation based enumeration algorithm for set partitioning , 1989 .

[17]  Celso C. Ribeiro,et al.  Preface to the Special Issue on Matheuristics: Model-Based Metaheuristics , 2015, Int. Trans. Oper. Res..

[18]  András Sebö,et al.  Characterizing Noninteger Polyhedra with 0-1 Constraints , 1998, IPCO.

[19]  Rubén Ruiz,et al.  Size-reduction heuristics for the unrelated parallel machines scheduling problem , 2011, Comput. Oper. Res..

[20]  Adam N. Letchford.  On Disjunctive Cuts for Combinatorial Optimization , 2001, J. Comb. Optim..

[21]  David M. Ryan,et al.  The train driver recovery problem - A set partitioning based model and solution method , 2010, Comput. Oper. Res..

[22]  R. Borndörfer,et al.  Aspects of Set Packing, Partitioning, and Covering , 1998 .

[23]  Ralf Borndörfer,et al.  Discrete relaxations of combinatorial programs , 2001, Discret. Appl. Math..

[24]  Ralf Borndörfer.  Combinatorial Packing Problems , 2004, The Sharpest Cut.

[25]  E. Balas,et al.  Set Partitioning: A survey , 1976 .

[26]  Martin W. P. Savelsbergh,et al.  Conflict graphs in solving integer programming problems , 2000, Eur. J. Oper. Res..

[27]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[28]  Peter L. Hammer,et al.  Discrete Applied Mathematics , 1993 .

[29]  Nelson Maculan,et al.  Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: properties and algorithms , 1987, Discret. Appl. Math..

[30]  Janny Leung,et al.  On the mixed set covering, packing and partitioning polytope , 2016, Discret. Optim..

[31]  Péter Kovács,et al.  LEMON - an Open Source C++ Graph Template Library , 2011, WGT@ETAPS.

[32]  Allan Larsen,et al.  Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results , 2015 .

[33]  Ulrich Derigs,et al.  Matching problems with generalized upper bound side constraints , 1990, Networks.

[34]  Martin W. P. Savelsbergh,et al.  A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems , 2001, INFORMS J. Comput..

[35]  Christian Bierwirth,et al.  A survey of berth allocation and quay crane scheduling problems in container terminals , 2010, Eur. J. Oper. Res..

[36]  Christian Bierwirth,et al.  A follow-up survey of berth allocation and quay crane scheduling problems in container terminals , 2015, Eur. J. Oper. Res..

[37]  Eduardo Lalla-Ruiz,et al.  Modeling the Parallel Machine Scheduling Problem with Step Deteriorating Jobs , 2016, Eur. J. Oper. Res..

[38]  Christian Bierwirth,et al.  Heuristics for the integration of crane productivity in the berth allocation problem , 2009 .