IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v56y2019i3d10.1007_s12597-019-00378-z.html
   My bibliography  Save this article

A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem

Author

Listed:
  • Sujeet Kumar Singh

    (National University of Singapore)

  • Deepika Rani

    (Dr. B. R. Ambedkar National Institute of Technology)

Abstract

This paper studies a new algorithm to solve the uncertain generalized assignment problem. The presented technique is based on the concept of branch and bound rather than the usual simplex based techniques. At first, the problem is relaxed to the transportation model which is easy to handle and work with. The model, so obtained is solved by the conventional transportation technique. The obtained solution serves as starting solution for further sub problems. The ambiguity in parameters is represented by triangular fuzzy numbers. We propose a linear ranking function, called the grade function which is based on the centroid method. The grade function is used to rank the triangular fuzzy numbers. The proposed approach is justified numerically by showing its application in generalized machine allocation problem.

Suggested Citation

  • Sujeet Kumar Singh & Deepika Rani, 2019. "A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem," OPSEARCH, Springer;Operational Research Society of India, vol. 56(3), pages 1007-1023, September.
    • Handle: RePEc:spr:opsear:v:56:y:2019:i:3:d:10.1007_s12597-019-00378-z
    DOI: 10.1007/s12597-019-00378-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-019-00378-z
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12597-019-00378-z?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Yagiura, Mutsunori & Ibaraki, Toshihide & Glover, Fred, 2006. "A path relinking approach with ejection chains for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 169(2), pages 548-569, March.
    2. Cattrysse, Dirk G. & Van Wassenhove, Luk N., 1992. "A survey of algorithms for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 60(3), pages 260-272, August.
    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. 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.
    5. Karsak, E. Ertugrul & Kuzgunkaya, Onur, 2002. "A fuzzy multiple objective programming approach for the selection of a flexible manufacturing system," International Journal of Production Economics, Elsevier, vol. 79(2), pages 101-111, September.
    6. Majumdar, J. & Bhunia, A.K., 2007. "Elitist genetic algorithm for assignment problem with imprecise goal," European Journal of Operational Research, Elsevier, vol. 177(2), pages 684-692, March.
    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. Helena Gaspars-Wieloch, 2021. "The Assignment Problem in Human Resource Project Management under Uncertainty," Risks, MDPI, vol. 9(1), pages 1-17, January.

    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. 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).
    2. 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.
    3. M. Gaudioso & L. Moccia & M. F. Monaco, 2010. "Repulsive Assignment Problem," Journal of Optimization Theory and Applications, Springer, vol. 144(2), pages 255-273, February.
    4. Franck Butelle & Laurent Alfandari & Camille Coti & Lucian Finta & Lucas Létocart & Gérard Plateau & Frédéric Roupin & Antoine Rozenknop & Roberto Wolfler Calvo, 2016. "Fast machine reassignment," Annals of Operations Research, Springer, vol. 242(1), pages 133-160, July.
    5. M Büther, 2010. "Reducing the elastic generalized assignment problem to the standard generalized assignment problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1582-1595, November.
    6. Büther, Marcel, 2007. "Reducing the elastic generalized assignment problem to the standard generalized assignment problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 632, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    7. Büther, Marcel, 2008. "Beam search for the elastic generalized assignment problem," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 634, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    8. Mehdi Mrad & Anis Gharbi & Mohamed Haouari & Mohamed Kharbeche, 2016. "An optimization-based heuristic for the machine reassignment problem," Annals of Operations Research, Springer, vol. 242(1), pages 115-132, July.
    9. 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.
    10. Vié, Marie-Sklaerder & Zufferey, Nicolas & Cordeau, Jean-François, 2019. "Solving the Wire-Harness Design Problem at a European car manufacturer," European Journal of Operational Research, Elsevier, vol. 272(2), pages 712-724.
    11. Marius Posta & Jacques Ferland & Philippe Michelon, 2012. "An exact method with variable fixing for solving the generalized assignment problem," Computational Optimization and Applications, Springer, vol. 52(3), pages 629-644, July.
    12. Ahmed Ghoniem & Tulay Flamand & Mohamed Haouari, 2016. "Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 575-588, August.
    13. Salim Haddadi, 2019. "Variable-fixing then subgradient optimization guided very large scale neighborhood search for the generalized assignment problem," 4OR, Springer, vol. 17(3), pages 261-295, September.
    14. Majumdar, J. & Bhunia, A.K., 2007. "Elitist genetic algorithm for assignment problem with imprecise goal," European Journal of Operational Research, Elsevier, vol. 177(2), pages 684-692, March.
    15. Mangesh Gharote & Rahul Patil & Sachin Lodha, 2017. "Scatter search for trainees to software project requirements stable allocation," Journal of Heuristics, Springer, vol. 23(4), pages 257-283, August.
    16. Marti, Rafael, 2006. "Scatter Search--Wellsprings and Challenges," European Journal of Operational Research, Elsevier, vol. 169(2), pages 351-358, March.
    17. Holzapfel, Andreas & Potoczki, Tobias & Kuhn, Heinrich, 2023. "Designing the breadth and depth of distribution networks in the retail trade," International Journal of Production Economics, Elsevier, vol. 257(C).
    18. Tomino, Takahiro & Park, Youngwon & Hong, Paul & Roh, James Jungbae, 2009. "Market flexible customizing system (MFCS) of Japanese vehicle manufacturers: An analysis of Toyota, Nissan and Mitsubishi," International Journal of Production Economics, Elsevier, vol. 118(2), pages 375-386, April.
    19. Richard Freling & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2003. "A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem," Operations Research, INFORMS, vol. 51(6), pages 922-939, December.
    20. Imai, Akio & Nishimura, Etsuko & Current, John, 2007. "A Lagrangian relaxation-based heuristic for the vehicle routing with full container load," European Journal of Operational Research, Elsevier, vol. 176(1), pages 87-105, January.

    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:spr:opsear:v:56:y:2019:i:3:d:10.1007_s12597-019-00378-z. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.