An optimal solution of energy scheduling problem based on chance-constraint programming model using Interval-valued neutrosophic constraints

Neutrosophic sets have been commenced as a generalization of crisp, fuzzy and intuitionistic fuzzy sets to depict vague, incompatible and deficient information about a real world dilemma. Interval-valued fuzzy sets have widely been acknowledged as more proficient in modeling suspicions and practical...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Optimization and engineering Ročník 22; číslo 4; s. 2233 - 2261
Hlavní autoři: Touqeer, Muhammad, Umer, Rimsha, Ahmadian, Ali, Salahshour, Soheil, Ferrara, Massimiliano
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer US 01.12.2021
Springer Nature B.V
Témata:
Constraint modelling
Control
Engineering
Environmental Management
Financial Engineering
Fuzzy sets
Graph theory
Linear programming
Mathematics
Mathematics and Statistics
Operations Research/Decision Theory
Optimization
Research Article
Scheduling
Systems Theory
Chance-constraint programming (CCP)
06Dxx
Falsity membership function (FMF)
Indeterminacy membership function (IMF)
06D72
Interval-valued trapezoidal neutrosophic numbers (IVTrNNs)
Interval-valued neutrosophic numbers (IVNNs)
Linear programming problem (LPP)
Truth membership function (TMF)
ISSN:1389-4420, 1573-2924
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Neutrosophic sets have been commenced as a generalization of crisp, fuzzy and intuitionistic fuzzy sets to depict vague, incompatible and deficient information about a real world dilemma. Interval-valued fuzzy sets have widely been acknowledged as more proficient in modeling suspicions and practical in assigning an interval of values where allotting an accurate and precise number to an expert’s outlook is too restrictive. They endow with a more appropriate background to characterize higher order of uncertainties and fuzziness of real world. To solve linear programming network problems with constraints concerning interval-valued neutrosophic numbers, a technique has been established by using score function and upper and lower membership functions of interval-valued neutrosophic numbers. An application of energy scheduling problem with constraints represented as interval-valued trapezoidal neutrosophic numbers has been discussed and solved via this technique. Also an additional example to exemplify the proposed method by implementing it on minimum spanning tree and shortest path problem is employed. Furthermore, a comparative examination was performed to validate the effectiveness and usefulness of the projected methodology.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1389-4420
1573-2924
DOI:10.1007/s11081-021-09622-2