Lagrangian relaxation guided problem space search heuristics for generalized assignment problems

We develop and test a heuristic based on Lagrangian relaxation and problem space search to solve the generalized assignment problem (GAP). The heuristic combines the iterative search capability of subgradient optimization used to solve the Lagrangian relaxation of the GAP formulation and the perturbation scheme of problem space search to obtain high-quality solutions to the GAP. We test the heuristic using different upper bound generation routines developed within the overall mechanism. Using the existing problem data sets of various levels of difficulty and sizes, including the challenging largest instances, we observe that the heuristic with a specific version of the upper bound routine works well on most of the benchmark instances known and provides high-quality solutions quickly. An advantage of the approach is its generic nature, simplicity, and implementation flexibility.

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

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

[3]  P. Camerini,et al.  On improving relaxation methods by modified gradient techniques , 1975 .

[4]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .

[5]  E. A. Silver,et al.  An overview of heuristic solution methods , 2004, J. Oper. Res. Soc..

[6]  Salim Haddadi,et al.  Lagrangian Decomposition Based Heuristic For The Generalized Assignment Problem , 1999 .

[7]  Luiz Antonio Nogueira Lorena,et al.  Lagrangean/surrogate relaxation for generalized assignment problems , 1999, Eur. J. Oper. Res..

[8]  V. Balachandran,et al.  An Integer Generalized Transportation Model for Optimal Job Assignment in Computer Networks , 1976, Oper. Res..

[9]  Giovanni Manzini,et al.  Perturbation: An Efficient Technique for the Solution of Very Large Instances of the Euclidean TSP , 1996, INFORMS J. Comput..

[10]  Robert H. Storer,et al.  Problem and Heuristic Space Search Strategies for Job Shop Scheduling , 1995, INFORMS J. Comput..

[11]  Mohammad M. Amini,et al.  A rigorous computational comparison of alternative solution methods for the generalized assignment problem , 1994 .

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

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

[14]  Martin W. P. Savelsbergh,et al.  A Branch-and-Price Algorithm for the Generalized Assignment Problem , 1997, Oper. Res..

[15]  Marshall L. Fisher,et al.  A generalized assignment heuristic for vehicle routing , 1981, Networks.

[16]  Dirk Cattrysse,et al.  A set partitioning heuristic for the generalized assignment problem , 1994 .

[17]  Robert H. Storer,et al.  Problem space search algorithms for resource-constrained project scheduling , 1997, Ann. Oper. Res..

[18]  Charles H. Reilly,et al.  An investigation of the relationship between problem characteristics and algorithm performance: a case study of the GAP , 2002 .

[19]  Richard M. Soland,et al.  A branch and bound algorithm for the generalized assignment problem , 1975, Math. Program..

[20]  H. Ouzia,et al.  An Effective Lagrangian Heuristic For The Generalized Assignment Problem , 2001 .

[21]  Irène Charon,et al.  The noising method: a new method for combinatorial optimization , 1993, Oper. Res. Lett..

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

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

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

[25]  M. Trick.  A Linear Relaxation Heuristic for the Generalized Assignment Problem , 1992 .

[26]  Barrie M. Baker,et al.  Extensions to the generalised assignment heuristic for vehicle routing , 1999, Eur. J. Oper. Res..

[27]  Juan A. Díaz,et al.  A Tabu search heuristic for the generalized assignment problem , 2001, Eur. J. Oper. Res..

[28]  John M. Wilson.  A simple dual algorithm for the generalised assignment problem , 1997, J. Heuristics.

[29]  Robert H. Storer,et al.  Problem space local search for number partitioning , 1996, Ann. Oper. Res..

[30]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

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

[32]  M. Fisher,et al.  A multiplier adjustment method for the generalized assignment problem , 1986 .

[33]  L. V. Wassenhove,et al.  A survey of algorithms for the generalized assignment problem , 1992 .

[34]  John K. Karlof,et al.  Integer programming : theory and practice , 2005 .

[35]  G. Ross,et al.  Modeling Facility Location Problems as Generalized Assignment Problems , 1977 .

[36]  Andrew J. Higgins,et al.  A dynamic tabu search for large-scale generalised assignment problems , 2001, Comput. Oper. Res..

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

[38]  Hacene Ouzia,et al.  Effective algorithm and heuristic for the generalized assignment problem , 2004, Eur. J. Oper. Res..

[39]  H. Edwin Romeijn,et al.  A class of greedy algorithms for the generalized assignment problem , 2000, Discret. Appl. Math..

[40]  Robert M. Nauss.  The Generalized Assignment Problem , 2005 .

[41]  Michel Gendreau,et al.  A guide to vehicle routing heuristics , 2002, J. Oper. Res. Soc..