Skip to main content
SpringerLink
Log in

A Dynamic Programming Algorithm for Solving Bi-Objective Fuzzy Knapsack Problem

  • Conference paper
  • First Online:
Mathematics and Computing

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 139))

Abstract

This paper considers bi-objective knapsack problem with fuzzy weights, says bi-objective fuzzy knapsack problem (BOFKP). Here we introduce an index which gives the possibility of choosing the item (weights and knapsack availability are fuzzy in nature) for knapsack with crisp capacity such that both the objective value are optimized. A methodology using dynamic programming technique has been introduced in this paper with an algorithm which gives the optimal solution for single objective fuzzy knapsack problem (FKP) with some possibility. Using this methodology an algorithm is given to find the Pareto frontier in case of bi-objective fuzzy knapsack problem. Compromise ratio method for decision-making under fuzzy environment has been used to find the compromise solution. The possibility index gives an idea to choose the solution according to decision-maker’s choice. An illustrative example is given to demonstrate the methodology.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bellman, R.: Dynamic programming and lagrange multipliers. Proc. Nat. Acad. Sci. U.S.A. 42(10), 767 (1956)

    Article  MATH  MathSciNet  Google Scholar 

  2. Bellman, R.E., Zadeh, L.A.: Decision-making in a fuzzy environment. Manag. Sci. 17(4), B-141 (1970)

    Google Scholar 

  3. Dubois, D., Prade, H.: Possibility Theory. Springer (1988)

    Google Scholar 

  4. Guha, D., Chakraborty, D.: Compromise ratio method for decision making under fuzzy environment using fuzzy distance measure, a a. 1, 2 (2008)

    Google Scholar 

  5. Horowitz, E., Sahni, S., Rajasekaran, S.: Computer algorithms C++: C++ and pseudocode versions. Macmillan (1997)

    Google Scholar 

  6. Kasperski, A., Kulej, M.: The 0–1 knapsack problem with fuzzy data. Fuzzy Optim. Decis. Making 6(2), 163–172 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  7. Lin, F.-T., Yao, J.-S.: Using fuzzy numbers in knapsack problems. Eur. J. Oper. Res. 135(1), 158–176 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  8. Martello, S., Toth, P.: Knapsack Problems. Wiley, New York (1990)

    Google Scholar 

  9. North, D.W.: A tutorial introduction to decision theory. IEEE Trans. Syst. Sci. Cybern. 4(3), 200–210 (1968)

    Article  Google Scholar 

  10. Okada, S., Gen, M.: Fuzzy multiple choice knapsack problem. Fuzzy Sets Syst. 67(1), 71–80 (1994)

    Article  MathSciNet  Google Scholar 

  11. Sengupta, A., Pal, T.K.: On comparing interval numbers. Eur. J. Oper. Res. 127(1), 28–43 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  12. Toth, P.: Dynamic programming algorithms for the zero-one knapsack problem. Computing 25(1), 29–45 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  13. Yoshida, Y.: Dynamical aspects in Fuzzy decision making, Vol. 73, Springer (2001)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

Download references

Acknowledgments

Authors are grateful to the anonymous reviewers for their constructive comments and valuable suggestions.

Author information

Authors and Affiliations

  1. Department of Mathematics, Indian Institute of Technology Kharagpur, Kharagpur, 721302, India

    V. P. Singh & D. Chakraborty

Authors
  1. V. P. Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. D. Chakraborty
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to V. P. Singh .

Editor information

Editors and Affiliations

  1. Department of Mathematics, University of Central Florida, Orlando, Florida, USA

    Ram N. Mohapatra

  2. Indian Institute of Technology Kharagpur Dept. Computer Science & Engineering, Kharagpur, West Bengal, India

    Dipanwita Roy Chowdhury

  3. Dept of Computer Science & Engineering, Haldia Institute of Technology, Haldia, West Bengal, India

    Debasis Giri

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer India

About this paper

Cite this paper

Singh, V.P., Chakraborty, D. (2015). A Dynamic Programming Algorithm for Solving Bi-Objective Fuzzy Knapsack Problem. In: Mohapatra, R., Chowdhury, D., Giri, D. (eds) Mathematics and Computing. Springer Proceedings in Mathematics & Statistics, vol 139. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2452-5_20

Download citation

Publish with us

Policies and ethics

Search

Navigation