Abstract
A new algorithm for the generalised assignment problem is described in this paper. The dual-type algorithm uses a simple heuristic derived from a relaxation of the problem. The algorithm has been tested on generalised assignment problems of substantial size and compared to an exact integer programming approach and a well-established heuristic approach. Computational results look promising in terms of speed and solution quality.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Amini, M.M. and M.Racer. (1994). “A Rigorous Comparison of Alternative Solution Methods for the Generalized Assignment Problem,” Management Science 40, 868–890.
Fisher, M.L., R.Jaikumar and L.N.VanWassenhove. (1986). “A Multiplier Adjustment Method for the Generalized Assignment Problem,” Management Science 32, 1095–1103.
Foulds, L.R. and J.M. Wilson. (1994). “A Variation on the Generalized Assignment Problem Arising in the New Zealand Dairy Industry.” Working paper, Loughborough University Business School. To appear in Annals of Operations Research.
Guignard, M.M. and M.B.Rosenwein. (1989). “An Improved Dual Based Algorithm for the Generalized Assignment Problem,” Operations Research 37, 658–663.
Laguna, M., J.P.Kelly, J.L.Gonzalez-Velarde, and F.Glover. (1995). “Tabu Search for the Multilevel Generalized Assignment Problem,” European Journal of Operational Research 82, 176–189.
Martello, S. and P.Toth. (1981). “An Algorithm for the Generalized Assignment Problem.” In J.P.Brans (Ed.), Operational Research '81, 589–603, North-Holland, Amsterdam.
Martello, S. and P.Toth. (1990). Knapsack Problems: Algorithms and Computer Implementations. Chichester: John Wiley and Sons.
Osman, I.H. (1990). “A Comparison of Heuristics for the Generalised Assignment Problem.” Working Paper, Institute of Mathematics and Statistics, University of Kent, Kent, England.
Osman, I.H. (1995). “Heuristics for the Generalised Assignment Problem: Simulated Annealing and Tabu Search Approaches,” OR Spektrum 17, 211–225.
Ross, G.T. and P.M.Soland. (1975). “A Branch and Bound Based Algorithm for the Generalized Assignment Problem,” Mathematical Programming 8, 91–103.
Sciconic/VM. EDS-Scicon, Wavendon Tower, Milton Keynes, Bedfordshire, England.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wilson, J.M. A simple dual algorithm for the generalised assignment problem. J Heuristics 2, 303–311 (1997). https://doi.org/10.1007/BF00132501
Issue Date:
DOI: https://doi.org/10.1007/BF00132501