Skip to main content
SpringerLink
Log in

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

  • Application Article
  • Published:
OPSEARCH Aims and scope Submit manuscript

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.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Aickelin, U., Dowsland, K.A.: An indirect genetic algorithm for a nurse scheduling problem. Comput. Oper. Res. 31, 761–778 (2004)

    Article  Google Scholar 

  2. Bai, X.J., Liu, Y.K., Shen, S.Y.: Fuzzy generalized assignmnet problem with credibility constraints. In: Proceedings of the Eighth International Conference on Machine Learning and Cybernetics, Baoding, pp. 657–662 (2009)

  3. Baykasoǧlu, A., Göçken, T.: A review and classification of fuzzy mathematical programs. J. Intell. Fuzzy Syst. 19, 205–229 (2008)

    Google Scholar 

  4. Cattrysse, D.G., Wassenhove, L.N.V.: A survey of algorithms for the generalized assignment problem. Eur. J. Oper. Res. 60, 260–272 (1992)

    Article  Google Scholar 

  5. Chen, L.H., Lu, H.W.: An extended assignment problem considering multiple and outputs. Appl. Math. Model. 31, 2239–2248 (2007)

    Article  Google Scholar 

  6. Dua, J., Li, X., Yua, L., Dan, R., Zhou, J.: Multi-depot vehicle routing problem for hazardous materials transportation: a fuzzy bilevel programming. Inf. Sci. 399, 201–218 (2017)

    Article  Google Scholar 

  7. Fadaei, S., Bichler, M.: Generalized assignment problem: truthful mechanism design without money. Oper. Res. Lett. 45, 72–76 (2017)

    Article  Google Scholar 

  8. Harper, P.R., Senna, V., Vieira, I.T., Shahani, A.K.: A genetic algorithm for the project assignment problem. Comput. Oper. Res. 32, 1255–1265 (2005)

    Article  Google Scholar 

  9. Hooker, J.N.: Generalized resolution for 01 linear inequalities. Ann. Math. Artif. Intell. 6, 271–286 (1992)

    Article  Google Scholar 

  10. Jeet, V., Kutanoglu, E.: Lagrangian relaxation guided problem space search heuristics for generalized assignment problems. Eur. J. Oper. Res. 127(3), 1039–1056 (2007)

    Article  Google Scholar 

  11. Karsak, E.E., Kuzgunkaya, O.: A fuzzy multiple objective programming approach for the selection of a flexible manufacturing system. Int. J. Prod. Econ. 79, 101–111 (2002)

    Article  Google Scholar 

  12. Kaufmann, A., Gupta, M.M.: Introduction to Fuzzy Arithmetics: Theory and Applications. Van Nostrand Reinhold, New York (1985)

    Google Scholar 

  13. Klir, G.J., Smith, R.M.: On measuring uncertainty and uncertainty-based information: recent developments. Ann. Math. Artif. Intell. 32, 5–33 (2002)

    Article  Google Scholar 

  14. Lin, C.J., Wen, U.P.: A labeling algorithm for the fuzzy assignment problem. Fuzzy Sets Syst. 142, 373–391 (2004)

    Article  Google Scholar 

  15. Liu, L., Gao, X.: Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm. Appl. Math. Model. 33, 3926–3935 (2009)

    Article  Google Scholar 

  16. Majumdar, J., Bhunia, A.K.: Elitist genetic algorithm for assignment problem with imprecise goal. Eur. J. Oper. Res. 177, 684–692 (2007)

    Article  Google Scholar 

  17. Ozbakir, L., Baykasoǧlu, A., Tapkan, P.: Bees algorithm for generalized assignment problem. Appl. Math. Comput. 215, 3782–3795 (2010)

    Google Scholar 

  18. Sakawa, M., Nishizaki, I., Hitaka, M.: Interactive fuzzy programming for multi-objective 0–1 programming problems with fuzzy parameters through genetic algorithms. Fuzzy Sets Syst. 117, 95–111 (2001)

    Article  Google Scholar 

  19. Tapkan, P., Ozbakr, L., Baykasoǧlu, A.: Solving fuzzy multiple objective generalized assignment problems directly via bees algorithm and fuzzy ranking. Expert Syst. Appl. 40, 892–898 (2013)

    Article  Google Scholar 

  20. Termini, S.: On some vagaries of vagueness and information. Ann. Math. Artif. Intell. 35, 343–355 (2002)

    Article  Google Scholar 

  21. Toth, P., Vigo, D.: The vehicle routing problem. SIAM monographs on discrete mathematics and applications, Philadelphia (2001)

  22. Wang, X., Kerre, E.E.: Reasonable properties for the ordering of fuzzy quantities. Fuzzy Sets Syst. 118, 375–385 (2001)

    Article  Google Scholar 

  23. Winston, W.L., Venkataramanan, M.: Introduction to Mathematical Programming, 4th edn. Thomson Brooks/Cole, Pacific Grove (2003)

    Google Scholar 

  24. Yagiura, M., Ibaraki, T., Glover, F.: An ejection chain approach for the generalized assignment problem. INFORMS J. Comput. 16, 133–151 (2004)

    Article  Google Scholar 

  25. Yagiura, M., Ibaraki, T., Glover, F.: A path relinking approach with ejection chains for the generalized assignment problem. Eur. J. Oper. Res. 127, 548–569 (2006)

    Article  Google Scholar 

  26. Zadeh, L.A.: Fuzzy sets. Inf. Control 8, 338–353 (1965)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Logistics Institute- Asia Pacific, National University of Singapore, Singapore, 119613, Singapore

    Sujeet Kumar Singh

  2. Department of Mathematics, Dr. B. R. Ambedkar National Institute of Technology, Jalandhar, Punjab, 144011, India

    Deepika Rani

Authors
  1. Sujeet Kumar Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Deepika Rani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Deepika Rani.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Singh, S.K., Rani, D. A branching algorithm to solve binary problem in uncertain environment: an application in machine allocation problem. OPSEARCH 56, 1007–1023 (2019). https://doi.org/10.1007/s12597-019-00378-z

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12597-019-00378-z

Keywords

Mathematics Subject Classification

Search

Navigation