IDEAS home Printed from https://ideas.repec.org/a/spr/opsear/v57y2020i4d10.1007_s12597-020-00458-5.html
   My bibliography  Save this article

Fuzzy fractional stochastic transportation problem involving exponential distribution

Author

Listed:
  • Prachi Agrawal

    (National Institute of Technology Hamirpur)

  • Talari Ganesh

    (National Institute of Technology Hamirpur)

Abstract

This paper deals with the solution of the fuzzy fractional transportation problem in which the parameters of the transportation problem, supply, and demand, are stochastic in nature and considered as a fuzzy random variable that follows the exponential distribution with fuzzy mean and fuzzy variance. In a fuzzy fractional objective function, the costs are taken as a triangular fuzzy number. As the parameters are imprecise in nature, the obtained objective value should be a fuzzy number. To obtain the fuzzy objective value, one has to find out its lower and upper bounds, which represent the level of uncertainty. The mathematical form of bounds is expressed by applying dual formulation and variable substitution. Also, for converting the fuzzy constraints into deterministic, the chance-constrained and fuzzy programming was applied. The values of the bounds, which are calculated at different values of $$\lambda$$ λ , the membership function of the objective value is approximated. A numerical example illustrates the considered methodology.

Suggested Citation

  • Prachi Agrawal & Talari Ganesh, 2020. "Fuzzy fractional stochastic transportation problem involving exponential distribution," OPSEARCH, Springer;Operational Research Society of India, vol. 57(4), pages 1093-1114, December.
    • Handle: RePEc:spr:opsear:v:57:y:2020:i:4:d:10.1007_s12597-020-00458-5
    DOI: 10.1007/s12597-020-00458-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12597-020-00458-5
    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-020-00458-5?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. Deepika Rani & T. R. Gulati, 2016. "Application of intuitionistic fuzzy optimization technique in transportation models," OPSEARCH, Springer;Operational Research Society of India, vol. 53(4), pages 761-777, December.
    2. Subhakanta Dash & S. P. Mohanty, 2018. "Uncertain transportation model with rough unit cost, demand and supply," OPSEARCH, Springer;Operational Research Society of India, vol. 55(1), pages 1-13, March.
    3. Firoz Ahmad & Ahmad Yusuf Adhami, 2019. "Total cost measures with probabilistic cost function under varying supply and demand in transportation problem," OPSEARCH, Springer;Operational Research Society of India, vol. 56(2), pages 583-602, June.
    4. Liu, Shiang-Tai & Kao, Chiang, 2004. "Solving fuzzy transportation problems based on extension principle," European Journal of Operational Research, Elsevier, vol. 153(3), pages 661-674, March.
    5. Bheeman Radhakrishnan & Paraman Anukokila, 2014. "A compensatory approach to fuzzy fractional transportation problem," International Journal of Mathematics in Operational Research, Inderscience Enterprises Ltd, vol. 6(2), pages 176-192.
    6. Bela Martos & Andrew & Veronika Whinston, 1964. "Hyperbolic programming," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 11(2), pages 135-155, June.
    7. P. C. Gilmore & R. E. Gomory, 1961. "A Linear Programming Approach to the Cutting-Stock Problem," Operations Research, INFORMS, vol. 9(6), pages 849-859, December.
    Full references (including those not matched with items on IDEAS)

    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. Md. Ashraful Babu & M. A. Hoque & Md. Sharif Uddin, 2020. "A heuristic for obtaining better initial feasible solution to the transportation problem," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 221-245, March.
    2. Amanda O. C. Ayres & Betania S. C. Campello & Washington A. Oliveira & Carla T. L. S. Ghidini, 2021. "A Bi-Integrated Model for coupling lot-sizing and cutting-stock problems," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(4), pages 1047-1076, December.
    3. Erjavec, J. & Gradisar, M. & Trkman, P., 2012. "Assessment of stock size to minimize cutting stock production costs," International Journal of Production Economics, Elsevier, vol. 135(1), pages 170-176.
    4. Sankaran, Jayaram K., 1995. "Column generation applied to linear programs in course registration," European Journal of Operational Research, Elsevier, vol. 87(2), pages 328-342, December.
    5. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.
    6. S. Dutta & S. Acharya & Rajashree Mishra, 2016. "Genetic algorithm based fuzzy stochastic transportation programming problem with continuous random variables," OPSEARCH, Springer;Operational Research Society of India, vol. 53(4), pages 835-872, December.
    7. Milind Dawande & Jayant Kalagnanam & Ho Soo Lee & Chandra Reddy & Stuart Siegel & Mark Trumbo, 2004. "The Slab-Design Problem in the Steel Industry," Interfaces, INFORMS, vol. 34(3), pages 215-225, June.
    8. Park, Jongyoon & Han, Jinil & Lee, Kyungsik, 2024. "Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem," European Journal of Operational Research, Elsevier, vol. 317(1), pages 43-59.
    9. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    10. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    11. Letchford, Adam N. & Amaral, Andre, 2001. "Analysis of upper bounds for the Pallet Loading Problem," European Journal of Operational Research, Elsevier, vol. 132(3), pages 582-593, August.
    12. Bogdana Stanojević & Milan Stanojević & Sorin Nădăban, 2021. "Reinstatement of the Extension Principle in Approaching Mathematical Programming with Fuzzy Numbers," Mathematics, MDPI, vol. 9(11), pages 1-16, June.
    13. Lee, L. H. & Chew, E. P. & Ng, T. S., 2005. "Production planning with approved vendor matrices for a hard-disk drive manufacturer," European Journal of Operational Research, Elsevier, vol. 162(2), pages 310-324, April.
    14. Dobos, Imre & Vörösmarty, Gyöngyi, 2019. "Inventory-related costs in green supplier selection problems with Data Envelopment Analysis (DEA)," International Journal of Production Economics, Elsevier, vol. 209(C), pages 374-380.
    15. Ibrahim Muter & Tevfik Aytekin, 2017. "Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 405-421, August.
    16. Rostami, Borzou & Malucelli, Federico & Belotti, Pietro & Gualandi, Stefano, 2016. "Lower bounding procedure for the asymmetric quadratic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 584-592.
    17. Melega, Gislaine Mara & de Araujo, Silvio Alexandre & Jans, Raf, 2018. "Classification and literature review of integrated lot-sizing and cutting stock problems," European Journal of Operational Research, Elsevier, vol. 271(1), pages 1-19.
    18. Alfieri, Arianna & van de Velde, Steef & Woeginger, Gerhard J., 2007. "Roll cutting in the curtain industry, or: A well-solvable allocation problem," European Journal of Operational Research, Elsevier, vol. 183(3), pages 1397-1404, December.
    19. W. D. D. Madhavee & N. Saldin & U. C. Vaidyarathna & C. J. Jayawardene, 2018. "A Practical Application of the Generalized Cutting Stock Algorithm," Academic Journal of Applied Mathematical Sciences, Academic Research Publishing Group, vol. 4(3), pages 15-21, 03-2018.
    20. Mhand Hifi & Rym M'Hallah, 2005. "An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems," Operations Research, INFORMS, vol. 53(1), pages 140-150, February.

    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:57:y:2020:i:4:d:10.1007_s12597-020-00458-5. 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.