IDEAS home Printed from https://ideas.repec.org/a/wly/jjmath/v2022y2022i1n8411876.html

An Uncertain Programming Model for Fixed Charge Transportation Problem with After‐Sale Service

Author

Listed:
  • Kai Zhu
  • Yue Fan
  • Jiayu Shen
  • Yuyi Li
  • Mingfeng Yin

Abstract

This paper constructs an uncertain mathematical model for the fixed charge transportation problem in which several kinds of items are transported from different sources to various destinations via different methods. In addition, after‐sale service such as product return and exchange that help to raise the customer’s satisfaction is considered during the trade to meet the reality. Meanwhile, some indeterministic factors may occur during the transportation process; probability theory is not the best option due to the lack of adequate historical data. In the light of this statement, some parameters like supplies, demands, return rate, and exchange rate are all defined as uncertain variables to formulate the uncertain programming model. After that, the equivalent deterministic models are derived with the help of uncertainty theory. Finally, some numerical experiments are implemented via three algorithms; the optimal values are displayed and compared to show the application of this problem. The study of this paper provides an applicable method for the decision maker.

Suggested Citation

  • Kai Zhu & Yue Fan & Jiayu Shen & Yuyi Li & Mingfeng Yin, 2022. "An Uncertain Programming Model for Fixed Charge Transportation Problem with After‐Sale Service," Journal of Mathematics, John Wiley & Sons, vol. 2022(1).
    • Handle: RePEc:wly:jjmath:v:2022:y:2022:i:1:n:8411876
    DOI: 10.1155/2022/8411876
    as

    Download full text from publisher

    File URL: https://doi.org/10.1155/2022/8411876
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2022/8411876?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
    ---><---

    References listed on IDEAS

    as
    1. Adlakha, Veena & Kowalski, Krzysztof, 2003. "A simple heuristic for solving small fixed-charge transportation problems," Omega, Elsevier, vol. 31(3), pages 205-211, June.
    2. Farley, Alan A. & Richardson, Kenneth V., 1984. "Fixed charge problems with identical fixed charges," European Journal of Operational Research, Elsevier, vol. 18(2), pages 245-249, November.
    3. Das, S. K. & Goswami, A. & Alam, S. S., 1999. "Multiobjective transportation problem with interval cost, source and destination parameters," European Journal of Operational Research, Elsevier, vol. 117(1), pages 100-112, August.
    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. Dalbinder Kour, 2025. "Fuzzy Goal Programming Approach to optimization of sustainable development index," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 16(7), pages 2581-2592, July.
    2. Pérez-Mesa, Juan Carlos & Galdeano-Gómez, Emilio & Salinas Andújar, Jose A., 2012. "Logistics network and externalities for short sea transport: An analysis of horticultural exports from southeast Spain," Transport Policy, Elsevier, vol. 24(C), pages 188-198.
    3. Kowalski, Krzysztof & Lev, Benjamin, 2008. "On step fixed-charge transportation problem," Omega, Elsevier, vol. 36(5), pages 913-917, October.
    4. Sujeet Kumar Singh & Shiv Prasad Yadav, 2018. "Intuitionistic fuzzy multi-objective linear programming problem with various membership functions," Annals of Operations Research, Springer, vol. 269(1), pages 693-707, October.
    5. Erika Buson & Roberto Roberti & Paolo Toth, 2014. "A Reduced-Cost Iterated Local Search Heuristic for the Fixed-Charge Transportation Problem," Operations Research, INFORMS, vol. 62(5), pages 1095-1106, October.
    6. Lev, Benjamin & Kowalski, Krzysztof, 2011. "Modeling fixed-charge problems with polynomials," Omega, Elsevier, vol. 39(6), pages 725-728, December.
    7. Mojtaba Akbari & Saber Molla-Alizadeh-Zavardehi & Sadegh Niroomand, 2020. "Meta-heuristic approaches for fixed-charge solid transportation problem in two-stage supply chain network," Operational Research, Springer, vol. 20(1), pages 447-471, March.
    8. Xie, Fanrong & Butt, Muhammad Munir & Li, Zuoan & Zhu, Linzhi, 2017. "An upper bound on the minimal total cost of the transportation problem with varying demands and supplies," Omega, Elsevier, vol. 68(C), pages 105-118.
    9. Saleem Ramadan & Imad Ramadan, 2012. "Hybrid Two-Stage Algorithm for Solving Transportation Problem," Modern Applied Science, Canadian Center of Science and Education, vol. 6(4), pages 1-12, April.
    10. S. K. Bharati & Rita Malhotra, 2017. "Two stage intuitionistic fuzzy time minimizing transportation problem based on generalized Zadeh’s extension principle," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 8(2), pages 1442-1449, November.
    11. Caroline Spieckermann & Stefan Minner & Maximilian Schiffer, 2025. "Reduce-then-Optimize for the Fixed-Charge Transportation Problem," Transportation Science, INFORMS, vol. 59(3), pages 540-564, June.
    12. S. Rivaz & M. Yaghoobi, 2013. "Minimax regret solution to multiobjective linear programming problems with interval objective functions coefficients," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 21(3), pages 625-649, September.
    13. Jawahar, N. & Balaji, A.N., 2009. "A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge," European Journal of Operational Research, Elsevier, vol. 194(2), pages 496-537, April.
    14. Roberto Roberti & Enrico Bartolini & Aristide Mingozzi, 2015. "The Fixed Charge Transportation Problem: An Exact Algorithm Based on a New Integer Programming Formulation," Management Science, INFORMS, vol. 61(6), pages 1275-1291, June.
    15. Ma, Hong & Miao, Zhaowei & Lim, Andrew & Rodrigues, Brian, 2011. "Crossdocking distribution networks with setup cost and time window constraint," Omega, Elsevier, vol. 39(1), pages 64-72, January.
    16. Juman, Z.A.M.S. & Hoque, M.A., 2014. "A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies," European Journal of Operational Research, Elsevier, vol. 239(1), pages 146-156.
    17. Hong, Jiangtao & Diabat, Ali & Panicker, Vinay V. & Rajagopalan, Sridharan, 2018. "A two-stage supply chain problem with fixed costs: An ant colony optimization approach," International Journal of Production Economics, Elsevier, vol. 204(C), pages 214-226.
    18. Adlakha, Veena & Kowalski, Krzysztof & Wang, Simi & Lev, Benjamin & Shen, Wenjing, 2014. "On approximation of the fixed charge transportation problem," Omega, Elsevier, vol. 43(C), pages 64-70.
    19. 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.
    20. Gurwinder Singh & Amarinder Singh, 2021. "Solving fixed-charge transportation problem using a modified particle swarm optimization algorithm," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 12(6), pages 1073-1086, December.

    More about this item

    Statistics

    Access and download statistics

    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:wly:jjmath:v:2022:y:2022:i:1:n:8411876. 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: Wiley Content Delivery (email available below). General contact details of provider: https://onlinelibrary.wiley.com/journal/1469 .

    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.