Mani Parimala¹, Karthikeyan Prakash¹, Ashraf Al-Quran^2,*, Muhammad Riaz³, Saeid Jafari⁴

CMES-Computer Modeling in Engineering & Sciences, Vol.139, No.1, pp. 1095-1118, 2024, DOI:10.32604/cmes.2023.031193

Abstract The idea of linear Diophantine fuzzy set (LDFS) theory with its control parameters is a strong model for machine learning and optimization under uncertainty. The activity times in the critical path method (CPM) representation procedures approach are initially static, but in the Project Evaluation and Review Technique (PERT) approach, they are probabilistic. This study proposes a novel way of project review and assessment methodology for a project network in a linear Diophantine fuzzy (LDF) environment. The LDF expected task time, LDF variance, LDF critical path, and LDF total expected time for determining the project network are all computed using LDF… More > Graphic Abstract

Shaista Habib¹, Aqsa Majeed¹, Muhammad Akram^2,*, Mohammed M. Ali Al-Shamiri^3,4

CMES-Computer Modeling in Engineering & Sciences, Vol.136, No.3, pp. 2873-2894, 2023, DOI:10.32604/cmes.2023.026294

Abstract The Floyd-Warshall algorithm is frequently used to determine the shortest path between any pair of nodes. It works well for crisp weights, but the problem arises when weights are vague and uncertain. Let us take an example of computer networks, where the chosen path might no longer be appropriate due to rapid changes in network conditions. The optimal path from among all possible courses is chosen in computer networks based on a variety of parameters. In this paper, we design a new variant of the Floyd-Warshall algorithm that identifies an All-Pair Shortest Path (APSP) in an uncertain situation of a… More > Graphic Abstract

Jamil Ahmed¹, Majed G. Alharbi², Muhammad Akram^3,*, Shahida Bashir¹

CMES-Computer Modeling in Engineering & Sciences, Vol.129, No.2, pp. 881-906, 2021, DOI:10.32604/cmes.2021.017222

Abstract A bipolar single-valued neutrosophic set can deal with the hesitation relevant to the information of any decision making problem in real life scenarios, where bipolar fuzzy sets may fail to handle those hesitation problems. In this study, we first develop a new method for solving linear programming problems based on bipolar singlevalued neutrosophic sets. Further, we apply the score function to transform bipolar single-valued neutrosophic problems into crisp linear programming problems. Moreover, we apply the proposed technique to solve fully bipolar single-valued neutrosophic linear programming problems with non-negative triangular bipolar single-valued neutrosophic numbers (TBS_vNNs) and non-negative trapezoidal bipolar single-valued neutrosophic… More >