pp 1–17 | Cite as

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

  • Sujeet Kumar Singh
  • Deepika RaniEmail author
Application Article


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.


Generalized machine allocation problem Grade function Uncertainty Binary problems Transportation problem 

Mathematics Subject Classification

90C05 90C57 90C70 



  1. 1.
    Aickelin, U., Dowsland, K.A.: An indirect genetic algorithm for a nurse scheduling problem. Comput. Oper. Res. 31, 761–778 (2004)CrossRefGoogle Scholar
  2. 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)Google Scholar
  3. 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. 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)CrossRefGoogle Scholar
  5. 5.
    Chen, L.H., Lu, H.W.: An extended assignment problem considering multiple and outputs. Appl. Math. Model. 31, 2239–2248 (2007)CrossRefGoogle Scholar
  6. 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)CrossRefGoogle Scholar
  7. 7.
    Fadaei, S., Bichler, M.: Generalized assignment problem: truthful mechanism design without money. Oper. Res. Lett. 45, 72–76 (2017)CrossRefGoogle Scholar
  8. 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)CrossRefGoogle Scholar
  9. 9.
    Hooker, J.N.: Generalized resolution for 01 linear inequalities. Ann. Math. Artif. Intell. 6, 271–286 (1992)CrossRefGoogle Scholar
  10. 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)CrossRefGoogle Scholar
  11. 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)CrossRefGoogle Scholar
  12. 12.
    Kaufmann, A., Gupta, M.M.: Introduction to Fuzzy Arithmetics: Theory and Applications. Van Nostrand Reinhold, New York (1985)Google Scholar
  13. 13.
    Klir, G.J., Smith, R.M.: On measuring uncertainty and uncertainty-based information: recent developments. Ann. Math. Artif. Intell. 32, 5–33 (2002)CrossRefGoogle Scholar
  14. 14.
    Lin, C.J., Wen, U.P.: A labeling algorithm for the fuzzy assignment problem. Fuzzy Sets Syst. 142, 373–391 (2004)CrossRefGoogle Scholar
  15. 15.
    Liu, L., Gao, X.: Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm. Appl. Math. Model. 33, 3926–3935 (2009)CrossRefGoogle Scholar
  16. 16.
    Majumdar, J., Bhunia, A.K.: Elitist genetic algorithm for assignment problem with imprecise goal. Eur. J. Oper. Res. 177, 684–692 (2007)CrossRefGoogle Scholar
  17. 17.
    Ozbakir, L., Baykasoǧlu, A., Tapkan, P.: Bees algorithm for generalized assignment problem. Appl. Math. Comput. 215, 3782–3795 (2010)Google Scholar
  18. 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)CrossRefGoogle Scholar
  19. 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)CrossRefGoogle Scholar
  20. 20.
    Termini, S.: On some vagaries of vagueness and information. Ann. Math. Artif. Intell. 35, 343–355 (2002)CrossRefGoogle Scholar
  21. 21.
    Toth, P., Vigo, D.: The vehicle routing problem. SIAM monographs on discrete mathematics and applications, Philadelphia (2001)Google Scholar
  22. 22.
    Wang, X., Kerre, E.E.: Reasonable properties for the ordering of fuzzy quantities. Fuzzy Sets Syst. 118, 375–385 (2001)CrossRefGoogle Scholar
  23. 23.
    Winston, W.L., Venkataramanan, M.: Introduction to Mathematical Programming, 4th edn. Thomson Brooks/Cole, Pacific Grove (2003)Google Scholar
  24. 24.
    Yagiura, M., Ibaraki, T., Glover, F.: An ejection chain approach for the generalized assignment problem. INFORMS J. Comput. 16, 133–151 (2004)CrossRefGoogle Scholar
  25. 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)CrossRefGoogle Scholar
  26. 26.
    Zadeh, L.A.: Fuzzy sets. Inf. Control 8, 338–353 (1965)CrossRefGoogle Scholar

Copyright information

© Operational Research Society of India 2019

Authors and Affiliations

  1. 1.The Logistics Institute- Asia PacificNational University of SingaporeSingaporeSingapore
  2. 2.Department of MathematicsDr. B. R. Ambedkar National Institute of TechnologyJalandharIndia

Personalised recommendations