Open Access
Research Article
Solving neutrosophic minimal cost flow problem using multi-objective linear programming problem
Shubham Kumar TripathiVIT-AP University Inavolu Beside AP SecretariatAmaravati, Andhra Pradesh, 522237, IndiaView full profile → , *Ranjan KumarCorresponding authorranjank.nit52@gmail.comVIT-AP University Inavolu Beside AP SecretariatAmaravati, Andhra Pradesh, 522237, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Published Online:
- 29 May 2024
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIOS-1694
- Pages:
- 1093–1104
Abstract
The Linear Programming (LP) model, renowned for its robust modeling capabilities, is a highly effective tool for solving real-world problems and optimizing tasks with specific objective. A key component of the LP model is the Minimum Cost Flow (MCF), which aims to minimize the transportation cost of a single product through a capacitated network. This article focuses on the MCF problem with neutrosophic arc cost, a scenario that often arises in real-world situations due to the complexity and uncertainty of data. The neutrosophic theory plays a crucial role in handling this vagueness. The primary objective of this paper is to find the optimal solution to the neutrosophic MCF problem using SVTN numbers.
Keywords
Subject Classifications
62A8690C05 and 90C08
References
[1] M. Özlen and M. Azizoğlu, “Multi-objective integer programming: A general approach for generating all non-dominated solutions,” European Journal of Operational Research, vol. 199, p. 25–35, 2009. [2] T. Perini, N. Boland, D. Pecin and M. Savelsbergh, “A criterion space method for biobjective mixed integer programming: The boxed line method,” INFORMS Journal on Computing, vol. 32, p. 16–39 (2020).[3] D. Behera, K. Peters and S. A. Edalatpanah, “Alternative methods for linear programming problem under triangular fuzzy uncertainty,” Journal of Statistics and Management Systems, vol. 25, p. 521–539 (2022). [4] J. S. Ahmed, H. J. Mohammed and I. Z. Chaloob, “Application of a fuzzy multi-objective defuzzification method to solve a transportation problem,” Mater. Today Proc (2021). [5] M. A. Ilyas, G. Abbas, T. Alquthami, M. Awais and M. B. Rasheed, “Multi-objective optimal power flow with integration of renewable energy sources using fuzzy membership function,” IEEE Access, vol. 8, p. 143185–143200 (2020). [6] D. Haro, J. Paredes, A. Solera and J. Andreu, “A model for solving the optimal water allocation problem in river basins with network flow programming when introducing non-linearities,” Water resources management, vol. 26, p. 4059–4071 (2012). [7] S. M. Stefanov, “Linear programming problems and matrix games,” Journal of Interdisciplinary Mathematics, vol. 27, p. 57–65 (2024). [8] S. F. Tantawy and O. M. Saad, “A new method for solving the sum of linear and linear fractional programming problems,” Journal of Information and Optimization Sciences, vol. 29, p. 849–857 (2008). [9] C. O. Pieume, L. P. Fotso and P. Siarry, “A method for solving bilevel linear programming problems,” Journal of Information and Optimization Sciences, vol. 29, p. 335–338 (2008).[10] L. A. Zadeh, Fuzzy sets, Information and Control, Vol. 8, pp. 338–353, 1965, Reproduced with permission of the copyright owner. Further reproduction … (1965). [11] H.-S. Shih and E. S. Lee, “Fuzzy multi-level minimum cost flow problems,” Fuzzy Sets and Systems, vol. 107, p. 159–176 (1999). [12] A. Sedeno-Noda, C. González-Martın and J. Gutiérrez, “The biobjective undirected two-commodity minimum cost flow problem,” European Journal Of Operational Research, vol. 164, p. 89–103 (2005). [13] A. Raith and M. Ehrgott, “A two-phase algorithm for the biobjective integer minimum cost flow problem,” Computers & Operations Research, vol. 36, p. 1945–1954 (2009). [14] S. Moradi, A. Raith and M. Ehrgott, “A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem,” European Journal of Operational Research, vol. 244, p. 369–378 (2015). [15] B. Ghasemishabankareh, M. Ozlen and X. Li, “NSGA-II for solving multiobjective integer minimum cost flow problem with probabilistic tree-based representation,” in Evolutionary Multi-Criterion Optimization: 10th International Conference, EMO 2019, East Lansing, MI, USA (2019). [16] S. Khezri and S. Khodayifar, “Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory,” Computers & Operations Research, vol. 156, p. 106260 (2023). [17] F. Smarandache, “A unifying field in Logics: Neutrosophic Logic.,” in Philosophy, American Research Press, p. 1–141 (1999).[18] Q. H. Imran, K. S. Tanak and A. H. M. Al-Obaidi, “On new concepts of neutrosophic crisp open sets,” Journal of Interdisciplinary Mathematics, vol. 25, pp. 563-572 (2022).[19] M. Parikh and M. Sahni, “Solution of logistic differential equation in an uncertain environment using neutrosophic numbers,” Journal of Interdisciplinary Mathematics, vol. 27, p. 145–169 (2024). [20] M. Abdel-Basset, M. Gunasekaran, M. Mohamed and F. Smarandache, “A novel method for solving the fully neutrosophic linear programming problems,” Neural Computing and Applications, vol. 31, p. 1595–1605 (2019). [21] A. Chakraborty, S. P. Mondal, A. Ahmadian, N. Senu, S. Alam and S. Salahshour, “Different forms of triangular neutrosophic numbers, de-neutrosophication techniques, and their applications,” Symmetry, vol. 10, p. 327 (2018).
Views: 174Downloads: 9Citations: 0
