'%3e%3cpath%20d='M29.5529%2025.4577C28.9763%2024.0918%2028.1395%2022.8511%2027.0891%2021.8047C26.0419%2020.7553%2024.8014%2019.9186%2023.4361%2019.3408C23.4239%2019.3347%2023.4116%2019.3317%2023.3994%2019.3256C25.3039%2017.95%2026.5419%2015.7092%2026.5419%2013.1812C26.5419%208.99325%2023.1487%205.6001%2018.9608%205.6001C14.7729%205.6001%2011.3797%208.99325%2011.3797%2013.1812C11.3797%2015.7092%2012.6177%2017.95%2014.5222%2019.3286C14.51%2019.3347%2014.4977%2019.3378%2014.4855%2019.3439C13.116%2019.9216%2011.8871%2020.7501%2010.8325%2021.8078C9.78311%2022.8549%208.94642%2024.0954%208.36866%2025.4607C7.80106%2026.7974%207.49494%2028.2304%207.46687%2029.6823C7.46606%2029.7149%207.47178%2029.7474%207.4837%2029.7778C7.49563%2029.8082%207.51351%2029.8358%207.5363%2029.8592C7.55909%2029.8826%207.58633%2029.9011%207.6164%2029.9138C7.64648%2029.9265%207.67879%2029.933%207.71142%2029.933H9.54556C9.68007%2029.933%209.78706%2029.826%209.79011%2029.6945C9.85125%2027.3346%2010.7989%2025.1245%2012.4741%2023.4493C14.2073%2021.716%2016.5092%2020.7623%2018.9608%2020.7623C21.4124%2020.7623%2023.7143%2021.716%2025.4475%2023.4493C27.1227%2025.1245%2028.0703%2027.3346%2028.1315%2029.6945C28.1345%2029.829%2028.2415%2029.933%2028.376%2029.933H30.2102C30.2428%2029.933%2030.2751%2029.9265%2030.3052%2029.9138C30.3353%2029.9011%2030.3625%2029.8826%2030.3853%2029.8592C30.4081%2029.8358%2030.426%2029.8082%2030.4379%2029.7778C30.4498%2029.7474%2030.4555%2029.7149%2030.4547%2029.6823C30.4242%2028.2211%2030.1215%2026.7997%2029.5529%2025.4577ZM18.9608%2018.4391C17.5577%2018.4391%2016.2371%2017.8919%2015.2436%2016.8984C14.2501%2015.9049%2013.7029%2014.5843%2013.7029%2013.1812C13.7029%2011.7781%2014.2501%2010.4575%2015.2436%209.46401C16.2371%208.47052%2017.5577%207.92334%2018.9608%207.92334C20.3639%207.92334%2021.6845%208.47052%2022.678%209.46401C23.6715%2010.4575%2024.2187%2011.7781%2024.2187%2013.1812C24.2187%2014.5843%2023.6715%2015.9049%2022.678%2016.8984C21.6845%2017.8919%2020.3639%2018.4391%2018.9608%2018.4391Z'%20fill='white'/%3e%3c/g%3e%3c/svg%3e)
Said Broumi
'%3e%3cpath%20d='M22.1642%2019.0924C21.7317%2018.068%2021.1041%2017.1375%2020.3163%2016.3527C19.5309%2015.5656%2018.6006%2014.9381%2017.5766%2014.5048C17.5674%2014.5002%2017.5582%2014.4979%2017.5491%2014.4933C18.9774%2013.4616%2019.9059%2011.7811%2019.9059%209.88504C19.9059%206.74408%2017.3611%204.19922%2014.2201%204.19922C11.0792%204.19922%208.53429%206.74408%208.53429%209.88504C8.53429%2011.7811%209.46282%2013.4616%2010.8912%2014.4956C10.882%2014.5002%2010.8728%2014.5025%2010.8636%2014.5071C9.83652%2014.9404%208.91487%2015.5617%208.1239%2016.355C7.33685%2017.1404%206.70933%2018.0707%206.276%2019.0947C5.85031%2020.0972%205.62072%2021.172%205.59967%2022.2609C5.59905%2022.2853%205.60335%2022.3097%205.61229%2022.3325C5.62123%2022.3553%205.63465%2022.376%205.65174%2022.3935C5.66883%2022.4111%205.68926%2022.425%205.71182%2022.4345C5.73437%2022.444%205.7586%2022.4489%205.78308%2022.4489H7.15868C7.25956%2022.4489%207.3398%2022.3686%207.3421%2022.2701C7.38795%2020.5001%208.09868%2018.8425%209.35506%2017.5861C10.655%2016.2862%2012.3814%2015.5709%2014.2201%2015.5709C16.0588%2015.5709%2017.7852%2016.2862%2019.0852%2017.5861C20.3415%2018.8425%2021.0523%2020.5001%2021.0981%2022.2701C21.1004%2022.3709%2021.1807%2022.4489%2021.2815%2022.4489H22.6571C22.6816%2022.4489%2022.7058%2022.444%2022.7284%2022.4345C22.751%2022.425%2022.7714%2022.4111%2022.7885%2022.3935C22.8056%2022.376%2022.819%2022.3553%2022.8279%2022.3325C22.8369%2022.3097%2022.8412%2022.2853%2022.8406%2022.2609C22.8176%2021.165%2022.5907%2020.0989%2022.1642%2019.0924ZM14.2201%2013.8284C13.1678%2013.8284%2012.1773%2013.418%2011.4322%2012.6729C10.6871%2011.9278%2010.2767%2010.9374%2010.2767%209.88504C10.2767%208.83271%2010.6871%207.84227%2011.4322%207.09715C12.1773%206.35204%2013.1678%205.94165%2014.2201%205.94165C15.2724%205.94165%2016.2629%206.35204%2017.008%207.09715C17.7531%207.84227%2018.1635%208.83271%2018.1635%209.88504C18.1635%2010.9374%2017.7531%2011.9278%2017.008%2012.6729C16.2629%2013.418%2015.2724%2013.8284%2014.2201%2013.8284Z'%20fill='%238590A2'/%3e%3c/g%3e%3c/svg%3e)
Co-authors
Following
Followers
Research Focus & Metrics
Explore full metrics on Scilit
Academic Career Length
14Years (2013-Present)
(Calculated once Scilit publication data is synced: current year − year of first publication + 1)
Representative Publications
View All Publications19 January 2015 in International Journal of Computational Mathematics
Journal Article
SBSaid Broumi
Said BroumiFSFlornetin Smarandache
Flornetin Smarandache
We first defined interval-valued neutrosophic soft rough sets (IVN-soft rough sets for short) which combine interval-valued neutrosophic soft set and rough sets and studied some of its basic properties. This concept is an extension of interval-valued intuitionistic fuzzy soft rough sets (IVIF-soft rough sets).
30 March 2019 in Complex & Intelligent Systems
Journal Article
SBSaid Broumi
Said BroumiMTMohamed Talea
Mohamed TaleaABAssia Bakali
Assia Bakali
Florentin SmarandacheNDNAGARAJAN DEIVANAYAGAMPILLAI
NAGARAJAN DEIVANAYAGAMPILLAIMPMani Parimala
Mani Parimala +1
In the last decade, concealed by uncertain atmosphere, many algorithms have been studied deeply to workout the shortest path problem. In this paper, we compared the shortest path problem with various existing algorithms. Finally, we concluded the best algorithm for certain environment.
Journal Article
GSGaneshsree Selvachandran
Ganeshsree SelvachandranSQShio Gai Quek
Shio Gai QuekFlorentin SmarandacheSBSaid Broumi
Said BroumiA single-valued neutrosophic set (SVNS) is a special case of a neutrosophic set which is characterized by a truth, indeterminacy, and falsity membership function, each of which lies in the standard interval of [0, 1]. This paper presents a modified Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) with maximizing deviation method based on the single-valued neutrosophic set (SVNS) model. An integrated weight measure approach that takes into consideration both the objective and subjective weights of the attributes is used. The maximizing deviation method is used to compute the objective weight of the attributes, and the non-linear weighted comprehensive method is used to determine the combined weights for each attributes. The use of the maximizing deviation method allows our proposed method to handle situations in which information pertaining to the weight coefficients of the attributes are completely unknown or only partially known. The proposed method is then applied to a multi-attribute decision-making (MADM) problem. Lastly, a comprehensive comparative studies is presented, in which the performance of our proposed algorithm is compared and contrasted with other recent approaches involving SVNSs in literature.
13 June 2021 in Complex & Intelligent Systems
Journal Article
MPMani Parimala
Mani ParimalaSBSaid Broumi
Said BroumiKPKarthikeyan Prakash
Karthikeyan PrakashSTSelçuk Topal
Selçuk TopalAn elongation of the novel intuitionistic fuzzy set is a picture fuzzy set theory. The demonstration of this has been used to deal with the abstinence criteria in a decision-making problem. The uncertainty in nature occurs sometimes in real-world problems and amidst them, the prominent one is the shortest path problem (SPP) solving. In the last few years, one of the best algorithms on the network for finding SPP is Bellman–Ford. Due to uncertainty in the decision-making process, it becomes difficult for decision-makers for communicating their point of view and judgment with certainty. We conceive of SPP in this contribution via Bellman's algorithm (BA) for a network with trapezoidal picture fuzzy numbers (TPFNs). We introduce a new algorithm to stand the shortest picture fuzzy path between each pair of nodes. A TPFN is considered for the length of all edges. A numerical example for the validation of the presented algorithm has also been proposed. There has also been relative research with existing techniques showing the benefits of the new algorithm.
26 February 2019 in Complex & Intelligent Systems
Journal Article
SBSaid Broumi
Said BroumiNDNAGARAJAN DEIVANAYAGAMPILLAI
NAGARAJAN DEIVANAYAGAMPILLAIABAssia Bakali
Assia Bakali
MTMohamed Talea
Mohamed Talea
FSFlorentin Smarandache
Florentin Smarandache
MLMalayalan Lathamaheswari
Malayalan Lathamaheswari
Real-life decision-making problem has been demonstrated to cover the indeterminacy through single valued neutrosophic set. It is the extension of interval valued neutrosophic set. Most of the problems of real life involve some sort of uncertainty in it among which, one of the famous problem is finding a shortest path of the network. In this paper, a new score function is proposed for interval valued neutrosophic numbers and SPP is solved using interval valued neutrosophic numbers. Additionally, novel algorithms are proposed to find the neutrosophic shortest path by considering interval valued neutrosophic number, trapezoidal and triangular interval valued neutrosophic numbers for the length of the path in a network with illustrative example. Further, comparative analysis has been done for the proposed algorithm with the existing method with the shortcoming and advantage of the proposed method and it shows the effectiveness of the proposed algorithm.
5 April 2019 in Complex & Intelligent Systems
Journal Article
SBSaid Broumi
Said BroumiADArindam Dey
Arindam DeyMTMohamed Talea
Mohamed TaleaABAssia Bakali
Assia BakaliFlorentin SmarandacheRKRanjan Kumar
Ranjan Kumar +2
An elongation of the single-valued neutrosophic set is an interval-valued neutrosophic set. It has been demonstrated to deal indeterminacy in a decision-making problem. Real-world problems have some kind of uncertainty in nature and among them; one of the influential problems is solving the shortest path problem (SPP) in interconnections. In this contribution, we consider SPP through Bellman’s algorithm for a network using interval-valued neutrosophic numbers (IVNNs). We proposed a novel algorithm to obtain the neutrosophic shortest path between each pair of nodes. Length of all the edges is accredited an IVNN. Moreover, for the validation of the proposed algorithm, a numerical example has been offered. Also, a comparative analysis has been done with the existing methods which exhibit the advantages of the new algorithm.
About Me
Dr. Broumi Said completed his MSc and PhD in Computer Science from University of Hassan II of Casablanca, Morocco. Currently, he is serving as an Assistant Professor at Regional Center for the Professions of Education and Training, Casablanca-Settat, Morocco. He is permanent member at Laboratory of Information Processing, Faculty of Science Ben M’Sik, University Hassan II, Casablanca, Morocco .His research interests are in the field of graph theory, extended fuzzy graphs, decision analysis and neutrosophic theory. He has diversity in his research work. he has published several work on neutrosophic graph theory, soft set theory, multi-attribute decision analysis and some alternative theories of Neutrosophic Mathematics. He has published more than 200 research articles in international peer-reviewed ISI Indexed /Impact factor journals. Some of his papers have been published in high impact journals including, Complex & Intelligent Systems, Computational and Applied Mathematics, Symmetry, and Journal of Neutrosophic Set and Systems. His work has largely been cited and total citation is more than 5992 (Scholar Google, H-index 41). He has presented his research work at some national as well as international conferences. He has been acting as a reviewer for a number of International journals.