Skip to main content
SpringerLink
Log in

The Generalized Assignment Problem and Extensions

  • Chapter
Handbook of Combinatorial Optimization

10 Concluding Remarks

In this chapter we have described the state of the art in solving the Generalized Assignment Problem, as well as many extensions thereof. The approach we have taken is to generalize the GAP to a much larger class of Convex Assignment Problems, show that many of the extensions of the GAP proposed in the literature are members of this class, and describe many of the proposed solution approaches to the GAP in terms of the larger class of problems. Throughout the chapter we have paid particular attention to the Generalized Assignment Problem, the Multi-Resource Generalized Assignment Problem, and the Multi-Period Single-Sourcing Problem.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M.M. Amini and M. Racer. A rigorous computational comparison of alternative solution methods for the generalized assignment problem. Management Science, 40(7):868–890, 1994.

    MATH  Google Scholar 

  2. M.M. Amini and M. Racer. A hybrid heuristic for the generalized assignment problem. European Journal of Operational Research, 87:343–348, 1995.

    Article  MATH  Google Scholar 

  3. V. Balachandran. An integer generalized transportation model for optimal job assignment in computer networks. Operations Research, 24(4):742–759, 1976.

    MATH  MathSciNet  Google Scholar 

  4. E. Balas and E. Zemel. Facets of the knapsack polytope from minimal covers. SIAM Journal of Applied Mathematics, 34:119–148, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  5. P. Barcia. The bound improving sequence algorithm. Operations Research Letters, 4(1):27–30, 1985.

    Article  MATH  MathSciNet  Google Scholar 

  6. P. Barcia and K. Jörnsten. Improved Lagrangean decomposition: An application to the generalized assignment problem. European Journal of Operational Research, 46:84–92, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  7. C. Barnhart, E.L. Johnson, G.L. Nemhauser, M.W.P. Savelsbergh, and P.H. Vance. Branch-and-price: column generation for solving huge integer programs. Operations Research, 46(3):316–329, 1998.

    MATH  MathSciNet  Google Scholar 

  8. J. Beardwood, J.H. Halton, and J.M. Hammersley. The shortest path through many points. Proceedings of the Cambridge Philosophical Society, 55:299–327, 1959.

    Article  MATH  MathSciNet  Google Scholar 

  9. J.F. Benders and J.A.E.E. van Nunen. A property of assignment type mixed integer linear programming problems. Operations Research Letters, 2(2): 47–52, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  10. R.J.M. Blocq. Het multi-resource generalised assignment problem toegepast op de toeleveringsstrategie van een oliemaatschappij. Master’s thesis, Vrije Universiteit Amsterdam, 1999.

    Google Scholar 

  11. R.J.M. Blocq, D. Romero Morales, H.E. Romeijn, and G.T. Timmer. The multi-resource generalized assignment problem with an application to the distribution of gasoline products. Working Paper, Department of Decision and Information Sciences, Rotterdam School of Management, The Netherlands, 2000.

    Google Scholar 

  12. J. Bramel and D. Simchi-Levi. The Logic of Logistics — theory, algorithms, and applications for logistics management. Springer-Verlag, New York, 1997.

    MATH  Google Scholar 

  13. J.F. Campbell and A. Langevin. The snow disposal assignment problem. Journal of the Operational Research Society, 46:919–929, 1995.

    Article  MATH  Google Scholar 

  14. D. Cattrysse, Z. Degraeve, and J. Tistaert. Solving the generalised assignment problem using polyhedral results. European Journal of Operational Research, 108:618–628, 1998.

    Article  MATH  Google Scholar 

  15. D.G. Cattrysse. Set Partitioning Approaches to Combinatorial Optimization Problems. PhD thesis, Katholieke Universiteit Leuven, 1990.

    Google Scholar 

  16. D.G. Cattrysse, M. Salomon, and L.N. Van Wassenhove. A set partitioning heuristic for the generalized assignment problem. European Journal of Operational Research, 72:167–174, 1994.

    Article  MATH  Google Scholar 

  17. D.G. Cattrysse and L.N. Van Wassenhove. A survey of algorithms for the generalized assignment problem. European Journal of Operational Research, 60:260–272, 1992.

    Article  MATH  Google Scholar 

  18. L. Chalmet and L. Gelders. Lagrangean relaxation for a generalized assignment-type problem. In M. Roubens, editor, Advances in OR, pages 103–109. EURO, North-Holland, Amsterdam, 1976.

    Google Scholar 

  19. P.C. Chu and J.E. Beasley. A genetic algorithm for the generalised assignment problem. Computers and Operations Research, 24(1):17–23, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  20. A. De Maio and C. Roveda. An all zero-one algorithm for a certain class of transportation problems. Operations Research, 19(6):1406–1418, 1971.

    MATH  Google Scholar 

  21. M. Dyer and A. Frieze. Probabilistic analysis of the generalised assignment problem. Mathematical Programming, 55:169–181, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  22. T.A. Feo and M.G.C. Resende. Greedy randomized adaptive search procedures. Journal of Global Optimization, 6:109–133, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  23. J.A. Ferland, A. Hertz, and A. Lavoie. An object-oriented methodology for solving assignment-type problems with neighborhood search techniques. Operations Research, 44(2):347–359, 1996.

    MATH  MathSciNet  Google Scholar 

  24. M.L. Fisher. The lagrangian relaxation method for solving integer programming problems. Management Science, 27:1–18, 1981.

    MATH  MathSciNet  Google Scholar 

  25. M.L. Fisher and R. Jaikumar. A generalized assignment heuristic for vehicle routing. Networks, 11:109–124, 1981.

    MathSciNet  Google Scholar 

  26. M.L. Fisher, R. Jaikumar, and L.N. Van Wassenhove. A multiplier adjustment method for the generalized assignment problem. Management Science, 32(9):1095–1103, 1986.

    MATH  Google Scholar 

  27. R. Freling, H.E. Romeijn, D. Romero Morales, and A.P.M. Wagelmans. A branch and price algorithm for the multi-period single-sourcing problem. Operations Research, 51(6):922–939, 2003.

    Article  MathSciNet  Google Scholar 

  28. R.S. Garfinkel and G.L. Nemhauser. Set partitioning problem: set covering with equality constraints. Operations Research, 17:848–856, 1969.

    MATH  Google Scholar 

  29. B. Gavish and H. Pirkul. Algorithms for the multi-resource generalized assignment problem. Management Science, 37(6):695–713, 1991.

    MATH  Google Scholar 

  30. A.M. Geoffrion. Lagrangean relaxation for integer programming. Mathematical Programming Studies, 2:82–114, 1974.

    MATH  MathSciNet  Google Scholar 

  31. A.M. Geoffrion and G.W. Graves. Multicommodity distribution system design by Benders decomposition. Management Science, 20(5):822–844, 1974.

    MATH  MathSciNet  Google Scholar 

  32. F. Glover. Surrogate constraints. Operations Research, 16(4):741–749, 1968.

    MATH  MathSciNet  Google Scholar 

  33. F. Glover, J. Hultz, and D. Klingman. Improved computer-based planning techniques, part II. Interfaces, 9(4):12–20, 1979.

    Google Scholar 

  34. E.S. Gottlieb and M.R. Rao. (1, k)-configuration facets for the generalized assignment problem. Mathematical Programming, 46:53–60, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  35. E.S. Gottlieb and M.R. Rao. The generalized assignment problem: Valid inequalities and facets. Mathematical Programming, 46:31–52, 1990.

    Article  MATH  MathSciNet  Google Scholar 

  36. M. Guignard and S. Kim. Lagrangean decomposition: a model yielding stronger lagrangean bounds. Mathematical Programming, 39:215–228, 1987.

    MATH  MathSciNet  Google Scholar 

  37. M. Guignard and M.B. Rosenwein. An improved dual based algorithm for the generalized assignment problem. Operations Research, 37(4):658–663, 1989.

    MATH  MathSciNet  Google Scholar 

  38. N.G. Hall and M.E. Posner. Generating experimental data for scheduling problems. Operations Research, 49(6):854–865, 2001.

    Article  MathSciNet  Google Scholar 

  39. Å Hallefjord, K.O. Jörnsten, and P. Värbrand. Solving large scale generalized assignment problems-An aggregation/disaggregation approach. European Journal of Operational Research, 64:103–114, 1993.

    Article  MATH  Google Scholar 

  40. M. Held, P. Wolfe, and H.P. Crowder. Validation of subgradient optimization. Mathematical Programming, 6:62–88, 1974.

    Article  MATH  MathSciNet  Google Scholar 

  41. K. Jörnsten and M. Näsberg. A new lagrangian relaxation approach to the generalized assignment problem. European Journal of Operational Research, 27:313–323, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  42. K.O. Jörnsten and P. Värbrand. A hybrid algorithm for the generalized assignment problem. Optimization, 22(2):273–282, 1991.

    MATH  MathSciNet  Google Scholar 

  43. N. Karabakal, J.C. Bean, and J.R. Lohmann. A steepest descent multiplier adjustment method for the generalized assignment problem. Technical Report 92-11, Department of Industrial and Operations Engineering, The University of Michigan, 1992.

    Google Scholar 

  44. T.D. Klastorin. On the maximal covering location problem and the generalized assignment problem. Management Science, 25(1):107–113, 1979.

    MATH  Google Scholar 

  45. K. Kogan, A. Shtub, and V.E. Levit. DGAP-the dynamic generalized assignment problem. Annals of Operations Research, 69:227–239, 1997.

    Article  MATH  Google Scholar 

  46. H. Kuhn. A heuristic algorithm for the loading problem in flexible manufacturing systems. International Journal of Flexible Manufacturing Systems, 7:229–254, 1995.

    Article  Google Scholar 

  47. M. Laguna, J.P. Kelly, J.L. González-Velarde, and F. Glover. Tabu search for the multilevel generalized assignment problem. European Journal of Operational Research, 82:176–189, 1995.

    Article  MATH  Google Scholar 

  48. L.A.N. Lorena and M.G. Narciso. Relaxation heuristics for a generalized assignment problem. European Journal of Operational Research, 91:600–610, 1996.

    Article  MATH  Google Scholar 

  49. S. Martello and P. Toth. An algorithm for the generalized assignment problem. In J.P. Brans, editor, Operational Research’ 81, pages 589–603. IFORS, North-Holland, Amsterdam, 1981.

    Google Scholar 

  50. S. Martello and P. Toth. Knapsack problems, algorithms and computer implementations. John Wiley & Sons, New York, 1990.

    MATH  Google Scholar 

  51. S. Martello and P. Toth. The bottleneck generalized assignment problem. European Journal of Operational Research, 83(3):621–638, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  52. J.B. Mazzola. Generalized assignment with nonlinear capacity interaction. Management Science, 35(8):923–941, 1989.

    MATH  MathSciNet  Google Scholar 

  53. J.B. Mazzola and A.W. Neebe. Bottleneck generalized assignment problems. Engineering Costs and Production Economics, 14:61–65, 1988.

    Article  Google Scholar 

  54. M.G. Narciso and L.A.N. Lorena. Lagrangean/surrogate relaxation for generalized assignment problems. European Journal of Operational Research, 114:165–177, 1999.

    Article  MATH  Google Scholar 

  55. A.W. Neebe and M.R. Rao. An algorithm for the fixed-charge assigning users to sources problem. Journal of the Operational Research Society, 34(11):1107–1113, 1983.

    Article  MATH  Google Scholar 

  56. I.H. Osman. Heuristics for the generalised assignment problem: simulated annealing and tabu search approaches. OR Spektrum, 17:211–225, 1995.

    Article  MATH  Google Scholar 

  57. J.S. Park, B.H. Lim, and Y. Lee. A lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem. Management Science, 44(12, part 2 of 2):S271–S282, 1998.

    MATH  Google Scholar 

  58. M. Racer and M.M. Amini. A robust heuristic for the generalized assignment problem. Annals of Operations Research, 50:487–503, 1994.

    Article  MATH  Google Scholar 

  59. H. Ramalhinho Lourenço and D. Serra. Adaptive search heuristics for the generalized assignment problem. Mathware and Soft Computing, 9(2–3):209–234, 2002.

    MATH  MathSciNet  Google Scholar 

  60. H.E. Romeijn and N. Piersma. A probabilistic feasibility and value analysis of the generalized assignment problem. Journal of Combinatorial Optimization, 4(3):325–355, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  61. H.E. Romeijn and D. Romero Morales. A class of greedy algorithms for the generalized assignment problem. Discrete Applied Mathematics, 103:209–235, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  62. H.E. Romeijn and D. Romero Morales. Generating experimental data for the generalized assignment problem. Operations Research, 49(6):866–878, 2001.

    Article  MathSciNet  Google Scholar 

  63. H.E. Romeijn and D. Romero Morales. A probabilistic analysis of the multi-period single-sourcing problem. Discrete Applied Mathematics, 112:301–328, 2001.

    Article  MATH  MathSciNet  Google Scholar 

  64. H.E. Romeijn and D. Romero Morales. An asymptotically optimal greedy heuristic for the multi-period single-sourcing problem: the cyclic case. Naval Research Logistics, 50(5):412–437, 2003.

    Article  MATH  MathSciNet  Google Scholar 

  65. H.E. Romeijn and D. Romero Morales. Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: the acyclic case. Journal of Heuristics, 10:5–35, 2004.

    Article  MATH  Google Scholar 

  66. D. Romero Morales. Optimization Problems in Supply Chain Management. PhD thesis, TRAIL Thesis Series nr. 2000/4 & ERIM PhD series Research in Management nr. 3, The Netherlands, 2000.

    Google Scholar 

  67. G.T. Ross and R.M. Soland. A branch and bound algorithm for the generalized assignment problem. Mathematical Programming, 8:91–103, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  68. G.T. Ross and R.M. Soland. Modeling facility location problems as generalized assignment problems. Management Science, 24(3):345–357, 1977.

    Article  MATH  Google Scholar 

  69. M.W.P. Savelsbergh. A branch-and-price algorithm for the generalized assignment problem. Operations Research, 45(6):831–841, 1997.

    MATH  MathSciNet  Google Scholar 

  70. D.B. Shmoys and É. Tardos. An approximation algorithm for the generalized assignment problem. Mathematical Programming, 62:461–474, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  71. A. Shtub and K. Kogan. Capacity planning by a dynamic multi-resource generalized assignment problem (DMRGAP). European Journal of Operational Research, 105:91–99, 1998.

    Article  MATH  Google Scholar 

  72. V. Srinivasan and G.L. Thompson. An algorithm for assigning uses to sources in a special class of transportation problems. Operations Research, 21:284–295, 1972.

    Google Scholar 

  73. T. Stützle and H. Hoos. The max-min ant system and local search for combinatorial optimization problems: Towards adaptive tools for combinatorial global optimization. In S. Voss, S. Martello, I.H. Osman, and C. Roucairol, editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 313–329. Kluwer Academic Publishers, 1998.

    Google Scholar 

  74. M.A. Trick. A linear relaxation heuristic for the generalized assignment problem. Naval Research Logistics, 39:137–151, 1992.

    MATH  MathSciNet  Google Scholar 

  75. J.M. Wilson. A genetic algorithm for the generalised assignment problem. Journal of the Operational Research Society, 48:804–809, 1997.

    Article  MATH  Google Scholar 

  76. J.M. Wilson. A simple dual algorithm for the generalised assignment problem. Journal of Heuristics, 2:303–311, 1997.

    Article  MATH  Google Scholar 

  77. M. Yagiura, T. Ibaraki, and F. Glover. An ejection chain approach for the generalized assignment problem. Technical Report 99013, Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto Univeristy, 1999.

    Google Scholar 

  78. M. Yagiura, T. Yamaguchi, and T. Ibaraki. A variable depth search algorithm for the generalized assignment problem. In S. Voss, S. Martello, I.H. Osman, and C. Roucairol, editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 459–471. Kluwer Academic Publishers, 1998.

    Google Scholar 

  79. V.A. Zimokha and M.I. Rubinshtein. R & D planning and the generalized assignment problem. Automation and Remote Control, 49:484–492, 1988.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Saïd Business School, University of Oxford, Oxford, 0X1 1HP, UK

    Dolores Romero Morales

  2. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, 32611

    H. Edwin Romeijn

Authors
  1. Dolores Romero Morales
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. H. Edwin Romeijn
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Minnesota, Minneapolis, MN

    Ding-Zhu Du

  2. University of Florida, Gainesville, FL

    Panos M. Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Kluwer Academic Publishers

About this chapter

Cite this chapter

Morales, D.R., Romeijn, H.E. (2004). The Generalized Assignment Problem and Extensions. In: Du, DZ., Pardalos, P.M. (eds) Handbook of Combinatorial Optimization. Springer, Boston, MA. https://doi.org/10.1007/0-387-23830-1_6

Download citation

Publish with us

Policies and ethics

Search

Navigation