A Branch-and-Cut Algorithm for the Multilevel Generalized Assignment Problem

The multilevel generalized assignment problem (MGAP) consists of minimizing the assignment cost of a set of jobs to machines, each having associated therewith a capacity constraint. Each machine can perform a job with different efficiency levels that entail different costs and amount of resources required. The MGAP was introduced in the context of large manufacturing systems as a more general variant of the well-known generalized assignment problem, where a single efficiency level is associated with each machine. In this paper, we propose a branch-and-cut algorithm whose core is an exact separation procedure for the multiple-choice knapsack polytope induced by the capacity constraints and single-level execution constraints. A computational experience on a set of benchmark instances is reported, showing the effectiveness of the proposed approach.

[1]  M. R. Rao,et al.  The generalized assignment problem: Valid inequalities and facets , 1990, Math. Program..

[2]  M. R. Rao,et al.  (1,k)-configuration facets for the generalized assignment problem , 1990, Math. Program..

[3]  Sonia Hajri-Gabouj,et al.  A fuzzy genetic multiobjective optimization algorithm for a multilevel generalized assignment problem , 2003, IEEE Trans. Syst. Man Cybern. Part C.

[4]  Adam N. Letchford,et al.  Separation algorithms for 0-1 knapsack polytopes , 2010, Math. Program..

[5]  John E. Beasley,et al.  A genetic algorithm for the generalised assignment problem , 1997, Comput. Oper. Res..

[6]  Masafumi Yamashita,et al.  Independentand cooperative parallel search methods for the generalized assignment problem , 2003, Optim. Methods Softw..

[7]  Ricardo Fukasawa,et al.  On the Exact Separation of Mixed Integer Knapsack Cuts , 2007, IPCO.

[8]  Laurence A. Wolsey,et al.  Technical Note - Facets and Strong Valid Inequalities for Integer Programs , 1976, Oper. Res..

[9]  Pasquale Avella,et al.  A computational study of exact knapsack separation for the generalized assignment problem , 2010, Comput. Optim. Appl..

[10]  Temel Öncan,et al.  A Survey of the Generalized Assignment Problem and Its Applications , 2007, INFOR Inf. Syst. Oper. Res..

[11]  Manfred W. Padberg,et al.  On the facial structure of set packing polyhedra , 1973, Math. Program..

[12]  Fred W. Glover,et al.  An Ejection Chain Approach for the Generalized Assignment Problem , 2004, INFORMS J. Comput..

[13]  Robert M. Nauss,et al.  Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach , 2003, INFORMS J. Comput..

[14]  Jacques A. Ferland,et al.  An exact method with variable fixing for solving the generalized assignment problem , 2012, Comput. Optim. Appl..

[15]  David Pisinger,et al.  A Minimal Algorithm for the 0-1 Knapsack Problem , 1997, Oper. Res..

[16]  Fred W. Glover,et al.  A path relinking approach with ejection chains for the generalized assignment problem , 2006, Eur. J. Oper. Res..

[17]  George L. Nemhauser,et al.  A family of inequalities for the generalized assignment polytope , 2001, Oper. Res. Lett..

[18]  Pasquale Avella,et al.  Computational experience with general cutting planes for the Set Covering problem , 2009, Oper. Res. Lett..

[19]  T. Ibaraki,et al.  A variable depth search algorithm with branching search for the generalized assignment problem , 1998 .

[20]  Darwin Klingman,et al.  Improved Computer-Based Planning Techniques. Part II , 1979 .

[21]  Pasquale Avella,et al.  Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable , 2012, INFORMS J. Comput..

[22]  J. P. Kelly,et al.  Tabu search for the multilevel generalized assignment problem , 1995 .

[23]  Darwin Klingman,et al.  IMPROVED COMPUTER-BASED PLANNING TECHNIQUES , 1977 .

[24]  Pasquale Avella,et al.  A cutting plane algorithm for the capacitated facility location problem , 2009, Comput. Optim. Appl..

[25]  William J. Cook,et al.  Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems , 2003, Math. Program..

[26]  John M. Wilson,et al.  Heuristic Solution Methods for the Multilevel Generalized Assignment Problem , 2002, J. Heuristics.

[27]  Giovanni Righini,et al.  A Branch-and-Price Algorithm for the Multilevel Generalized Assignment Problem , 2006, Oper. Res..

[28]  E. Andrew Boyd,et al.  Generating Fenchel Cutting Planes for Knapsack Polyhedra , 1993, SIAM J. Optim..

[29]  María Auxilio Osorio Lama,et al.  Logic cuts for multilevel generalized assignment problems , 2003, Eur. J. Oper. Res..

[30]  Ibrahim H. Osman,et al.  Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches , 1995 .

[31]  Claudio Sterle,et al.  A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes , 2008, J. Math. Model. Algorithms.

[32]  Marcus Poggi de Aragão,et al.  Stabilized branch-and-cut-and-price for the generalized assignment problem , 2005, Electron. Notes Discret. Math..