Skip to main content

Minimum Risk Generalized Assignment Problem and Its Particle Swarm Optimization Algorithm

  • Conference paper
Information and Automation (ISIA 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 86))

Included in the following conference series:

  • 1233 Accesses

Abstract

This paper addresses a new class of two-stage minimum risk generalized assignment problems, in which the resource amounts consumed are represented in the form of fuzzy variables with known possibility distributions. To calculate the credibility in the objective function, an approximation approach (AA) is employed to turn the fuzzy GAP model into an approximating one. Since traditional optimization methods cannot be used to solve the approximating GAP model, to overcome this difficulty, we design a hybrid algorithm integrating the approximation approach and particle swarm optimization (PSO). Finally, one numerical example with six tasks and three agents is given to illustrate the effectiveness of the designed intelligent algorithm.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Albareda-Sambola, M., Fernández, E.: The Stochastic Generalised Assignment Problem with Bernoulli Demands. TOP 8, 165–190 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  2. Chang, P.C., Hieh, J.C., Liao, T.M.: Evolving Fuzzy Rules for due-date Assignment Problem in Semiconductor Manufacturing Factory. J. Intell. Manuf. 16, 549–557 (2005)

    Article  Google Scholar 

  3. Chu, P.C., Beasley, J.E.: A Genetic Algorithm for the Generalized Assignment Problem. Comput. Oper. Res. 24, 17–23 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  4. Diaz, J.A., Fernandez, E.: A Tabu Search Heuristic for the Generalized Assignment Problem. Eur. J. Oper. Res. 132, 22–38 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Haddadi, S.: Lagrangian Decomposition based Heuristic for the Generalised Assignment Problem. INFOR 37, 392–402 (1999)

    Google Scholar 

  6. Kennedy, J., Eberhat, R.C.: Particle Swarm Optimization. In: Proc. of the IEEE International Conference on Neural Networks, New York, pp. 1942–1948 (1995)

    Google Scholar 

  7. Kennedy, J., Eberhart, R.C., Shi, Y.: Swarm Intelligence. Morgan Kaufmann Publishers, San francisco (2001)

    Google Scholar 

  8. Lin, C.J., Wen, U.P.: A Labeling Algorithm for the Fuzzy Assignment Problem. Fuzzy Sets Syst. 142, 373–391 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  9. Liu, B., Liu, Y.K.: Expected Value of Fuzzy Variable and Fuzzy Expected Value Models. IEEE Trans. Fuzzy Syst. 10, 445–450 (2002)

    Article  Google Scholar 

  10. Liu, Y.K.: Convergent Results about the Use of Fuzzy Simulation in Fuzzy Optimization Problems. IEEE Trans. Fuzzy Syst. 14, 295–304 (2006)

    Article  Google Scholar 

  11. Liu, Y.K., Zhu, X.: Capacitated Fuzzy Two-Stage Location-Allocation Problem. Int. J. Innov. Comput. Inf. Control 3, 987–999 (2007)

    Google Scholar 

  12. Ross, G.T., Soland, R.M.: A Branch-and-Bound Algorithm for the Generalized Assignment Problem. Math. Program. 8, 91–103 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  13. Toktas, B., Yen, J.W., Zabinsky, Z.B.: Addressing Capacity Uncertainty in Resource-Constrained Assignment Problem. Comput. Oper. Res. 33, 724–745 (2006)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bai, X. (2011). Minimum Risk Generalized Assignment Problem and Its Particle Swarm Optimization Algorithm. In: Qi, L. (eds) Information and Automation. ISIA 2010. Communications in Computer and Information Science, vol 86. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19853-3_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19853-3_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19852-6

  • Online ISBN: 978-3-642-19853-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics