Search

We introduce the concept of logarithmic square root neutrosophic normal interval-valued set (LO-SRNSNIVS) based on multiple attribute decision-making (MADM) problems that can be solved in our communication. The logarithmic square root neutrosophic sets (LO-SRNSSs) are new approach of the interval-valued neutrosophic sets (IVNSSs) and neutrosophic sets (NSSs). We will examine a number of aggregating operators (AOs). The LO-SRNSNIV using weighted (LO-SRNSNIVW) operators of this article. Now, we presented logarithmic square root NSNIVW averaging (LO-SRNSNIVWA), logarithmic square root NSNIVW geomentric (LO-SRNSNIVWG), logarithmic square root generalized NSNIVW averaging (LO-SRGNSNIVWA) and logarithmic square root generalized NSNIVW geometric (LO-SRGNSNIVWG). We also develop an algorithm to solve MADM problems. A real-world scenario is given with examples, as well as explanations of how Euclidean distance (ED) and Hamming distance (HD) are applied. We will explain the properties of these sets using various algebraic structures. The notion for the scoring function, accuracy function and operational laws of the LO-SRNSNIVS. In addition to their simplicity and practicality, they can help determine which option is best to pursue. Thus, the results of the described models are more understandable and closely related to integer $ \Psi $. A few proposed and existing models are also compared in order to demonstrate their validity and applicability. [ABSTRACT FROM AUTHOR]

Symbolic simplification of analog circuits is a computationally challenging problem due to the exponential growth of the number of symbolic terms with the circuit size. In recent years, researchers have proposed various methods to address this problem, but these methods often require matrix- or graph-based symbolic analysis methods, which can be computationally expensive and memory-intensive, especially for real-size analog circuits. To overcome these limitations, we introduce a new methodology called Direct Simplified Symbolic analysis (DSSA). The proposed DSSA method views simplified symbolic circuit analysis as a modeling problem and directly produces the most significant terms of the transfer function, without the need for traditional circuit analysis. One of the main advantages of DSSA is that it significantly reduces computational complexity and required memory compared to the existing techniques. This is achieved by generating a dataset using the Monte-Carlo simulation method and performing a genetic algorithm to solve the established modeling problem. The objective is to minimize the average numerical error between the simplified symbolic expression and the exact numeric expression for all data points. The proposed method has been tested on five circuits in MATLAB, and the results clearly demonstrate its performance against existing methods. The findings by the DSSA algorithm across five circuits reveal 0.64 dB and 1.36 dB variations for the average and maximum dc-gain, respectively. Moreover, the DSSA algorithm exhibits an average pole/zero error of 6.8% and a maximum pole/zero displacement of 16.8%. It has the potential to improve the efficiency and accuracy of symbolic analysis, making it a promising tool for circuit designers and engineers. [ABSTRACT FROM AUTHOR]

The modeling of electricity generation plays a crucial role in investment and long-term planning in power systems, primarily due to the significant volatility associated with wind and solar energy sources. Nevertheless, forecasting wind speeds for wind turbines based on weather conditions over an extended period is difficult and not feasible. This study provides long-term projections for wind power generation derived from a 2 MW wind turbine for the upcoming year and subsequent years utilizing the Multivariate Adaptive Regression Splines (MARS), Artificial Neural Networks (ANN), Classification And Regression Tree (CART), Linear Regression (LR) and Random Forest (RF) techniques. The research is carried out in two distinct phases. During Phase 1 all considered predictive methods are compared. The research demonstrates that the MARS algorithm is a robust and efficient predictor for wind-based power generation, exhibiting strong competitiveness in its performance. During Phase 2, the MARS algorithm is employed to forecast the future 30-year wind power generation capacity lifespan hourly for nine cities in Texas, USA. It is projected that El Paso and Dallas will witness a mean rise of 8.6% in wind power capacity over three decades, while the remaining seven cities are anticipated to have an average decline of 7.7%. Hence, it is imperative to do a comprehensive and extended evaluation employing the MARS technique compared to ANN, CART, LR and RF before installing a wind turbine. This analysis would serve as a crucial resource for investors, engineers, and researchers involved in decision-making processes on wind turbine projects. [ABSTRACT FROM AUTHOR]

This study explores a Robust, Risk-aware, Resilient, and Sustainable Closed-Loop Supply Chain Network Design (3RSCLSCND) to tackle demand fluctuation like COVID-19 pandemic. A two-stage robust stochastic multiobjective programming model serves to express the proposed problems in formulae. The objective functions include minimising costs, CO2 emissions, energy consumption, and maximising employment by applying Conditional Value at Risk (CVaR) to achieve reliability through risk reduction. The Entropic Value at Risk (EVaR) and Minimax method are used to compare with the proposed model. We utilise the Lp-Metric method to solve the multiobjective problem. Since this model is complex, the Lagrange relaxation and Fix-and-Optimise algorithm are applied to find lower and upper bounds in large-scale, respectively. The results confirm the superior power of the model offered in estimating costs, energy consumption, environmental pollution, and employment level. This model and algorithms are applicable for other CLSC problems. [ABSTRACT FROM AUTHOR]

The social arrangement of organizations determines the potential possibilities of all group of agents in several economic and Operations Research (OR) situations. In this paper, a class of cooperative games in which agents with potential individual possibilities are connected via a hierarchy within an organization is studied. The leader, the agent, and any intermediate agents in the specified hierarchy constitute an important group refering to a peer group and form peer group situations. We consider uncertanty in payoffs in peer group situations. In the sequel peer group settings with fuzzy uncertainty are proposed. Further the associated games are modeled and some game-theoretical solution concepts are provided Futhermore, an application related with an auction situation is given. Finally, we conclude with some remarks and future work. [ABSTRACT FROM AUTHOR]