Algorithms for the multi-resource generalized assignment problem

The multi-resource generalized assignment problem is encountered when a set of tasks have to be assigned to a set of agents in a way that permits assignment of multiple tasks to an agent subject to the availability of a set of multiple resources consumed by that agent. This problem differs from the generalized assignment problem in that an agent consumes not just one but a variety of resources in performing the tasks assigned to him. This paper develops effective solution procedures for the multi-resource generalized assignment problem. Various relaxations of the problem are studied and theoretical relations among these relaxations are pointed out. Rules for reducing problem size are discussed and are shown to be effective through computational experiments. Heuristic solution procedures and an efficient branch and bound procedure are developed. Results of computational experiments testing these procedures are reported.

[1]  Andris A. Zoltners,et al.  Weighted Assignment Models and Their Application , 1979 .

[2]  Bezalel Gavish,et al.  An Optimal Solution Method for the Multiple Travelling Salesman Problem , 1980 .

[3]  Egon Balas,et al.  An Algorithm for Large Zero-One Knapsack Problems , 1980, Oper. Res..

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

[5]  Donald Erlenkotter,et al.  A Dual-Based Procedure for Uncapacitated Facility Location , 1978, Oper. Res..

[6]  M. Bazaraa,et al.  A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality , 1979 .

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

[8]  Bezalel Gavish,et al.  A system for routing and capacity assignment in computer communication networks , 1989, IEEE Trans. Commun..

[9]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[10]  Jean-Louis Goffin,et al.  On convergence rates of subgradient optimization methods , 1977, Math. Program..

[11]  Robert M. Nauss,et al.  An Efficient Algorithm for the 0-1 Knapsack Problem , 1976 .

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

[13]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[14]  Hasan Pirkul,et al.  Locating concentrators for primary and secondary coverage in a computer communications network , 1988, IEEE Trans. Commun..

[15]  Dorit S. Hochbaum,et al.  Database Location in Computer Networks , 1980, JACM.

[16]  B. Gavish,et al.  Topological design of computer communication networks , 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume III: Decision Support and Knowledge Based Systems Track.

[17]  Hasan Pirkul,et al.  Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality , 1985, Math. Program..

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

[19]  Harvey J. Everett.  Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[20]  Boris Polyak.  Minimization of unsmooth functionals , 1969 .

[21]  A. M. Geoffrion,et al.  Lagrangean Relaxation Applied to Capacitated Facility Location Problems , 1978 .

[22]  Bezalel Gavish,et al.  Optimal Lot-Sizing Algorithms for Complex Product Structures , 1986, Oper. Res..

[23]  Joseph B. Mazzola,et al.  Resource-Constrained Assignment Scheduling , 1986, Oper. Res..

[24]  Hasan Pirkul,et al.  Computer and Database Location in Distributed Computer Systems , 1986, IEEE Transactions on Computers.

[25]  Hasan Pirkul,et al.  The siting of emergency service facilities with workload capacities and backup service , 1988 .

[26]  Bezalel Gavish,et al.  Augmented Lagrangean Based Algorithms for Centralized Network Design , 1985, IEEE Trans. Commun..

[27]  S. Martello,et al.  An upper bound for the zero-one knapsack problem and a branch and bound algorithm , 1977 .

[28]  Bezalel Gavish,et al.  On obtaining the 'best' multipliers for a lagrangean relaxation for integer programming , 1978, Comput. Oper. Res..

[29]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[30]  Bezalel Gavish,et al.  An Optimal Solution Method for Large-Scale Multiple Traveling Salesmen Problems , 1986, Oper. Res..

[31]  Hasan Pirkul,et al.  An integer programming model for the allocation of databases in a distributed computer system , 1986 .

[32]  Sidney L. Hantler,et al.  An Algorithm for Optimal Route Selection in SNA Networks , 1983, IEEE Trans. Commun..