Search

In this study, pretreated organic wastes such as waste paper cups, cardboard waste, and vegetable waste were screened for the growth and lipid production of oleaginous bacteria DS-7 (isolated from the dairy effluent scum). The pretreated vegetable waste was found to be the best feedstock for biomass and lipid production by the DS-7. Further, process parameters such as inoculation time, substrate concentration (w/v) (amount of pretreated vegetable waste), pH, and inoculum size were optimized using a multi-objective optimization technique to enhance the biomass and lipid productions. The optimization study successfully enhanced the biomass concentration (g/L) and lipid content (%) by 47.9% and 15.84%, respectively in comparison with the unoptimized state. The biomass and lipid productivities were 42% (1.449 g/L/d) and 51% (1.267 g/L/d) greater than unoptimized conditions. The characteristics of the biodiesel obtained from the valorization of vegetable waste were comparable to the standard. Thus, the vegetable waste can be utilized as a potential feedstock for microbial biodiesel production. [ABSTRACT FROM AUTHOR]

Damage detection and localization in civil engineering constructions using dynamic analysis has become an important topic in recent years. This paper presents a methodology based on non-destructive detection, localization and quantification of multiple damages in simple and continuous beams, and a more complex structure, namely two-dimensional frame structure. The proposed methodology makes used of Firefly Algorithm and Genetic Algorithm as optimization tools and the Coordinate Modal Assurance Criterion as an objective function. The results show that the proposed combination of Coordinate Modal Assurance Criterion and Firefly Algorithm or Genetic Algorithm can be easily used to identify multiple local structural damages in complex structures. However, the convergence rate becomes slower for the case of multiple damages compared to the case of single damage. The effect of noise on the algorithm is further investigated. It is found that the proposed technique is able to detect the damage location and its severity with high accuracy in the presence of noise, although the convergence rate became slower than in the case when no noise is present. It is also found that the convergence rate of Firefly Algorithm is much faster than that of Genetic Algorithm. [ABSTRACT FROM AUTHOR]

A multi-modal search space can be defined as having multiple attraction basins - each basin has a single local optimum which is reached from all points in that basin when greedy local search is used. Optimization in multi-modal search spaces can then be viewed as a two-phase process. The first phase is exploration in which the most promising attraction basin is identified. The second phase is exploitation in which the best solution (i.e. the local optimum) within the previously identified attraction basin is attained. The goal of thresheld convergence is to improve the performance of search techniques during the first phase of exploration. The effectiveness of thresheld convergence has been demonstrated through applications to existing metaheuristics such as particle swarm optimization and differential evolution, and through the development of novel metaheuristics such as minimum population search and leaders and followers. [ABSTRACT FROM AUTHOR]

In the recent years, numerous studies have demonstrated the importance and efficiency of reservoir computing (RC) approaches. The choice of parameters and architecture in reservoir computing, on the other hand, frequently leads to an optimization task. This paper attempts to present an overview of the related work on echo state network (ESN) and deep echo state network (DeepESN) optimization and to collect research papers through a systematic literature review (SLR). This review covers 129 items published from 2004 to 2022 that are concerned with the issue of our focus. The collected papers are selected, analysed and discussed. The results indicate that there are two techniques of parameters optimization (bio-inspired and non-bio-inspired methods) have been extensively used for various reasons. But Different models employ bio-inspired methods for optimizing in a variety of fields. The potential use of particle swarm optimization (PSO) has also been noted. A significant portion of the research done in this field focuses on the study of reservoirs and how they behave in relation to their unique qualities. In order to test reservoirs with varied parameters, topologies, or training techniques, NARMA, the Mackey glass, and Lorenz time-series prediction dataset are the most commonly employed in the literature. This review debate diverse point of view about ESN's hyper-parameter optimization, metrics, time series benchmarks, real word applications, evaluation measures, and bio-inspired and non-bio-inspired techniques, this paper identifies and explores a number of research gaps. [ABSTRACT FROM AUTHOR]

The present study originated with the concomitant production of 1.94 IU.mL-1 of pectinase, 0.34 IU.mL-1 xylanase and 0.086 IU.mL-1 cellulase from a newly isolated Bacillus firmus SDB9 in pectin salt media. Plackett-Burman Design (PBD) and Box-Behnken design (BBD) were used for optimization of mass production of pectinase using agro-residues. Statistical optimization of medium enhances the pectinase production to 17.55 IU.mL-1, 17.7% higher activity than that of unoptimized medium. The optimal pectinase activity was found at pH 8.5 and 45?C temperature. The enzyme was alkali-stable over a range of pH 7.0 to 10.0 for 1 h and thermostable at 35 to 70?C for 1h. Out of 12 tested metal cations at 1mM concentration, the enzyme was found to be hindered by the presence of three cations, whereas four cations were reported to augment, and the rest marginally subdued the activity. Pretreatment with 15 IU pectinase and 2.7 IU xylanase per gram of OD pulp reduce kappa number by 7.9%. After bleaching sequence D0-Ep-D1, the increment in pulp brightness was 2.7% with acceptable whiteness level. Pretreatment also led to a reduction in ClO2 consumption by 15% with superior brightness level. The 0.83% increase in pulp viscosity along with 3.2% gain in double fold number indicated the maintenance of relative cellulose content and strength of paper. Minor variations in burst index, tensile index and tear index reflected the conserved properties of the treated pulp. Synergistic application of mixed enzymes preparation produced from raw agro-residue headed by pectinase in preference to xylanase is first time set forth in the present study to help in cost economization and propel the pulp and paper industries towards environmental friendly future. [ABSTRACT FROM AUTHOR]

A Hybrid Photovoltaic Thermal (PVT) system is one of the most emerging and energy-efficient technologies in the area of solar energy engineering. This review paper provides a comprehensive review of hybrid PVT systems in the context of the history of PVT, general classification, and parameter analysis. Several cell technologies with spectrum analysis are discussed to understand the application's ability and energy efficiency. Hybrid PVT concept, characteristics, and structure analysis is also discussed in this study. An extensive analysis on the classifications of hybrid PVT systems from the recent literature is also presented here. These literatures are identified based on several criteria. In order to provide a complete and energy-efficient technology, an innovative classification of the hybrid PVT system is proposed in this paper. This proposed classification is a combination and upgrade of various existing classifications mentioned in recent research studies. Parameters have a significant and unavoidable impact on the performance and efficiency of the hybrid PVT system. A brief analysis of different parameters and the optimization of the system is conducted after reviewing recent research articles. This analysis provides insights into the impact of parameter variations on the system. A novel parameter model comprising parametric and optimistic analyses is also presented in this paper. It provides a detailed parametric description that significantly affects the performance and efficiency of the hybrid PVT system. Finally, the assessment focuses on a critical analysis of the main challenges in adopting PVT technology and suggests ways to overcome these barriers. [ABSTRACT FROM AUTHOR]

Reinforcement learning (RL) techniques have emerged as powerful tools for optimizing energy systems, offering the potential to enhance efficiency, reliability, and sustainability. This review paper provides a comprehensive examination of the applications of RL in the field of energy system optimization, spanning various domains such as energy management, grid control, and renewable energy integration. Beginning with an overview of RL fundamentals, the paper explores recent advancements in RL algorithms and their adaptation to address the unique challenges of energy system optimization. Case studies and real-world applications demonstrate the efficacy of RL-based approaches in improving energy efficiency, reducing costs, and mitigating environmental impacts. Furthermore, the paper discusses future directions and challenges, including scalability, interpretability, and integration with domain knowledge. By synthesizing the latest research findings and identifying key areas for further investigation, this paper aims to inform and inspire future research endeavors in the intersection of reinforcement learning and energy system optimization. [ABSTRACT FROM AUTHOR]

This paper optimizes the assignment of shared automated vehicles under users' uncertain departure times. Automated vehicles can drive themselves, so no staff are needed to relocate vehicles in the one-way carsharing system. To optimize fleet placement and use, a twophase solution method was established. Phase 1 strategically distributes vehicles across stations using a system optimization approach, while Phase 2 tracks vehicle movements via an agent-based simulation model. Phase 1 solutions serve as inputs to Phase 2 simulations. Using a fleet size of roughly 10,000 vehicles, case study applications were run across the Austin, Texas region's six-county network. In the base case setting, results suggest that system profits are optimized when vehicle rental is priced at $1.28=km ($0.8=mi). The number of proactive vehicle relocations falls 9.8% if the relocation operation cost rises from $0.096=km ($0.06=mi) to $0.32=km ($0.2=mi). Average per-trip profit is $10.60 when using high-cost vehicles, and $11.60 when using low-cost vehicles. Results from a 3-h simulation show an average person-trip length of 25 km (15.6 mi), with 29.6 min of average driving time. When a 24-h day was simulated, the vehicle-occupied time and vehicle-distance traveled were 4 h and 200 km (125 mi) per vehicle-day, respectively. The low coefficient of variation of satisfied demand across 30 demand scenarios suggests the robustness of the two-phase solution method. [ABSTRACT FROM AUTHOR]

The popularity of digital cameras and social networks has greatly enriched people's spiritual life, and we can easily obtain massive amounts of digital photos. However, due to the lack of professional guidance and differences in aesthetic appreciation, the photos taken many photographers lack aesthetics. This article is dedicated to the research of image aesthetics, using computers to simulate human perception, and realize the evaluation or beautification of images in line with human aesthetics. In terms of image classification, this article examines the unique perception of human vision on images and proposes new aesthetic features. Combining visual features and semantic features, the SVM algorithm is utilized to build an aesthetic classifier. In the aspect of image optimization, this paper uses the detection of the main image area and the division line of the area and adjusts the main body size and position of the image according to common aesthetic rules, so as to realize the optimization adjustment of the composition of the social image. The experimental results show that the accuracy of social image classification is 97.7%, and the optimized and adjusted images are more aesthetic. [ABSTRACT FROM AUTHOR]

Despite the significance of resource levelling, project managers lack various ways to smooth resource usage fluctuation of a repetitive construction project besides changing resource usage. Tolerating interruptions is an effective way to provide flexibility for a schedule but is ignored when solving resource levelling problems. Therefore, this paper investigates the impacts of interruptions on resource usage fluctuation and develops an integrated approach that simultaneously integrates two scheduling adjusting processes: changing resource usage and tolerating interruptions. In this paper, two interruption conditions are proposed to identify which activities are suitable to be interrupted for smoothing resource usage fluctuation. The traditional resource levelling model is modified to a new scheduling model by incorporating interruptions. A two-stage GA-based scheduling algorithm is developed by integrating changing resource usage and tolerating interruptions. A commonly used pipeline project is adopted to illustrate the steps of the proposed approach and demonstrate its effectiveness and superiority through comparison with previous studies. A large-scale project further verifies the usability of the proposed approach. The results confirmed the feasibility to smooth resource usage fluctuation by interruptions, and the integrated approach can achieve a more competitive resource levelling result. [ABSTRACT FROM AUTHOR]

Data clustering is one of the branches of unsupervised learning and it is a process whereby the samples are divided into categories whose members are similar to each other. The K-means algorithm is a simple and fast clustering technique, but it has many initial problems, for example, it depends heavily on the initial value for better clustering. Moreover, it is susceptible to outliers and unbalanced clusters. The artificial bee colony (ABC) algorithm is one of the meta-heuristic algorithms that is used nowadays to solve many optimization problems including clustering and the fundamental problem of this algorithm is exploration and late convergence. In this paper, to solve the problem of exploration and late convergence in ABC are used Random Memory (RM) and Elite Memory (EM) called ABCWOA algorithm. RM in the ABCWOA algorithm has used the search stage for the bait in the whale optimization algorithm (WOA) and EM is also used to increase convergence. In addition, we control the use of EM dynamically. Finally, the proposed method was implemented on ten standard datasets from the UCI Machine Learning Database for evaluation. Moreover, it was compared in terms of statistical criteria and analysis of variance (ANOVA) test with basic ABC and WOA, vortex search (VS) algorithm, butterfly optimization algorithm (BOA), crow search (CS) algorithm, and cuckoo search algorithm (CSA). The simulation results showed that the degree of convergence maintained its performance by increasing the number of repetitions of the proposed method, but the ABC algorithm has shown poor performance by increasing the repetition of performance. ANOVA results also confirmed that the ABCWOA algorithm has a positive effect on the population and it contains less noise than other comparative algorithms. The ABCWOA algorithm show that the ABCWOA algorithm performs better than other meta-heuristic algorithms. [ABSTRACT FROM AUTHOR]

Metaheuristic algorithm is a generalization of heuristic algorithm that can be applied to almost all optimization problems. For optimization problems, metaheuristic algorithm is one of the methods to find its optimal solution or approximate solution under limited conditions. Most of the existing metaheuristic algorithms are designed for serial systems. Meanwhile, existing algorithms still have a lot of room for improvement in convergence speed, robustness, and performance. To address these issues, this paper proposes an easily parallelizable metaheuristic optimization algorithm called team competition and cooperation optimization (TCCO) inspired by the process of human team cooperation and competition. The proposed algorithm attempts to mathematically model human team cooperation and competition to promote the optimization process and find an approximate solution as close as possible to the optimal solution under limited conditions. In order to evaluate the performance of the proposed algorithm, this paper compares the solution accuracy and convergence speed of the TCCO algorithm with the Grasshopper Optimization Algorithm (GOA), Seagull Optimization Algorithm (SOA), Whale Optimization Algorithm (WOA) and Sparrow Search Algorithm (SSA). Experiment results of 30 test functions commonly used in the optimization field indicate that, compared with these current advanced metaheuristic algorithms, TCCO has strong competitiveness in both solution accuracy and convergence speed. [ABSTRACT FROM AUTHOR]

This paper studies transmission strategies for the downlink of a cloud radio access network, in which the base stations are connected to a centralized cloud computing-based processor with digital fronthaul or backhaul links. We provide a system-level performance comparison of two fundamentally different strategies, namely, the data-sharing strategy and the compression strategy, which differ in the way the fronthaul/backhaul is utilized. It is observed that the performance of both strategies depends crucially on the available fronthaul or backhaul capacity. When the fronthaul/backhaul capacity is low, the data-sharing strategy performs better, while under moderate-to-high fronthaul/backhaul capacity, the compression strategy is superior. Using insights from such a comparison, we propose a novel hybrid strategy, combining the data-sharing and compression strategies, which allows for better control over the fronthaul/backhaul capacity utilization. An optimization framework for the hybrid strategy is proposed. Numerical evidence demonstrates the performance gain of the hybrid strategy. [ABSTRACT FROM AUTHOR]

Today, continuous technical and emerging advances between power communication systems and smart grids and applying swarm intelligence have increased for data sharing and analytics in our life. On the other side, Internet of things (IoT) has important key role to establish constructive interactions between smart devices and smart grid and power communication applications. For enhancing data transformation and improvements of multi-objective Quality of Service (QoS) factors, Swarm Optimization Techniques (SOT) are applied simultaneously in a cooperative smart environment to solve NP-hard problems. This paper provides a comprehensive analysis to address a new technical taxonomy and categorization of existing SOT-based smart grid applications in power communication systems in the IoT. Also, existing service and resource management case studies on smart grids and power communication systems are briefly analyzed and discussed. Existing evaluation factors on smart grid applications using SOT are represented. Possible advantages and weaknesses of each category are discussed with respect to new challenges and open research directions. [ABSTRACT FROM AUTHOR]

This paper conducts a comprehensive exploration of contemporary optimization algorithms, addressing challenges and outlining potential avenues for future research. The survey encompasses a wide spectrum of optimization techniques employed in various domains, ranging from mathematical programming to machine learning and artificial intelligence. It systematically analyses the inherent challenges faced by existing algorithms, including scalability issues, convergence speed, and adaptability to diverse problem spaces. Furthermore, the paper critically examines the impact of optimization algorithms on real-world applications, considering their effectiveness and limitations. The survey identifies emerging trends, such as hybrid approaches and metaheuristic methods that offer promising directions for overcoming current challenges. By synthesizing the state-of-the-art in optimization algorithms, this paper provides a valuable resource for researchers, practitioners, and decision-makers, guiding them towards addressing existing limitations and unlocking new opportunities in the evolving landscape of optimization research. [ABSTRACT FROM AUTHOR]

The present paper provides a comparison of different optimization techniques applied to the model-based design of a Buck Zero Voltage Switching (ZVS) Quasi-Resonant DC-DC Converter. The comparison was made both on the basis of the duration of the optimization procedures and in terms of guaranteeing the performance of the power electronic device. The main task of the paper is to present various techniques based on the use of mathematical software for the optimal design of Quasi-Resonant DC-DC converters. These topologies were chosen because in them, the design is carried out according to computational procedures, in which several iterations are often necessary for the successful completion of the process. An optimization procedure with a target function reference curve of the output voltage was used. In this way, the optimization is performed without the need for a complete design of the device but only by using base ratios, design constraints, and past experience to determine initial values and intervals of change in circuit parameters. This is also the main advantage of the used optimization of the reference curve type of the output, compared to applying other objective functions, such as achieving minimum losses or maximum efficiency of the device. [ABSTRACT FROM AUTHOR]

Micro-irrigation pipe network systems are commonly utilized for water transmission and distribution in agricultural irrigation. They effectively transport and distribute water to crops, aiming to achieve water and energy conservation, increased yield, and improved quality. This paper presents a model for the scaled micro-irrigation pipeline network system and provides a comprehensive review of the fundamental concepts and practical applications of optimization techniques in the field of pipeline network design. This paper is divided into four main sections: Firstly, it covers the background and theoretical foundations of optimal design for scaled micro-irrigation pipeline network systems. Secondly, the paper presents an optimal design model specifically tailored for scaled micro-irrigation pipeline networks. And then, it discusses various optimization solution techniques employed for addressing the design challenges of scaled micro-irrigation pipeline networks, along with real-world case studies. Finally, this paper concludes with an outlook on the ongoing research and development efforts in the field of scaled micro-irrigation pipeline network systems. In addition, this paper establishes a fundamental model for optimizing pipeline networks, to achieve minimum safe operation and total cost reduction. It considers constraints such as pipeline pressure-bearing capacity, maximum flow rate, and diameter. The decision-making variables include pipeline diameter, length, internal roughness, node pressure, future demand, and valve placement. Additionally, this paper provides an extensive overview of deterministic methods and heuristic algorithms utilized in the optimal design of micro-irrigation pipeline networks. Finally, this paper presents future research directions for pipeline network optimization and explores the potential for algorithmic improvements, integration of machine learning techniques, and wider adoption of EPANET 2.0 software. These endeavors aim to lay a strong foundation for effectively solving complex and challenging optimization problems in micro-irrigation pipeline network systems in the future. [ABSTRACT FROM AUTHOR]

Tunicate Swarm Algorithm (TSA) is a new bio-based optimization technique that has proven not only to be able to compete with other methods but has also shown successful performance in classic design engineering problems/benchmark test problems. However, like some population-based methods, TSA tends to be trapped in local optima, converging to global optima in a long time, unbalanced exploitation/exploration, and the inability to effectively solve high-capacity engineering problems. In this paper, the M-TSA, which is a Modified version of the TSA, is proposed to overcome such problems. M-TSA was developed in three steps. The first is the new movement strategy that improves the movement of tunicates with a spiral movement, the second is the new herd strategy that improves the herd movement of tunics with the Levy movement, and the third is the consideration of the FAD effect. In this study, the efficiency and robustness of the M-TSA algorithm is tested on the CEC'17 test suite, six real-life design engineering problems, and two complex power system engineering problems. The test results were compared with other techniques reported in the literature and with the original TSA. Comparing the results from the M-TSA technique with other techniques proves the effectiveness of M-TSA with better exploration/exploitation balance and optimal solution finding. In this paper, MATLAB 2020b software is used for optimization problems simulation. [ABSTRACT FROM AUTHOR]

Owing to increasing competition, the marketing of commercial software products is a challenging task. Diverse marketing strategies are adopted to tap the huge market share. Among these, pricing and warranty are the most significant ones. The warranty policies organizations adopt usually have two dimensions: duration and effort spent during the warranty phase. In this paper, two variables are broadly taken: testing, which is an essential phase during software development, and warranty, which is a crucial component of after‐sales service. Here, we will formulate an optimization problem where returns and expenses will be influenced by price, testing resources spent, the duration for which testing is done, warranty duration and effort spent during warranty for the software product. The product sales are assumed to follow a Stochastic Bass model based on Non‐Homogeneous Poisson Process (NHPP). A free on‐site support warranty with an upper limit on duration and effort covers the 2D failure process. The numerical illustration is presented wherein profit is maximized by conjointly optimizing five variables, that is price, testing duration, testing effort, warranty duration and warranty effort. This study emphasizes on application of a popular soft computing, metaheuristic technique named genetic algorithm (GA) to solve an optimization problem for a software system. The solution to the Optimization problem is obtained using the GA tool in MATLAB. The results obtained have relevance in the industry for finding optimal values of significant variables before the release of newly developed software products to the ultimate client. The concept discussed in this paper has diverse applications in computer engineering, software and hardware industry. [ABSTRACT FROM AUTHOR]

This paper gives a review on the bio-inspired optimization methodology known as mayfly (MA) algorithm in order to resolve issues in optimization techniques. It is a newly formed meta-heuristic optimization algorithm that focuses on the movements of masculine and feminine mayflies. It is encouraged from flying behaviour also the methods of mating in mayflies. With the help of a realistic-world separate flow planning issue along with the coupling behaviour in numerous objective optimizations, the performance of the mayfly algorithm (MA) is well evaluated. Some of the implementations of this algorithm are discussed in this paper: Bearing fault diagnosis based on the mayfly algorithm, optimizing the performance of PEMFC, Covid diagnosis, wind speed optimization, improving the scheduling of solar wind speed using mayfly optimization, detecting fault in the wind turbine gearboxes, patterning in the array antennas with the help of optimization and so on. One of the main advantages of the MA is that it combines the other optimization algorithms namely swarm optimization (PSO) with the evolutionary optimizations (GA). The motion of the mayflies that resemble nuptial dance model along with the arbitrary flight helps in the improvement of the stability within the exploration and exploitation methods. In addition, allows escape from the community peak. All the above work reviewed shows promising results from the algorithm. More work can be carried out using this algorithm in future. [ABSTRACT FROM AUTHOR]

This is the Preface to the Special Issue of JOTA dedicated to the 60th birthday of Professor Aram V. Arutyunov [ABSTRACT FROM AUTHOR]

We report on the potential of today's LED technologies to approximate Spectral Power Distributions (SPDs) aimed at optimizing specific performance goals. We compare numerically optimal SPDs to actual SPDs produced by a 16-channel LED light source, aiming at optimizing performance for six different applications. These theoretical and practical limits of the potential of current LED technologies can serve as guidelines for the design of future LED sources for different applications. [ABSTRACT FROM AUTHOR]

Stochastic simulation optimization has been proposed by several researchers to optimize construction operations. Traditionally, explicit averaging is used to estimate the objective functions of candidate solutions. This is carried out by calculating the average estimates of the objective functions obtained from a number of simulation replications. However, the computation effort increases as the number of replications and the size of the search space increase. The main objective of this paper is to study the benefits of using implicit averaging and common random numbers to improve the quality of the optimum solutions while reducing the computation time. The initial results of this study showed a 91% reduction in the computation time and 2.6% improvement in the quality of the optimum solutions. [ABSTRACT FROM AUTHOR]

In improving PV system performance, the parameters associated with electrical photovoltaic equivalent models play a pivotal role. However, due to the increased mathematical complexities and non-linear traits of PV cells, the precise prediction of these parameters is a challenging task. To estimate the parameters associated with PV models, a reliable, robust, and accurate optimization technique is needed. This paper introduces a new algorithm, Rat Swarm Optimizer (RSO), for obtaining the optimum PV cell and module parameters. The proposed method maintains an adequate balance between the exploration and exploitation phases to overcome premature particle issues. The results obtained using RSO are compared with those of other algorithms, i.e., Particle Swarm Optimization (PSO), Ant Lion Optimizer (ALO), Salp Swarm Algorithm (SSA), Harris Hawks Optimization (HHO), and Grasshopper Optimization (GOA), in this work. The modified one-diode model (MODM) and modified two-diode model (MTDM) are used to analyze the parameters of the mono-crystalline PV cell using the suggested RSO. The obtained findings imply that the parameters estimated by the suggested RSO are more accurate than those calculated by the other algorithms taken into consideration in the paper. The statistical results are compared, and it is clear that RSO is a very accurate, fast, and dependable approach for the parameter estimation of PV cells. [ABSTRACT FROM AUTHOR]

Recently, the machine learning research trend expands to the system performance optimization field, where it has still been proposed by researchers based on their intuitions and heuristics. Compared to conventional major machine learning research areas such as image or speech recognition, machine learning-based system performance optimization fields are at the beginning stage. However, recent papers show that this approach is promising and has significant potential. This paper reviews 11 machine learning-based system performance optimization approaches from nine recent papers based on well-known machine learning models such as perceptron, LSTM, and RNN. This survey provides a detailed design and summarizes model, input, output, and prediction method of each approach. This paper covers various system performance areas from the data structure to essential system components of a computer system such as index structure, branch predictor, sort, and cache management. The result shows that machine learning-based system performance optimization has an important potential for future research. We expect that this paper shows a wide range of applicability of machine learning technology and provides a new perspective for system performance optimization. [ABSTRACT FROM AUTHOR]

The multiverse optimizer (MVO) is one of the most trending algorithms used nowadays. The searching space in MVO is restricted by the best solution only, leading to a poor searching domain, therefore, a long searching time. This paper proposes an improved multiobjective multi-verse optimizer (IMOMVO) as a novel population optimization technique to solve task scheduling problems. The IMOMVO is introduced to overcome the drawbacks risen in the original MVO and its latest enhanced version mMVO. The proposed method solves the problem of the average positioning (AP) by dynamically enhancing the equation of updating the AP based on the best and the second-best available solutions. To evaluate The proposed IMOMVO, several datasets scenarios containing various tasks and virtual machines (Vms) were used to test the approach's capability. Standard evaluation metrics are used to validate the results of the proposed method; task execution time, throughput, and the Vms processing power. The proposed method obtained better results according to the evaluation measures than other state-of-the-art methods. The execution time achieves less time when compared to the mMVO as the proposed method achieved 186.33 s for executing 100 tasks and 934.92 for executing 600 tasks. The throughput results also achieved astonishing results as for 100 tasks, the throughput achieved 0.19, and the Vm processing power for the proposed method was 0.25 Kw for executing 100 tasks. [ABSTRACT FROM AUTHOR]

In this paper, we propose a new method for solving multiobjective optimization problems with a large number of decision variables. The proposed method called weighted optimization framework is intended to serve as a generic method that can be used with any population-based metaheuristic algorithm. After explaining some general issues of large-scale optimization, we introduce a problem transformation scheme that is used to reduce the dimensionality of the search space and search for improved solutions in the reduced subspace. This involves so-called weights that are applied to alter the decision variables and are also subject to optimization. Our method relies on grouping mechanisms and employs a population-based algorithm as an optimizer for both original variables and weight variables. Different grouping mechanisms and transformation functions within the framework are explained and their advantages and disadvantages are examined. Our experiments use test problems with 2–3 objectives 40–5000 variables. Using our approach on three well-known algorithms and comparing its performance with other large-scale optimizers, we show that our method can significantly outperform most existing methods in terms of solution quality as well as convergence rate on almost all tested problems for many-variable instances. [ABSTRACT FROM PUBLISHER]

Improvement of the energy conversion processes efficiency helps to achieve a more reliable energy supply, a cleaner environment, more competitive businesses, and higher living standard. Industry data indicate significant potential for improving the efficiency of steam systems and minimizing their operating costs by implementing various measures. The present work is a result of a systematic approach for energy performance analysis and identification of opportunities for optimizing the steam-condensate system of the combined heat and power plant ESM Energetika, Skopje, North Macedonia. The boiler plants provide superheated steam used in a hot-water station for the district heating system, for electricity generation, and as process steam for industrial customers. As the main operating costs of the plant stem from the natural gas consumption, the implementation of a set of energy efficiency measures will lead to its reduction, accompanied by less environmental impact. As a result of the system analysis, a number of energy efficiency measures have been identified. For each measure, the impact on individual parts of the system, as well as on the system as a whole, is evaluated using the steam system modeller tool. This paper elaborates some of the identified measures that are considered more reliable from an operational and financial aspect, mainly focused on steam production for the district heating system. Based on a conservative approach, significant potential for savings of natural gas, electrical energy, and treated water is estimated, which will lead to annual financial savings of about 245000 Euro. [ABSTRACT FROM AUTHOR]

The growth in linked and autonomous vehicles has led to the emergence of vehicular ad hoc networks (VANETs) as a means to enhance road safety, traffic efficiency, and passenger comfort. However, VANETs face challenges in facilitating trustworthiness and high-quality services due to communication delays caused by traffic, dynamic topology changes, variable speeds, and other influencing factors. Hence, there is a need for a reliable data dissemination scheme capable of reducing communication delays among hops by identifying effective forwarder nodes. In this paper, we propose a novel, weighted, estimated, spider monkey-based, nature-inspired optimization (w-SMNO) method to generate a set of efficient relays. Additionally, we introduce a dynamic weight assignment and configuration model to enhance system accuracy using a neural network based on backpropagation with gradient descent optimization techniques to minimize errors in the machine learning model. The w-SMNO also incorporates a distinct algorithm for effective relay selection among multiple monkey spider groups. The simulation results demonstrate substantial improvements in w-SMNO, with a 35.7% increase in coverage, a 41.2% reduction in the end-to-end delay, a 36.4% improvement in the message delivery rate, and a 38.4% decrease in the collision rate compared to the state-of-the-art approaches. [ABSTRACT FROM AUTHOR]

Many different aspects of software system development and verification rely on precise function identification in binary code. Recognition of the source Assembly functions in embedded systems is one of the fundamental challenges in binary program analysis. While numerous approaches assume that the functions are given a priori, correct identification of the functions in binaries remains a great issue. This contribution addresses the problem of uncertainty in binary code in identification of functions, which were optimized during compilation. This paper investigates the difference between debug and optimized functions via modeling of these functions. To do so, we introduce an extensible model-centred hands-on approach for examining similarities between binary functions. The main idea is to model each function using a set of predetermined, experimentally discovered features, and then find a suitable weight vector that could give impact factor to each such a feature. After finding the weight vector, the introduced models of such desired functions can be identified in binary software packages. It means that we reduce the similarity identification problem of the models to a classical version of optimization problems with one optimization criterion. Using our implementation, we found that the proposed approach works smoothly for functions, which contain at least ten Assembly instructions. Our tool guarantees success at a very high level. [ABSTRACT FROM AUTHOR]

Medium-voltage (MV) cables often experience a shortened lifespan attributed to insulation breakdown resulting from accelerated aging and anomalous operational and environmental stresses. While partial discharge (PD) measurements serve as valuable tools for assessing the insulation state, complexity arises from the presence of diverse discharge sources, making the evaluation of PD data challenging. The reliability of diagnostics for MV cables hinges on the precise interpretation of PD activity. To streamline the repair and maintenance of cables, it becomes crucial to discern and categorize PD types accurately. This paper presents a comprehensive review encompassing the realms of detection, feature extraction, artificial intelligence, and optimization techniques employed in the classification of PD signals/sources. Its exploration encompasses a variety of sensors utilized for PD detection, data processing methodologies for efficient feature extraction, optimization techniques dedicated to selecting optimal features, and artificial intelligence-based approaches for the classification of PD sources. This synthesized review not only serves as a valuable reference for researchers engaged in the application of methods for PD signal classification but also sheds light on potential avenues for future developments of techniques within the context of MV cables. [ABSTRACT FROM AUTHOR]

• A review of waste management optimization models (WM-OMs). 2. • A novel characterization method for examining and benchmarking the features WM-OMs. 3. • A pioneering guide for the selection of proper uncertainty analysis approaches. 4. • A compilation of characteristics of the papers reviewed and their data (Appendix). 5. • A perspective on the design of WM-OMs for different applications and stakeholders. 6. The transition to a circular economy through sustainable waste management (WM) follows different paths in each region, depending on its socioeconomic conditions and existing infrastructure. Mathematical optimization models are rigorous tools for informing local decision-making and identifying WM policy levers based on a variety of configurations. This review explores the pathways taken when designing WM optimization models (WM-OMs) that establish a network of waste valorization technologies. To standardize the literature review process, we propose a novel characterization method for examining, relating, and benchmarking the features of WM-OMs. After a thorough review of 58 articles published between 2015 and 2022, we assembled a comprehensive database to document the characteristics of these papers and the type of data reported in their case studies. We aim to provide a solid foundation for streamlining and enhancing future WM-OMs. Our work identifies various opportunities to improve the accuracy and reliability of WM-OMs. They include modeling thermo-chemical reactions in WM processes; considering regulatory, environmental, and political constraints; recognizing the informal sector; exploring the impact of marketing mechanisms on waste prevention and recycling; improving the traceability of case study data; specifying the rationale for uncertainty analysis (UA); and indicating the mathematical model (type, optimization algorithm, and equations). As many WM-OM authors have implemented UA without justifying their method choices, our review provides a pioneering guide for selecting the UA approach. Finally, we discuss the need for a trade-off between performance and practicality as models become more complex, making it critical to consider the specific needs of stakeholders. [ABSTRACT FROM AUTHOR]

Simulation models are a valuable tool for exoskeleton development, especially for system optimization and evaluation. It allows an assessment of the performance and effectiveness of exoskeletons even at an early stage of their development without physical realization. Due to the closed physical interaction between the exoskeleton and the user, accurate modeling of the human–exoskeleton interaction in defined scenarios is essential for exoskeleton simulations. This paper presents a novel approach to simulate exoskeleton motion in response to human motion and the interaction forces at the physical interfaces between the human and the exoskeleton. Our approach uses a multibody model of a shoulder exoskeleton in MATLAB R2021b and imports human motion via virtual markers from a digital human model to simulate human–exoskeleton interaction. To validate the human-motion-based approach, simulated exoskeleton motion and interaction forces are compared with experimental data from a previous lab study. The results demonstrate the feasibility of our approach to simulate human–exoskeleton interaction based on human motion. In addition, the approach is used to optimize the support profile of an exoskeleton, indicating its potential to assist exoskeleton development prior to physical prototyping. [ABSTRACT FROM AUTHOR]

Business process optimization (BPO) has become an increasingly attractive subject in the wider area of business process intelligence and is considered as the problem of composing feasible business process designs with optimal attribute values, such as execution time and cost. Despite the fact that many approaches have produced promising results regarding the enhancement of attribute performance, little has been done to reduce the computational complexity due to the size of the problem. The proposed approach introduces an elaborate preprocessing phase as a component to an established optimization framework (bpoF) that applies evolutionary multi-objective optimization algorithms (EMOAs) to generate a series of diverse optimized business process designs based on specific process requirements. The preprocessing phase follows a systematic rule-based algorithmic procedure for reducing the library size of candidate tasks. The experimental results on synthetic data demonstrate a considerable reduction of the library size and a positive influence on the performance of EMOAs, which is expressed with the generation of an increasing number of nondominated solutions. An important feature of the proposed phase is that the preprocessing effects are explicitly measured before the EMOAs application; thus, the effects on the library reduction size are directly correlated with the improved performance of the EMOAs in terms of average time of execution and nondominated solution generation. The work presented in this paper intends to pave the way for addressing the abiding optimization challenges related to the computational complexity of the search space of the optimization problem by working on the problem specification at an earlier stage. [ABSTRACT FROM AUTHOR]

Compilation often takes a long time, especially for large projects or when identifying better optimization options. Currently, compilers are mainly installed on local machines and used as standalone software. Despite the availability of several online compilers, they do not offer an efficient all-in-one package for private account management, command line interface (CLI), code advisors, and optimization techniques. Today, the widespread usage of Software as a Service (SaaS) is ever-growing, and compilers are not an exception. In this paper, we describe a symmetric approach to compilation and how to compile code on distributed systems. Although some improvements in cloud compilers have been made, it is possible to harness the potential of the most-modern technologies and architecture patterns toward designing efficient, in-cloud compilers. In this paper, we propose an architecture design of a cloud-based compiler that is fully compatible with orchestration technologies, such as Kubernetes, providing a higher level of scalability, reliability, security, and maintainability. Microservice architecture alongside containerization and orchestration technologies assist us in making a scalable system that provides a high level of availability. We propose this architecture so that the system can handle a higher workload as it receives a large number of compilation requests per second. Distributed compilation is a prominent benefit of this approach, as each phase of the compilation can be executed in a separate server, which supplies a kind of workload mitigation to the whole system. In other words, we propose a new perspective for an intelligent way of advisor, error detection, and optimization of compilers. We also propose an implementation example of the developed architecture. Finally, we analyze the results from an experimental implementation, proving that we can compile code from more than 100k requests concurrently on a cloud cluster with one master node and three worker nodes. [ABSTRACT FROM AUTHOR]

Electrical Discharge Machining (EDM) is considered as the much traditional, adaptable and unconventional machining process that is proficient in generating complicated structures. Further, it is self-sufficient over the mechanical properties of workpiece materials only if it is conductive. The viability of the EDM process regarding the application types might get considerably improved with the constant enhancement in the personification of numerical control and the metal removal efficacy. This survey intends to make a review of 65 papers related to the optimization and modeling of EDM process machining. The analysis is thus made with regards to the following factors like Al alloy composite in Die Shrinking EDM, Optimization and Al metal matrix composites. Particularly, the hybrid optimization models in various papers are analyzed concerning their logic. Further, the algorithmic and parametric analysis is also made with the contributed papers. Finally, the research gaps and challenges in this EDM processing are discussed, which would pave the way for efficient research works in this area. [ABSTRACT FROM AUTHOR]

This paper introduces a novel method based on Adaptive Neuro-Fuzzy Inference System (ANFIS) and Optimization technique for calculating the Inverse Kinematics (IK) of a six Degree of Freedom (DoF) industrial robotic manipulator, ABB IRB 1200. The effect of different membership function in single ANFIS application is studied and best-fitted network is selected for ANFIS evaluation, which guaranteed a significant reduction in convergence time. This network predicts the best-suited joint angles and the predicted angles act as the initial condition to start optimization search in order to get the optimum values. The experimental studies carried out illustrate the effectiveness of proposed approach while tracking a given trajectory without violating the mechanical joint limit constraints. This method is highly accurate, efficient in terms of computation time and is applicable to any serial robot having higher DoF as it requires only direct kinematic equations. [ABSTRACT FROM AUTHOR]

A positively invariant set is an important concept in dynamical systems. The study of positively invariant set conditions for discrete-time systems is one interesting topic in both theoretical studies and practical applications research. Different methods for characterizing the invariance of different types of sets have been established. For example, the ellipsoidal and the Lorenz cone, which are quadratic convex sets, have different properties from a polyhedral set. This paper presents an optimization method and a dual optimization method to characterize the positive invariance of the ellipsoidal and the Lorenz cone. The proposed methods are applicable to both linear and nonlinear discrete-time systems. Using nonlinear programming and an induced norm, the positive invariance condition problems are transformed into optimization problems, and the dual optimization method is also used to give equivalent dual forms. Fewer results on the positive invariance condition of Lorenz cones can be found than for the other type of set; this paper fulfills the results of this problem. In addition, the proposed methods in this paper provide more options for checking the positive invariance of quadratic convex sets from the perspective of optimization and dual optimization. The effectiveness of this method is demonstrated by numerical examples. [ABSTRACT FROM AUTHOR]

In this paper, for the first time, a linear Lyapunov–Razumikhin function is introduced to find an |$\alpha$| -exponential state estimate for positive systems with time delays. A new set of conditions for the existence of exponential state boundedness of positive systems with bounded time-varying delays is established. Two procedures are then proposed to find the factor vector of |$\alpha$| -exponential state estimate, in which some techniques of optimization are applied to find the smallest possible factor vector. Numerical experiments are presented to demonstrate the effectiveness of the linear Lyapunov–Razumikhin function as well as of the optimization techniques. [ABSTRACT FROM AUTHOR]

As it tackles electrical and non‐electrical losses, the triple‐diode model (TDM) of photovoltaic (PV) cells is highly exact. This paper employs a novel optimization method known as the innovative optimization algorithm (INFO) technique to correctly estimate the electrical characteristics of such TDM. To shift agents towards a better position, the INFO algorithm exploits the concept of weighted mean. The primary goal of INFO is to stress its performance features to solve some optimization difficulties that other approaches cannot effectively solve. In this paper, the objective function based on a combination of the absolute value of the current error, its squared value, and its quadrable value is employed, which the INFO optimizer minimizes to predict the optimum parameters of such TDM precisely. The proposed INFO algorithm is carried out on multi‐ and mono‐crystalline varieties, such as the Kyocera KC200GT and the Canadian Solar CS6K‐280 M. The simulation outcomes demonstrate the INFO's ability to extract the model parameters precisely. The INFO achieved the lowest ideal fitness values of 9.0738 × 10−06 and 5.7356 × 10−05 for the KC200GT and Canadian Solar CS6K‐280 M, respectively, throughout the optimization procedure. Under various environmental circumstances, experimental validation of the calculated parameters using the (INFO) optimizer is carried out, and the results are compared to the observed values from the laboratory experiments. The simulation results demonstrate the INFO's convergence time and accuracy advantage over competing optimization techniques. Additionally, statistical analysis shows that the INFO optimizer is resilient. [ABSTRACT FROM AUTHOR]

Various strategies for optimizing the renewable energy system size exist, and they vary depending on the system design. In this paper, a standalone hybrid renewable energy system composed of a photovoltaic power source, wind turbines, storage, and diesel generators was considered. Linear programming was used to optimize the system in terms of multiple objectives. Bender's decomposition, lexicographic optimization, and epsilon constraint are among the linear programming techniques employed. The main objective function is to keep excess power to a minimum while also keeping unsatisfied demand to a minimum. This paper considers a full-year time span, optimizes household self-consumption, reduces curtailed power, maximizes local use of renewable generated power, lowers operational costs, lowers CO2 emissions, considers multiple renewable energy sources, considers system sizing as an objective, and incorporates the net present worth value of the components into the sizing. The aforementioned objectives and considerations have never been brought together yet in the literature. Furthermore, using a 365-day span is more comprehensive than using a 24-h span, which is typically used to limit the size of the linear programming issue. Therefore, in terms of integrated objectives, cost analysis, considerations, and timeframe, the proposed method is considered one of the most comprehensive. The ability to adjust the feed in limit to the grid and the change in electricity price during the day are also considered in this work. [ABSTRACT FROM AUTHOR]

Copyright of Journal of the American Institute for Conservation is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Few of the challenges with development of a single on–board motor for direct–drive electric vehicles include high torque density and low torque ripple. Therefore, in this paper, a 36–slot, 34–pole consequent pole six–phase permanent magnet synchronous machine (PMSM) has been optimized to address the aforementioned challenges for direct–drive application. Existing literature on optimization processes that rely solely on finite element models are restricted to three–phase machines only and also take longer computation time. Therefore, this paper proposes a novel optimization approach based on supervised machine learning for six–phase PMSM. In this approach, a non–conventional extended dual dq–frame model that accounts for higher order space harmonics in inductances and flux linkages has been developed and used for accurate computation of average torque and torque ripple of six–phase PMSM. Using the performance characteristics obtained from the extended dual dq–frame model for a set of initial design candidates, support vector regression algorithm is employed for supervised machine learning and increasing solutions in the design space. Furthermore, pareto front is used for selecting optimal machine models with maximum torque density and reduced torque ripple. Multi–objective trade–offs and comparison of initial and optimized designs based on average torque, torque ripple, efficiency and cost are performed. [ABSTRACT FROM AUTHOR]

Web citation analysis is primarily used to examine the impact of an author, an article or a publication by counting the amount of intervals that has been cited by other authors. The significant goal of web citation analysis is helping the researchers to find their related papers for their further analysis. The references of the paper must be cited by the author, which is used to recognize the link among the previous relevant research. The citation provides the valuable information that directs the researchers to gain knowledge about the current trends and future developments and obtain new ideas in their respective fields. The citation's information are incorporate in the database called web citation database such as Google Scholar, Web of Science, Scopus and so on. From the web citation database, extracting the user required information is very complex task. Most of the open source tools are available online but manual process is needed to select the user-required information from the web page. For instance if the user need author name and publisher from the web citation database, they required to choose the exact information tags manually in existing tools which consumes more time. To overcome this difficulty we proposed an algorithm Firefly Optimization Algorithm based Web Scraping for web content extraction from web citation database. The primary purpose of this research is to extract author information extraction process extracts citation information published by an author, journal name, publisher, year and citation using web citation analysis. The user's query input will be the keyword for example big data, artificial intelligence, etc. The web citation information from multiple web pages using Web crawling and web scraping techniques are applied for web citation information based on the user query and Particle Swarm Optimization, Hidden Markov Model are applied for finding the best solution from all the feasible solutions. Experiments illustrate the proposed FOAWS algorithm outperforms well comparing to other two algorithms. [ABSTRACT FROM AUTHOR]

Compositional Optimization (CompOpt) was recently proposed for optimization of discrete-event systems of systems. A modular optimization model allows CompOpt to divide the optimization into separate sub-problems, mitigating the state space explosion problem. This paper presents the Modular Optimization Learner (MOL), a method that interacts with a simulation of a system to automatically learn these modular optimization models. MOL uses a modular learning that takes as input a hypothesis structure of the system and uses the provided structural information to split the acquired learning into a set of modules, and to prune parts of the search space. Experiments show that modular learning reduces the state space by many orders of magnitude compared to a monolithic learning, which enables learning of much larger systems. Furthermore, an integrated greedy search heuristic allows MOL to remove many sub-optimal paths in the individual modules, speeding up the subsequent optimization. Note to Practitioners—Automation systems are becoming increasingly large and complex and the automation of more and more advanced tasks often requires the coordination of multiple subsystems. Optimization can have a great impact on the efficiency of these systems in terms of cost and operation speed. Finding optimal solutions is, however, a difficult task. As the number of tasks and subsystems of the automation system increases, the search space of the optimization problems tends to grow exponentially. Compositional Optimization (CompOpt) is a method specifically designed for the optimization of large-scale automation systems. A challenge with the application of CompOpt is that it takes as input a specific type of optimization model that divides the system into subsystems; like machines, vehicles, etc. Formulating these models requires a high level of expertise and system knowledge. This paper addresses this challenge with an algorithm that learns these models from a simulation of the system. The simulation can be implemented in any software as long as a suitable interface exists or can be constructed. To divide the learning into subsystems, the algorithm uses an initial plant structure hypothesis (PSH). This can be viewed as a meta-model that includes known structural information, such as the number of subsystems and which actions that affect each subsystem. The more structural information that is added to PSH, the more efficient the learning and subsequent optimization will be. The purpose of this is to reduce the level of expertise and system knowledge needed in the application of optimization, to simplify the transition to Industry 4.0. [ABSTRACT FROM AUTHOR]

Purpose: This paper aims to examine from commodity portfolio managers' perspective the performance of liquidity adjusted risk modeling in assessing the market risk parameters of a large commodity portfolio and in obtaining efficient and coherent portfolios under different market circumstances. Design/methodology/approach: The implemented market risk modeling algorithm and investment portfolio analytics using reinforcement machine learning techniques can simultaneously handle risk-return characteristics of commodity investments under regular and crisis market settings besides considering the particular effects of the time-varying liquidity constraints of the multiple-asset commodity portfolios. Findings: In particular, the paper implements a robust machine learning method to commodity optimal portfolio selection and within a liquidity-adjusted value-at-risk (LVaR) framework. In addition, the paper explains how the adapted LVaR modeling algorithms can be used by a commodity trading unit in a dynamic asset allocation framework for estimating risk exposure, assessing risk reduction alternates and creating efficient and coherent market portfolios. Originality/value: The optimization parameters subject to meaningful operational and financial constraints, investment portfolio analytics and empirical results can have important practical uses and applications for commodity portfolio managers particularly in the wake of the 2007–2009 global financial crisis. In addition, the recommended reinforcement machine learning optimization algorithms can aid in solving some real-world dilemmas under stressed and adverse market conditions (e.g. illiquidity, switching in correlations factors signs, nonlinear and non-normal distribution of assets' returns) and can have key applications in machine learning, expert systems, smart financial functions, internet of things (IoT) and financial technology (FinTech) in big data ecosystems. [ABSTRACT FROM AUTHOR]

Severe droughts, water-use conflicts, and minimum outflow requirements have caused infeasibilities in modeling large-scale complex hydrothermal systems. This paper presents and discusses a new formulation of objective function and constraints to better represent multiple water uses and deal with infeasibilities in the HIDROTERM model, a nonlinear programming (NLP) model developed to optimize the operation of the Brazilian interconnected hydrothermal system. The system is one of the largest in the world. In the last 10 years, approximately 72% of electricity consumed in Brazil has been supplied by hydropower plants, but with increasing shares from thermal, wind, and, more recently, solar power generation. Because of hydrological changes in recent years and the additional operational constraints imposed by environmental agencies, the use of models for decision making, such as HIDROTERM, frequently encounters the problem of infeasibility. To avoid this problem, a new objective function is proposed in HIDROTERM that incorporates economic penalties when the preset requirements are not met. Based on economic considerations, some hard constraints are removed from the constraint set and added to the objective function as penalty terms. These constraints are tightly linked with multiple water uses, including environmental protection, flood control, consumptive uses, and navigation purposes. The proposed change in the objective function and constraints avoids the problem of infeasibilities and makes it possible to apply the model to extreme conditions. Additionally, this formulation helps identify and minimize the risk, duration, and intensity of unavoidable non-compliance occurrences related to multiple water uses. The presented new version of the HIDROTERM model can be used to study and support decision making in the management and operation of large-scale hydrothermal systems. These systems can be formed by a set of hydraulically connected individual hydropower plants and reservoirs, located within a set of electrically connected subsystems. Each subsystem contains demands and other power plants, including thermal, wind, nuclear, and solar plants, and exchanges. The model has been developed with continued improvements since 2008 and applied to large systems such as the Brazilian Interconnected Power System (BIPS) with over 150 reservoirs. A graphical user interface is provided. The objective function is to minimize the total costs of additional thermal dispatch and exchanges, as well as avoid or minimize deficits in energy supply in subsystems, minimum releases, consumptive uses, and minimum storages in reservoirs. The decision variables are the power and nonpower releases for each hydropower plant and the thermal dispatches and exchanges for each subsystem. Some typical applications include (1) monthly planning operation of the system, considering a planning horizon from 3 to 5 years; (2) diagnostic studies about reliability and resilience of existing systems, processing the same system configuration to a set of different hydrological or energy demand scenarios; (3) impact analysis of changes in operational rules and constraints related to multiple uses of water; and (4) planning and evaluation of expansion alternatives. The model can be applied to a complete hydrothermal system or subsets of it, including subsystems, basins, cascades, or a single hydropower plant. [ABSTRACT FROM AUTHOR]

Reactive distillation (RD) combines chemical reactions and separation in a single unit essential to equilibrium-limited reactions. This new technique encompasses multiple advantages over traditional processes, including lower operating costs, increased thermal energy efficiency, high product selectivity, high purity percentage, and lower environmental impact. This paper provided an overview of the features, industrial applications, and industrial perspective of advanced reactive distillation technologies (ARDTs). This study focused on five under-development ARDTs: reactive dividing wall column (R-DWC), reactive high-gravity distillation (R-HiGee), reactive heat-integrated distillation column (R-HIDiC), catalytic cyclic distillation (CCD), and membrane-assisted reactive distillation (MA-RD). The primary drivers for new RD applications are reduced number of vessels, reduced residence time and holdup volume, increased mass and heat transfer, overcoming azeotropes, and prefractionation or impurity removal. ARDT's potential has yet to be studied, and research remains active to improve it further by investigating other RD technologies, simulation, and optimization techniques. [ABSTRACT FROM AUTHOR]

This paper develops a generic model that helps in crucial decision making of pricing and revenue-focused outsourcing for a stock-out problem of a deterministic, multi-echelon inventory system for a global supply chain. The manufacturer is considered to have insufficient production capacity and has the option to outsource. The optimization technique results in a non-linear programming problem. We investigated the conditions under which an outsourcing decision made by a manufacturer, increases the profit of the retailer, distributor, manufacturer, and the multi-echelon system. Initially, the objective function (i.e., channel profit) is tested for optimality and an exhaustive search method is performed with a suitable example, which results in a solution to the problem. The thresholds of different price parameters such as retail price, outsourcing price, unit production cost, manufacturer's offer price, and distributor price are also derived with an illustrative example. A decision-making framework is presented through an example which will help managers of a focal-manufacturing firm with insufficient production capacity in making optimum pricing and outsourcing decisions for maximizing channel profit. [ABSTRACT FROM AUTHOR]

In the realm of bioinformatics, Multiple Sequence Alignment (MSA) is a pivotal technique used to optimize the alignment of multiple biological sequences, guided by specific scoring criteria. Existing approaches addressing the MSA challenge tend to specialize in distinct biological features, leading to variability in alignment outcomes for the same set of sequences. Consequently, this paper proposes an enhanced evolutionary-based approach that simplifies the sequence alignment problem without considering the sequences in the non-dominated solution. Our method employs a multi-objective optimization technique that uniquely excludes non-dominated solution sets, effectively mitigating computational complexities. Utilizing the Sum of Pairs and the Total Conserved Column as primary objective functions, our approach offers a novel perspective. We adopt an integer coding approach to enhance the computational efficiency, representing chromosomes with sets of integers during the alignment process. Using the SABmark and BAliBASE datasets, extensive experimentation is conducted to compare our method with existing ones. The results affirm the superior solution quality achieved by our approach compared to its predecessors. Furthermore, via the Wilcoxon signed-rank test, a statistical analysis underscores the statistical significance of our model's improvement (p < 0.05). This comprehensive approach holds promise for advancing Multiple Sequence Alignment in bioinformatics. [ABSTRACT FROM AUTHOR]