IDEAS home Printed from https://ideas.repec.org/a/etr/series/v3y2012i9p326-329.html
   My bibliography  Save this article

0-1 integer interval number programming approach for the multilevel generalized assignment problem

Author

Listed:
  • Samir A. Abass

    (Department of Mathematics and Theoretical Physics, Nuclear Research Center, Atomic Energy Authority, P.O. Box 13759, Cairo, Egypt)

Abstract

In this paper, an approach is suggested to solve the multilevel generalized assignment problem with 0-1 integer interval number programming. The multilevel generalized assignment problem (MGAP) differs from the classical GAP in that agents can perform tasks at more than one efficiency level. The large number of variables in the related 0–1 integer program makes it hard to ?nd optimal solutions to these problems, even when using powerful commercial optimization packages. In the real world, however, the parameters are seldom known exactly and have to be estimated. Interval programming is one of the tools to tackle uncertainty in mathematical programming models. In the multilevel generalized assignment problem (MGAP) agents can perform tasks at more than one efficiency level. A profit is associated with each assignment and the objective of the problem is profit maximization. A parametric study is carried out for the problem of concern.

Suggested Citation

  • Samir A. Abass, 2012. "0-1 integer interval number programming approach for the multilevel generalized assignment problem," E3 Journal of Business Management and Economics., E3 Journals, vol. 3(9), pages 326-329.
    • Handle: RePEc:etr:series:v:3:y:2012:i:9:p:326-329
    as

    Download full text from publisher

    File URL: http://www.e3journals.org/cms/articles/1349065086_Samir.pdf
    File Function: Full text
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Laguna, Manuel & Kelly, James P. & Gonzalez-Velarde, JoseLuis & Glover, Fred, 1995. "Tabu search for the multilevel generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 82(1), pages 176-189, April.
    2. Jiang, C. & Han, X. & Liu, G.R. & Liu, G.P., 2008. "A nonlinear interval number programming method for uncertain optimization problems," European Journal of Operational Research, Elsevier, vol. 188(1), pages 1-13, July.
    3. Woodcock, Andrew J. & Wilson, John M., 2010. "A hybrid tabu search/branch & bound approach to solving the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 566-578, December.
    Full references (including those not matched with items on IDEAS)

    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. Zäpfel, Günther & Bögl, Michael, 2012. "Two heuristic solution concepts for the vehicle selection problem in line haul transports," European Journal of Operational Research, Elsevier, vol. 217(2), pages 448-458.
    2. Gelareh, Shahin & Glover, Fred & Guemri, Oualid & Hanafi, Saïd & Nduwayo, Placide & Todosijević, Raca, 2020. "A comparative study of formulations for a cross-dock door assignment problem," Omega, Elsevier, vol. 91(C).
    3. Mutsunori Yagiura & Toshihide Ibaraki & Fred Glover, 2004. "An Ejection Chain Approach for the Generalized Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 16(2), pages 133-151, May.
    4. Mahdi Zarghami & Nasim Safari & Ferenc Szidarovszky & Shafiqul Islam, 2015. "Nonlinear Interval Parameter Programming Combined with Cooperative Games: a Tool for Addressing Uncertainty in Water Allocation Using Water Diplomacy Framework," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 29(12), pages 4285-4303, September.
    5. Francisco Castillo-Zunino & Pinar Keskinocak, 2021. "Bi-criteria multiple knapsack problem with grouped items," Journal of Heuristics, Springer, vol. 27(5), pages 747-789, October.
    6. Helena Ramalhinho-Lourenço & Daniel Serra, 1998. "Adaptive approach heuristics for the generalized assignment problem," Economics Working Papers 288, Department of Economics and Business, Universitat Pompeu Fabra.
    7. Sexton, Randall S. & Alidaee, Bahram & Dorsey, Robert E. & Johnson, John D., 1998. "Global optimization for artificial neural networks: A tabu search application," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 570-584, April.
    8. 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.
    9. Mar-Ortiz, Julio & Castillo-García, Norberto & Gracia, María D., 2020. "A decision support system for a capacity management problem at a container terminal," International Journal of Production Economics, Elsevier, vol. 222(C).
    10. Mengzhuo Bai & Chunyang Ren & Yang Liu, 2015. "A note of reduced dimension optimization algorithm of assignment problem," Journal of Combinatorial Optimization, Springer, vol. 30(4), pages 841-849, November.
    11. Woodcock, Andrew J. & Wilson, John M., 2010. "A hybrid tabu search/branch & bound approach to solving the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 207(2), pages 566-578, December.
    12. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    13. Talla Nobibon, Fabrice & Leus, Roel & Spieksma, Frits C.R., 2011. "Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms," European Journal of Operational Research, Elsevier, vol. 210(3), pages 670-683, May.
    14. Chongxin Huang & Dong Yue & Song Deng & Jun Xie, 2017. "Optimal Scheduling of Microgrid with Multiple Distributed Resources Using Interval Optimization," Energies, MDPI, vol. 10(3), pages 1-23, March.
    15. Huang, Min & Qian, Xiaohu & Fang, Shu-Cherng & Wang, Xingwei, 2016. "Winner determination for risk aversion buyers in multi-attribute reverse auction," Omega, Elsevier, vol. 59(PB), pages 184-200.
    16. Hongsheng Zhong & Randolph W. Hall & Maged Dessouky, 2007. "Territory Planning and Vehicle Dispatching with Driver Learning," Transportation Science, INFORMS, vol. 41(1), pages 74-89, February.
    17. Dapeng Wang & Cong Zhang & Wanqing Jia & Qian Liu & Long Cheng & Huaizhi Yang & Yufeng Luo & Na Kuang, 2022. "A Novel Interval Programming Method and Its Application in Power System Optimization Considering Uncertainties in Load Demands and Renewable Power Generation," Energies, MDPI, vol. 15(20), pages 1-19, October.
    18. Abhijit Baidya & Uttam Kumar Bera & Manoranjan Maiti, 2016. "The grey linear programming approach and its application to multi-objective multi-stage solid transportation problem," OPSEARCH, Springer;Operational Research Society of India, vol. 53(3), pages 500-522, September.
    19. Banafsheh Nematollahi & Mohammad Reza Nikoo & Amir H. Gandomi & Nasser Talebbeydokhti & Gholam Reza Rakhshandehroo, 2022. "A Multi-criteria Decision-making Optimization Model for Flood Management in Reservoirs," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 36(13), pages 4933-4949, October.
    20. Debdas Ghosh, 2016. "A Newton method for capturing efficient solutions of interval optimization problems," OPSEARCH, Springer;Operational Research Society of India, vol. 53(3), pages 648-665, September.

    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:etr:series:v:3:y:2012:i:9:p:326-329. 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: Andrew Godwin The email address of this maintainer does not seem to be valid anymore. Please ask Andrew Godwin to update the entry or send us the correct address (email available below). General contact details of provider: .

    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.