Abstract
The generalized assignment problem (GAP), the 0–1 integer programming (IP) problem of assigning a set of n items to a set of m knapsacks, where each item must be assigned to exactly one knapsack and there are constraints on the availability of resources for item assignment, has been further generalized recently to include cases where items may be shared by a pair of adjacent knapsacks. This problem is termed the generalized assignment problem with special ordered sets of type 2 (GAPS2). For reasonably large values of m and n the NP-hard combinatorial problem GAPS2 becomes intractable for standard IP software, hence there is a need for the development of heuristic algorithms to solve such problems. It will be shown how a heuristic algorithm developed previously for the GAP problem can be modified and extended to solve GAPS2. Encouraging results, in terms of speed and accuracy, have been achieved.
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.
Beale, E.M.L. and J.J.H. Forrest. (1976). “Global Optimization Using Special Ordered Sets.” Mathematical Programming 10, 52–69.
Beasley, J.E. (1990). “OR-Library: Distributing Test Problems by Electronic Mail. ” Journal of the Operational Research Society 41, 1069–1072.
Beale, E.M.L. and J.A. Tomlin. (1970). “Special Facilities in a General Mathematical Programming System for Non-Convex Problems Using Ordered Sets of Variables.” In J. Lawrence (ed.), OR 69: Proceedings of the Fifth International Conference on Operational Research, Venice 1969. London: Tavistock Publications, pp. 447–454.
Cattrysse, D., Z. Degraeve, and J. Tistaert. (1998). “Solving the Generalized Assignment Problem Using Polyhedral Results.” European Journal of Operational Research 108, 618–628.
Chu, P.C. and J.E. Beasley. (1997). “A Genetic Algorithm for the Generalized Assignment Problem.” Computers and Operations Research 24, 260–272.
de Farias Jr, I.R., E.L. Johnson, and G.L. Nemhauser. (2000). “A Generalized Assigment Problem with Special Odered Sets: A Polyhedral Approach.” Mathematical Programming 89, 187–203.
Diaz, J.A. and E. Fernandez. (2001). “A Tabu Search Heuristic for the Generalized Assignment Problem.” European Journal of Operational Research132, 22–38.
M.L. Fisher, R. Jaikamur, and L.N. Van Wassenhove. (1986). “A Multiplier Adjustment Method for the Generalized Assignment Problem.” Management Science 32, 1095–1103.
Guignard, M.M. and M.B. Rosenwein. (1989). “An Improved Dual Based Algorithm for the Generalized Assignment Problem.” Operations Research 37, 658–663.
Higgins, A.J. (2001). “A Dynamic Tabu Search for Large-Scale Generalised Assignment Problems.” Computers and Operations Research 28, 1039–1048.
Laguna, M., J. Kelly, J. Gonzalez-Velarde, and F. Glover. (1995). “Tabu Search for the Multilevel Generalized Assignment Problem.” European Journal of Operational Research 82, 176–189.
Lorena, L.A.N. and M.G. Narcisco. (1996). “Relaxation Heuristics for a Generalized Assignment Problem.” European Journal of Operational Research 91, 600–610.
Martello, S. and P. Toth. (1990). Knapsack Problems: Algorithms and Computer implementations. Chichester, England: John Wiley and Sons.
Nauss, R.M. (2003) “Solving the Generalized Assignment Problem: An Optimizing and Heuristic Approach.” INFORMS Journal on Computing 15, 249–266.
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 R.M. Soland. (1975). “A Branch and Bound Algorithm for the Generalized Assignment Problem.” Mathematical Programming 8, 91–103.
Savelsbergh, M. (1997). “A Branch-and-Price Algorithm for the Generalized Assignment Problem.” Operations Research 45, 831–841.
Shmoys, D and E. Tardos. (1993). “An Approximation Algorithm for the Generalized Assignment Problem.” Mathematical Programming 62, 461–474.
Trick, M.A. (1992). “A Linear Relaxation Heuristic for the Generalised Assignment Problem.” Naval Research Logistics 39, 137–151.
Wilson, J.M. (1997a). “A Genetic Algorithm for the Generalised Assignment Problem.” Journal of the Operational Research Society 48, 804–809.
Wilson, J.M. (1997b). “A Simple Dual Algorithm for the Generalised Assignment Problem. ” Journal of Heuristics 2, 303–311.
Yagiura, M, T Yamaguchi, and T. Ibaraki. (1998). “A Variable Depth Search Algorithm with Branching Search for the Generalized Assignment Problem.” Optimization Methods and Software 10, 419–441.
Yagiura, M, T. Ibaraki, and F. Glover. (2002). “A Path Relinking Approach for the Generalized Assignment Problem.” In Proceedings of the International Symposium on Scheduling, Japan, June 4–6, 2002, pp. 105–108.
Yagiura, M, T. Ibaraki, and F. Glover. (2004). “An Ejection Chain Approach for the Generalized Assignment Problem.” INFORMS Journal on Computing 16, 133–151.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Wilson, J.M. An Algorithm for the Generalized Assignment Problem with Special Ordered Sets. J Heuristics 11, 337–350 (2005). https://doi.org/10.1007/s10732-005-3208-6
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s10732-005-3208-6