Volume 25 , Issue 1 , PP: 81-92, 2025 | Cite this article as | XML | Html | PDF | Full Length Article
Shubham Kumar Tripathi 1 , Kottakkaran Sooppy Nisar 2 , Said Broumi 3 , Ranjan Kumar 4
Doi: https://doi.org/10.54216/IJNS.250107
In the domain of optimization, linear programming (LP) is recognized as an exceptionally effective method for ensuring the most favorable outcomes. Within the context of LP, the minimum cost flow (MCF) problem is fundamental, with its primary objective being to reduce the transportation costs for a single item moving through a network, under the constraints related to capacity. This network is made up of supply nodes, directed arcs, and demand nodes and each arc has an associated cost and capacity constraint, these factors are certain. However, in practical scenarios, these factors are susceptible to variation due to causal uncertainty. The neutrosophic set theory has surfaced as a challenging approach to tackle the uncertainty that is often encountered in optimization processes. In this manuscript, our primary objective is to address the minimal cost flow (MCF) problem while accounting for the uncertainty inherent in the neutrosophic set. We specifically focus on the cost aspect as SVTN numbers and introduce a new approach based on a customized ranking function handmade for the MCF problem a pioneering endeavor within the field of neutrosophic sets. Additionally, we present numerical example to validate the effectiveness and robustness of our model.
LPP , Minimal cost flow , Uncertainty , Neutrosophic set , SVTN numbers , Triangular neutrosophic MCF problem
[1] Dieter Klein and Edward Hannan. An algorithm for the multiple objective integer linear programming problem. European Journal of Operational Research, 9(4):378–385, 1982.
[2] Guillaume Cavory, Remy Dupas, and Gilles Goncalves. A genetic approach to solving the problem of cyclic job shop scheduling with linear constraints. European Journal of Operational Research, 161(1):73–85, 2005.
[3] Marshall L Fisher, WD Northup, and JF Shapiro. Using duality to solve discrete optimization problems: Theory and computational experience. In Nondifferentiable optimization, pages 56–94. Springer, 2009.
[4] Hongbo Ren and Weijun Gao. A milp model for integrated plan and evaluation of distributed energy systems. Applied Energy, 87(3):1001–1014, 2010.
[5] Young-Jou Lai and Ching-Lai Hwang. A new approach to some possibilistic linear programming problems. Fuzzy Sets and Systems, 49(2):121–133, 1992.
[6] Alireza Nazemi and Farahnaz Omidi. A capable neural network model for solving the maximum flow problem. Journal of Computational and Applied Mathematics, 236(14):3498–3513, 2012.
[7] YL Chen. The minimal average cost flow problem. European Journal of Operational Research, 81(3):561–570, 1995.
[8] Michel Minoux. Solving integer minimum cost flows with separable convex cost objective polynomially. Netflow at Pisa, pages 237–239, 1986.
[9] Andrew V Goldberg. An efficient implementation of a scaling minimum-cost flow algorithm. Journal of Algorithms, 22(1):1–29, 1997.
[10] Donald Goldfarb and Zhiying Jin. A new scaling algorithm for the minimum cost network flow problem. Operations Research Letters, 25(5):205–211, 1999.
[11] Balaji Gopalakrishnan, Seunghyun Kong, Earl Barnes, Ellis L Johnson, and Joel S Sokol. A least-squares minimum-cost network flow algorithm. Annals of Operations Research, 186:119–140, 2011.
[12] Jan Van Den Brand, Yin Tat Lee, Yang P Liu, Thatchaphol Saranurak, Aaron Sidford, Zhao Song, and Di Wang. Minimum cost flows, mdps, and l1-regression in nearly linear time for dense instances. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 859–869, 2021.
[13] Lofti A Zadeh. Information and control. Fuzzy sets, 8(3):338–353, 1965.
[14] M Bagherian. A fuzzy residual network approach to minimum cost flow problem with fuzzy parameters. ARPN Journal of Science and Technology, 2(10):968–975, 2012.
[15] S Muruganandam and R Srinivasan. A new algorithm for solving fuzzy transportation problems with trapezoidal fuzzy numbers. International Journal of Recent Trends in Engineering and Research, 2(3):428–437, 2016.
[16] Alexander Vitalievich Bozhenyuk, Evgeniya Michailovna Gerasimenko, Janusz Kacprzyk, Igor Naymovich Rozenberg, Alexander Vitalievich Bozhenyuk, Evgeniya Michailovna Gerasimenko, Janusz Kacprzyk, and Igor Naymovich Rozenberg. Maximum and minimum cost flow finding in networks in fuzzy conditions. Flows in Networks Under Fuzzy Conditions, pages 23–75, 2017.
[17] Muhammad Akram, Amna Habib, and Tofigh Allahviranloo. A new maximal flow algorithm for solving optimization problems with linguistic capacities and flows. Information Sciences, 612:201–230, 2022.
[18] Grigorios D Konstantakopoulos, Sotiris P Gayialis, and Evripidis P Kechagias. Vehicle routing problem and related algorithms for logistics distribution: A literature review and classification. Operational research, 22(3):2033–2062, 2022.
[19] Florentin Smarandache. A unifying field in logics. neutrosophy: Neutrosophic probability, set and logic, 1999.
[20] Sapan Kumar Das and SA Edalatpanah. A new ranking function of triangular neutrosophic number and its application in integer programming. International Journal of Neutrosophic Science, 4(2):82–92, 2020.
[21] Sapan Kumar Das. Application of transportation problem under pentagonal neutrosophic environment, volume 1. Infinite Study, 2020.
[22] Avishek Chakraborty, Sankar Prasad Mondal, Animesh Mahata, and Shariful Alam. Different linear and non-linear form of trapezoidal neutrosophic numbers, de-neutrosophication techniques and its application in time-cost optimization technique, sequencing problem. RAIRO-Operations Research, 55:97–118, 2021.
[23] Sanjoy Biswas and Samir Dey. A new approach to solve multi objective linear programming problem under neutrosophic environment. International Journal of Applied and Computational Mathematics, 9(6):135, 2023.
[24] S Sinika and G Ramesh. To enhance new interval arithmetic operations in solving linear programming problem using interval-valued trapezoidal neutrosophic numbers. Mathematics and Statistics, 11(4):710– 725, 2023.
[25] Sapan Kumar Das and Avishek Chakraborty. A new approach to evaluate linear programming problem in pentagonal neutrosophic environment. Complex and Intelligent Systems, 7:101–110, 2021.
[26] Manas Karak, Pramodh Bharati, and Animesh Mahata. Ranking of neutrosophic number based on values and ambiguities and its application to linear programming problem. Neutrosophic Sets and Systems, 63(1):13, 2024.
[27] Nidhi Singh, Avishek Chakraborty, Soma Bose Biswas, and Malini Majumdar. Impact of social media in banking sector under triangular neutrosophic arena using mcgdm technique. Neutrosophic Sets and Systems, 35:153–176, 2020.
[28] Haibin Wang, Florentin Smarandache, Yanqing Zhang, and Rajshekhar Sunderraman. Single valued neutrosophic sets. Infinite study, 12:20110, 2010.
[29] Avishek Chakraborty, Sankar Prasad Mondal, Ali Ahmadian, Norazak Senu, Shariful Alam, and Soheil Salahshour. Different forms of triangular neutrosophic numbers, de-neutrosophication techniques, and their applications. Symmetry, 10(8):1–27, 2018.
[30] Mohamed Abdel-Basset, M Gunasekaran, Mai Mohamed, and Florentin Smarandache. A novel method for solving the fully neutrosophic linear programming problems. Neural Computing and Applications, 31:1595–1605, 2019.
[31] Mehdi Ghatee, S Mehdi Hashemi, Masoud Zarepisheh, and Esmaile Khorram. Preemptive priority-based algorithms for fuzzy minimal cost flow problem: An application in hazardous materials transportation. Computers and Industrial Engineering, 57(1):341–354, 2009.
