The equilibrium generalized assignment problem and genetic algorithm

Abstract The well-known generalized assignment problem (GAP) is to minimize the costs of assigning n jobs to m capacity constrained agents (or machines) such that each job is assigned to exactly one agent. This problem is known to be NP-hard and it is hard from a computational point of view as well. In this paper, follows from practical point of view in real systems, the GAP is extended to the equilibrium generalized assignment problem (EGAP) and the equilibrium constrained generalized assignment problem (ECGAP). A heuristic equilibrium strategy based genetic algorithm (GA) is designed for solving the proposed EGAP. Finally, to verify the computational efficiency of the designed GA, some numerical experiments are performed on some known benchmarks. The test results show that the designed GA is very valid for solving EGAP.

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

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

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

[4]  Panos M. Pardalos,et al.  The Quadratic Assignment Problem: A Survey and Recent Developments , 1993, Quadratic Assignment and Related Problems.

[5]  Snežana Mitrović-Minić,et al.  Very large-scale variable neighborhood search for the generalized assignment problem , 2008 .

[6]  Kurt Jörnsten,et al.  Improved Lagrangean decomposition: An application to the generalized assignment problem , 1990 .

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

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

[9]  Ricardo H. C. Takahashi,et al.  Using an enhanced integer NSGA-II for solving the multiobjective Generalized Assignment Problem , 2010, IEEE Congress on Evolutionary Computation.

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

[11]  Michael Racer,et al.  A hybrid heuristic for the generalized assignment problem , 1995 .

[12]  Reuven Cohen,et al.  An efficient approximation for the Generalized Assignment Problem , 2006, Inf. Process. Lett..

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

[14]  Laurent Hérault,et al.  Solving a Real World Assignment Problem with a Metaheuristic , 1998, J. Heuristics.

[15]  Aubrey B. Poore,et al.  Multidimensional Assignment Problems Arising in Multitarget and Multisensor Tracking , 2000 .

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

[17]  Monique Guignard-Spielberg,et al.  An algorithm for the generalized quadratic assignment problem , 2008, Comput. Optim. Appl..

[18]  Fred W. Glover,et al.  A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem , 2004, Discret. Optim..

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

[20]  Mehmet Fatih Tasgetiren,et al.  Differential Evolution Algorithms for the Generalized Assignment problem , 2009, 2009 IEEE Congress on Evolutionary Computation.

[21]  Cai Wen Zhang,et al.  An efficient solution to biobjective generalized assignment problem , 2007, Adv. Eng. Softw..

[22]  Konstantin Kogan,et al.  Capacity planning by the dynamic multi-resource generalized assignment problem (DMRGAP) , 1998, Eur. J. Oper. Res..

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

[24]  Byung Ha Lim,et al.  A Lagrangian Dual-Based Branch-And-Bound Algorithm for the Generalized Multi-Assignment Problem , 1998 .

[25]  Adriano O. De Maio,et al.  An all Zero-One Algorithm for a Certain Class of Transportation Problems , 1971, Oper. Res..

[26]  V. Jeet,et al.  Lagrangian relaxation guided problem space search heuristics for generalized assignment problems , 2007, Eur. J. Oper. Res..

[27]  A. M. Geoffrion,et al.  Multicommodity Distribution System Design by Benders Decomposition , 1974 .

[28]  Christodoulos A. Floudas,et al.  Novel and Effective Integer Optimization Approach for the NSF Panel-Assignment Problem: A Multiresource and Preference-Constrained Generalized Assignment Problem , 2006 .

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

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

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

[32]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

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

[34]  Éva Tardos,et al.  An approximation algorithm for the generalized assignment problem , 1993, Math. Program..

[35]  Lale Özbakir,et al.  Bees algorithm for generalized assignment problem , 2010, Appl. Math. Comput..