IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v48y2001i6p468-483.html
   My bibliography  Save this article

Heuristics for the multi‐resource generalized assignment problem

Author

Listed:
  • Joseph B. Mazzola
  • Steven P. Wilcox

Abstract

The well‐known generalized assignment problem (GAP) involves the identification of a minimum‐cost assignment of tasks to agents when each agent is constrained by a resource in limited supply. The multi‐resource generalized assignment problem (MRGAP) is the generalization of the GAP in which there are a number of different potentially constraining resources associated with each agent. This paper explores heuristic procedures for the MRGAP. We first define a three‐phase heuristic which seeks to construct a feasible solution to MRGAP and then systematically attempts to improve the solution. We then propose a modification of the heuristic for the MRGAP defined previously by Gavish and Pirkul. The third procedure is a hybrid heuristic that combines the first two heuristics, thus capturing their relative strengths. We discuss extensive computational experience with the heuristics. The hybrid procedure is seen to be extremely effective in solving MRGAPs, generating feasible solutions to more than 99% of the test problems and consistently producing near‐optimal solutions. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48: 468–483, 2001

Suggested Citation

  • Joseph B. Mazzola & Steven P. Wilcox, 2001. "Heuristics for the multi‐resource generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(6), pages 468-483, September.
    • Handle: RePEc:wly:navres:v:48:y:2001:i:6:p:468-483
    DOI: 10.1002/nav.1029
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nav.1029
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nav.1029?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Joseph B. Mazzola & Alan W. Neebe, 1986. "Resource-Constrained Assignment Scheduling," Operations Research, INFORMS, vol. 34(4), pages 560-572, August.
    2. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    3. G. Terry Ross & Richard M. Soland, 1977. "Modeling Facility Location Problems as Generalized Assignment Problems," Management Science, INFORMS, vol. 24(3), pages 345-357, November.
    4. Monique Guignard & Moshe B. Rosenwein, 1989. "Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem," Operations Research, INFORMS, vol. 37(4), pages 658-663, August.
    5. Joseph B. Mazzola, 1989. "Generalized Assignment with Nonlinear Capacity Interaction," Management Science, INFORMS, vol. 35(8), pages 923-941, August.
    6. Gerard Cornuejols & Marshall L. Fisher & George L. Nemhauser, 1977. "Exceptional Paper--Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms," Management Science, INFORMS, vol. 23(8), pages 789-810, April.
    7. CORNUEJOLS, Gérard & FISHER, Marshall L. & NEMHAUSER, George L., 1977. "Location of bank accounts to optimize float: An analytic study of exact and approximate algorithms," LIDAM Reprints CORE 292, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    8. Pirkul, Hasan, 1986. "An integer programming model for the allocation of databases in a distributed computer system," European Journal of Operational Research, Elsevier, vol. 26(3), pages 401-411, September.
    9. Marshall L. Fisher & R. Jaikumar & Luk N. Van Wassenhove, 1986. "A Multiplier Adjustment Method for the Generalized Assignment Problem," Management Science, INFORMS, vol. 32(9), pages 1095-1103, September.
    10. Michael A. Trick, 1992. "A linear relaxation heuristic for the generalized assignment problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 39(2), pages 137-151, March.
    11. Gavish, Bezalel & Pirkul, Hasan, 1985. "Zero-one integer programs with few constraints --Efficient branch and bound algorithms," European Journal of Operational Research, Elsevier, vol. 22(1), pages 35-43, October.
    12. Gavish, Bezalel & Pirkul, Hasan, 1985. "Zero-one integer programs with few constraints --Lower bounding theory," European Journal of Operational Research, Elsevier, vol. 21(2), pages 213-224, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Monnerat, Filipe & Dias, Joana & Alves, Maria João, 2019. "Fleet management: A vehicle and driver assignment model," European Journal of Operational Research, Elsevier, vol. 278(1), pages 64-75.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Cattrysse, D. G. & van Wassenhove, L. N., 1990. "A Survey Of Algorithms For The Generalized Assignment Problem," Econometric Institute Archives 272389, Erasmus University Rotterdam.
    2. Haddadi, Salim & Ouzia, Hacene, 2004. "Effective algorithm and heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 153(1), pages 184-190, February.
    3. Joseph B. Mazzola & Alan W. Neebe, 2012. "A generalized assignment model for dynamic supply chain capacity planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(6), pages 470-485, September.
    4. H. Edwin Romeijn & Dolores Romero Morales, 2001. "Generating Experimental Data for the Generalized Assignment Problem," Operations Research, INFORMS, vol. 49(6), pages 866-878, December.
    5. Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.
    6. Zohreh Hosseini Nodeh & Ali Babapour Azar & Rashed Khanjani Shiraz & Salman Khodayifar & Panos M. Pardalos, 2020. "Joint chance constrained shortest path problem with Copula theory," Journal of Combinatorial Optimization, Springer, vol. 40(1), pages 110-140, July.
    7. Joshua Q. Hale & Enlu Zhou & Jiming Peng, 2017. "A Lagrangian search method for the P-median problem," Journal of Global Optimization, Springer, vol. 69(1), pages 137-156, September.
    8. Narciso, Marcelo G. & Lorena, Luiz Antonio N., 1999. "Lagrangean/surrogate relaxation for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 114(1), pages 165-177, April.
    9. Amini, Mohammad M. & Racer, Michael & Ghandforoush, Parviz, 1998. "Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study," European Journal of Operational Research, Elsevier, vol. 108(3), pages 604-617, August.
    10. Lorena, Luiz Antonio N. & Narciso, Marcelo G., 1996. "Relaxation heuristics for a generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 91(3), pages 600-610, June.
    11. Drexl, Andreas & Jørnsten, Kurt, 2007. "Pricing the generalized assignment problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 627, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    12. Marshall L. Fisher, 2004. "Comments on ÜThe Lagrangian Relaxation Method for Solving Integer Programming ProblemsÝ," Management Science, INFORMS, vol. 50(12_supple), pages 1872-1874, December.
    13. Jeet, V. & Kutanoglu, E., 2007. "Lagrangian relaxation guided problem space search heuristics for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 182(3), pages 1039-1056, November.
    14. Klose, Andreas & Drexl, Andreas, 2001. "Combinatorial optimisation problems of the assignment type and a partitioning approach," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 545, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    15. Wu, Dexiang & Kwon, Roy H. & Costa, Giorgio, 2017. "A constrained cluster-based approach for tracking the S&P 500 index," International Journal of Production Economics, Elsevier, vol. 193(C), pages 222-243.
    16. Li, Xiaopeng & Ouyang, Yanfeng, 2011. "Reliable sensor deployment for network traffic surveillance," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 218-231, January.
    17. Martello, Silvano & Toth, Paolo, 1995. "The bottleneck generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 83(3), pages 621-638, June.
    18. P N Ram Kumar & T T Narendran, 2011. "On the usage of Lagrangean Relaxation for the convoy movement problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 722-728, April.
    19. Charles H. Reilly, 2009. "Synthetic Optimization Problem Generation: Show Us the Correlations!," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 458-467, August.
    20. O Berman & R Huang, 2004. "Minisum collection depots location problem with multiple facilities on a network," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 769-779, July.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wly:navres:v:48:y:2001:i:6:p:468-483. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.