Search

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]

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]

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]

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]

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]

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]

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]

Data-centric is a newly explored concept, where the attention is given to data optimization methodologies and techniques to improve model performance, rather than focusing on machine learning models and hyperparameter tunning. This paper suggests an effective data optimization methodology for optimizing imbalanced small datasets that improves machine learning model performance. This paper is focused on providing an effective solution when the number of observations is not enough to construct a machine learning model with high values of the estimated magnitudes. For example, the majority of the observations are labeled as one class (majority class), and the rest as the other, commonly considered as the class of interest (minority class). The proposed methodology does not depend on the applied classification models, rather it is based on the properties of the data resampling approach to systematically enhance and optimize the training dataset. The paper examines numerical experiments applying the data centric optimization methodology, and compares with previously obtained results by other authors. [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]

How to reduce a boiler's NOx emission concentration is an urgent problem for thermal power plants. Therefore, in this paper, we combine an evolution teaching-learning-based optimization algorithm with extreme learning machine to optimize a boiler's combustion parameters for reducing NOx emission concentration. Evolution teaching-learning-based optimization algorithm (ETLBO) is a variant of conventional teaching-learning-based optimization algorithm, which uses a chaotic mapping function to initialize individuals' positions and employs the idea of genetic evolution into the learner phase. To verify the effectiveness of ETLBO, 20 IEEE congress on Evolutionary Computation benchmark test functions are applied to test its convergence speed and convergence accuracy. Experimental results reveal that ETLBO shows the best convergence accuracy on most functions compared to other state-of-the-art optimization algorithms. In addition, the ETLBO is used to reduce boilers' NOx emissions by optimizing combustion parameters, such as coal supply amount and the air valve. Result shows that ETLBO is well-suited to solve the boiler combustion optimization problem. [ABSTRACT FROM AUTHOR]

Clean and renewable energy is the only way to achieve sustainable energy development, with considerable social and economic benefits. As a key technology for clean and renewable energy, it is very important to research the reliability optimization of microgrids. This paper reviews the research progress in microgrid reliability optimization. This paper first classifies and summarizes the existing research on microgrid control strategies and reliability assessment. Then, the system reliability optimization framework is summarized in terms of both microgrid systems and optimization objectives. Next, we summarize the most commonly used optimization algorithms for microgrid reliability for different microgrid systems. Finally, we provide a bibliometric analysis of the literature on the reliability research of microgrids. In addition, we propose some research challenges in the future for the reliability of microgrids. [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]

Phase field modeling finds utility in various areas. In optimization theory in particular, the distributed control and Neumann boundary control of phase field models have been investigated thoroughly. Dirichlet boundary control in parabolic equations is commonly addressed using the very weak formulation or an approximation by Robin boundary conditions. In this paper, the Dirichlet boundary control for a phase field model with a non-singular potential is investigated using the Dirichlet lift technique. The corresponding weak formulation is analyzed. Energy estimates and problem-specific embedding results are provided, leading to the existence and uniqueness of the solution for the state equation. These results together show that the control to state mapping is well defined and bounded. Based on the preceding findings, the optimization problem is shown to have a solution. [ABSTRACT FROM AUTHOR]

This paper proposes a novel approach to suppressing bounded exogenous disturbances in a linear discrete-time control system by a static state- or output-feedback control law. The approach is based on reducing the original problem to a nonconvex matrix optimization problem with the gain matrix as one variable. The latter problem is solved by the gradient method; its convergence is theoretically justified for several important special cases. An example is provided to demonstrate the effectiveness of the iterative procedure proposed. [ABSTRACT FROM AUTHOR]

The nozzle-matrix gas flow velocity has a great influence on the accuracy of the temperature field of a printed circuit board assembly (PCBA) during the hot air convection reflow soldering process. This paper proposes a new approach that integrates the theoretical calculation, numerical simulation and an experimental test to accurately determine the nozzle-matrix gas flow velocity. First, the temperature profile of the aluminum alloy thin plate in convection reflow ovens is measured using a Wiken tester. Second, the nozzle-matrix gas flow velocity is theoretically calculated with the Martin formula. The computational fluid dynamic (CFD)simulation is performed according to the Icepak code, where a single oven chamber model is established to represent the 10 zones of soldering ovens to reduce computational resources considering the supry of the soldering ovens. The simulated temperature profile of the aluminum alloy thin plate is obtained and the specific response surface model (RSM) is established to represent the deviation between the simulated temperature and the measured temperature. Finally, based on reverse problem analysis, non-linear programming by quadratic Lagrangian (NLPQL) is used to solve the mathematical optimization model with the objective of minimizing the temperature deviation to obtain the corrected nozzle-matrix gas flow velocity. To validate the accuracy, the temperature test and the modeling using the corrected gas flow velocity for a new PCBA component for the soldering ovens is conducted separately. The temperature comparison between the simulation and the test shows that the maximum temperature deviation is within 10 °C. This provides evidence that the nozzle-matrix gas flow velocity obtained by the new approach is accurate and effective. [ABSTRACT FROM AUTHOR]

This paper explores the concept of Generalized Roughness in LA-Semigroups and its applications in various mathematical disciplines. We highlight the fundamental properties and structures of Generalized Roughness, examining its relationships with Fuzzy Lie Algebras, Order Theory, Lattice Structures, Algebraic Structures, and Categorical Perspectives. Moreover, we investigate the potential of mathematical modeling, optimization techniques, data analysis, and machine learning in the context of Generalized Roughness. Our findings reveal important results in Generalized Roughness, such as the preservation of roughness under the fuzzy equivalence relation and the composition of roughness sets. We demonstrate the significance of Generalized Roughness in the context of order theory and lattice structures, presenting key propositions and a theorem that elucidate its properties and relationships. Furthermore, we explore the applications of Generalized Roughness in mathematical modeling and optimization, highlighting the optimization of roughness measures, parameter estimation, and decision-making processes related to LA-Semigroup operations. We showcase how mathematical techniques can enhance understanding and utilization of LA-Semigroups in practical scenarios. Lastly, we delve into the role of data analysis and machine learning in uncovering patterns, relationships, and predictive models in Generalized Roughness. By leveraging these techniques, we provide examples and insights into how data analysis and machine learning can contribute to enhancing our understanding of LA-Semigroup behavior and supporting decision-making processes. [ABSTRACT FROM AUTHOR]

The regulation and stabilization of a system's output to achieve desired performance and ensure system reliability require the use of different controllers, but selecting appropriate control parameters presents a challenge in ensuring robustness and stability. Proportional–integral–derivative (PID) controllers are popularly used due to their simplicity and effectiveness in addressing these challenges. In this paper, a simple, effective, and efficient, novel graphical technique is proposed to design PID and its variants (PI/PD) controllers, which addresses the challenges in selecting appropriate control parameters. The method involves creating three equispaced vectors for controller parameters (Kp,Ki,Kd)$(K_{\text{p}}, K_{\text{i}}, K_{\text{d}})$, and obtaining a 3D (2D in PI/PD) Cartesian grid of these vectors. All nodes in the grid provide several possible controllers, and integral time squared error (ITSE) is calculated for each controller from the closed‐loop step response of the system. The obtained ITSE is plotted in a 4D (PID) or 3D (PI/PD) graph, and controller parameters corresponding to the minimum value of ITSE are identified. Furthermore, the proposed graphical technique aids in choosing the lower and upper bounds (LB and UB) if the controller is designed using optimization techniques. The better selection of LB and UB reduces the search space resulting in lesser execution time and fewer iterations. To validate the proposed graphical technique, we designed various controllers for widely‐used brush‐less DC and switch reluctance motors in electric vehicles. Additionally, by choosing the LB and UB with the proposed technique, controllers are also designed using three optimization techniques: particle swarm optimization, black widow optimization algorithm, and honey badger algorithm. The obtained controllers using the graphical technique outperformed the optimization techniques in terms of time and frequency domain specifications, and the proposed selection of lower and upper bounds resulted in improved performance in terms of iterations and execution time. [ABSTRACT FROM AUTHOR]

The most commonly used model of solar cells is the single-diode model, with five unknown parameters. First, this paper proposes three variants of the single-diode model, which imply the voltage dependence of the series resistance, parallel resistance, and both resistors. Second, analytical relationships between the current and the voltage expressed were derived using the Lambert W function for each proposed model. Third, the paper presents a hybrid algorithm, Chaotic Snake Optimization (Chaotic SO), combining chaotic sequences with the snake optimization algorithm. The application of the proposed models and algorithm was justified on two well-known solar photovoltaic (PV) cells—RTC France solar cell and Photowatt-PWP201 module. The results showed that the root-mean-square-error (RMSE) values calculated by applying the proposed equivalent circuit with voltage dependence of both resistors are reduced by 20% for the RTC France solar cell and 40% for the Photowatt-PWP201 module compared to the standard single-diode equivalent circuit. Finally, an experimental investigation was conducted into the applicability of the proposed models to a solar laboratory module, and the results obtained proved the relevance and effectiveness of the proposed models. [ABSTRACT FROM AUTHOR]

Vehicular ad hoc networks (VANETs) are a fundamental component of intelligent transportation systems in smart cities. With the support of open and real-time data, these networks of inter-connected vehicles constitute an 'Internet of vehicles' with the potential to significantly enhance citizens' mobility and last-mile delivery in urban, peri-urban, and metropolitan areas. However, the proper coordination and logistics of VANETs raise a number of optimization challenges that need to be solved. After reviewing the state of the art on the concepts of VANET optimization and open data in smart cities, this paper discusses some of the most relevant optimization challenges in this area. Since most of the optimization problems are related to the need for real-time solutions or to the consideration of uncertainty and dynamic environments, the paper also discusses how some VANET challenges can be addressed with the use of agile optimization algorithms and the combination of metaheuristics with simulation and machine learning methods. The paper also offers a numerical analysis that measures the impact of using these optimization techniques in some related problems. Our numerical analysis, based on real data from Open Data Barcelona, demonstrates that the constructive heuristic outperforms the random scenario in the CDP combined with vehicular networks, resulting in maximizing the minimum distance between facilities while meeting capacity requirements with the fewest facilities. [ABSTRACT FROM AUTHOR]

This paper reviews the current techniques used in energy management systems to optimize energy schedules into microgrids, accounting for uncertainties for various time frames (day-ahead and real-time operations). The current uncertainties affecting applications, including residential, commercial, virtual power plants, electric mobility, and multi-carrier microgrids, are the main subjects of this article. We outline the most recent modeling approaches to describe the uncertainties associated with various microgrid applications, such as prediction errors, load consumption, degradation, and state of health. The modeling approaches discussed in this article are probabilistic, possibilistic, information gap theory, and deterministic. Then, the paper presents and compares the current optimization techniques, considering the uncertainties in their problem formulations, such as stochastic, robust, fuzzy optimization, information gap theory, model predictive control, multiparametric programming, and machine learning techniques. The optimization techniques depend on the model used, the data available, the specific application, the real-time platform, and the optimization time. We hope to guide researchers to identify the best optimization technique for energy scheduling, considering the specific uncertainty and application. Finally, the most challenging issues to enhance microgrid operations, despite uncertainties by considering new trends, are discussed. [ABSTRACT FROM AUTHOR]

This article considers a box-constrained global optimization problem for Lipschitz continuous functions with an unknown Lipschitz constant. The well-known derivative-free global search algorithm DIRECT (DIvide RECTangle) is a promising approach for such problems. Several studies have shown that recent two-step (global and local) Pareto selection-based algorithms are very efficient among all DIRECT-type approaches. However, despite its encouraging performance, it was also observed that the candidate selection procedure has two possible shortcomings. First, there is no limit on how small the size of selected candidates can be. Secondly, a balancing strategy between global and local candidate selection is missing. Therefore, it may waste function evaluations by over-exploring the current local minimum and delaying finding the global one. This paper reviews and employs different strategies in a two-step Pareto selection framework (1-DTC-GL) to overcome these limitations. A detailed experimental study has revealed that existing strategies do not always improve and sometimes even worsen results. Since 1-DTC-GL is a DIRECT-type algorithm, the results of this paper provide general guidance for all DIRECT-type algorithms on how to deal with excessive local refinement more efficiently. [ABSTRACT FROM AUTHOR]

The possibilities and ways of design and implementation of distributed information and communication systems for management of traffic and road infrastructure in road traffic that are used in intelligent transportation systems, are considered and described in the paper. First, such intelligent transportation systems are shortly described. Then, the basic architecture of one distributed information and communication system for intelligent management in road traffic is proposed. The system consists of a central part of the system and several modules or subsystems, responsible for certain individual functionsof control. Most of the paper is dedicated to the description of one practically designed and implemented module, or system, for optimizing travel and travel costs. The design and architecture of the implemented system are described. The system is intended for optimization of the length, time and cost of traveling of users in road traffic. It offers to the user several of the most favourable routes, i.e. traveling routes, between selected travel destinations, with their lengths, expected travel times and expected travel costs, on journeys that cross state borders and use roads with toll payment. It takes into account the duration of congestion at border crossings and toll payment stations, as well as the prices of tolls on the offered traveling routes. More detailed experimental research was performed on the designed and implemented system. Situations when crossing the border between Bosnia and Herzegovina and Serbia, the border between Bosnia and Herzegovina and Croatia, and the border between Serbia and Croatia were observed practically and experimentally. Also, toll payment stations on highways in Republic of Srpska, Serbia and Croatia were observed. Some experimentally obtained results are given in the paper. [ABSTRACT FROM AUTHOR]

The paper presents research on a specific approach to the issue of computed tomography with an incomplete data set. The case of incomplete information is quite common, for example when examining objects of large size or difficult to access. Algorithms devoted to this type of problems can be used to detect anomalies in coal seams that pose a threat to the life of miners. The most dangerous example of such an anomaly may be a compressed gas tank, which expands rapidly during exploitation, at the same time ejecting rock fragments, which are a real threat to the working crew. The approach presented in the paper is an improvement of the previous idea, in which the detected objects were represented by sequences of points. These points represent rectangles, which were characterized by sequences of their parameters. This time, instead of sequences in the representation, there are sets of objects, which allow for the elimination of duplicates. As a result, the reconstruction is faster. The algorithm presented in the paper solves the inverse problem of finding the minimum of the objective function. Heuristic algorithms are suitable for solving this type of tasks. The following heuristic algorithms are described, tested and compared: Aquila Optimizer (AQ), Firefly Algorithm (FA), Whale Optimization Algorithm (WOA), Butterfly Optimization Algorithm (BOA) and Dynamic Butterfly Optimization Algorithm (DBOA). The research showed that the best algorithm for this type of problem turned out to be DBOA. [ABSTRACT FROM AUTHOR]

Electric distribution grid operations typically rely on both centralized optimization and local non-optimal control techniques. As an alternative, distribution system operational practices can consider distributed optimization techniques that leverage communications among various neighboring agents to achieve optimal operation. With the rapidly increasing integration of distributed energy resources (DERs), distributed optimization algorithms are growing in importance due to their potential advantages in scalability, flexibility, privacy, and robustness relative to centralized optimization. Implementation of distributed optimization offers multiple challenges and also opportunities. This paper provides a comprehensive review of the recent advancements in distributed optimization for electric distribution systems and classifications using key attributes. Problem formulations and distributed optimization algorithms are provided for example use cases, including volt/var control, market clearing process, loss minimization, and conservation voltage reduction. Finally, this paper also presents future research needs for the applicability of distributed optimization algorithms in the distribution system. [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]

In general, a complex system is composed of different components that are usually subject to a maintenance policy. We take into account systems containing components that are under both preventive and corrective maintenance. Preventive maintenance is considered as a failure-based preventive maintenance model, where full renewal is realized after the occurrence of every nth failure. It offers an imperfect corrective maintenance model, where each repair deteriorates the component or system lifetime, the probability distribution of which gradually changes via increasing failure rates. The reliability mathematics for unavailability quantification is demonstrated in the paper. The renewal process model, involving failure-based preventive maintenance, arises from the new corresponding renewal cycle, which is designated a real ageing process. Imperfect corrective maintenance results in an unwanted rise in the unavailability function, which can be rectified by a properly selected failure-based preventive maintenance policy; i.e., replacement of a properly selected component respecting both cost and unavailability after the occurrence of the nth failure. The number n is considered a decision variable, whereas cost is an objective function in the optimization process. The paper describes a new method for finding an optimal failure-based preventive maintenance policy for a system respecting a given reliability constraint. The decision variable n is optimally selected for each component from a set of possible realistic maintenance modes. We focus on the discrete maintenance model, where each component is realized in one or several maintenance mode(s). The fixed value of the decision variable determines a single maintenance mode, as well as the cost of the mode. The optimization process for a system is demanding in terms of computing time because, if the system contains k components, all having three maintenance modes, we need to evaluate 3k maintenance configurations. The discrete maintenance optimization is shown with two systems adopted from the literature. [ABSTRACT FROM AUTHOR]

Waterflooding is the most common secondary recovery technique used in oil and gas industries today, owing to its cheap investment cost and easy implementation. However, major challenges are encountered in terms of oil sweep efficiency and breakthrough time which poses a risk to production and economic lifecycle of reservoirs. As a result, reservoir engineers are tasked with improvising optimal production strategies with the goal of maximizing profit. This review extensively describes some common optimization techniques reported in improving oil reservoir production. Also, their formulation, limitations and advantages with respect to production rates, oil well placement and control, inter-well connectivity and reservoir sweep efficiency were reviewed. While there are several optimization algorithms used in waterflooding, the emphasis in this work involves only the gradient and data driven optimizers since it is impossible to cover all optimization technique in a single review paper. Basically, no algorithm has been globally accepted as superior to the other since the sole aim is to improve productivity and economic profit, and each of these techniques has its unique practicability. However, when considering factors like design limitations, computational and economic cost, implementation timeframe, availability of data, some technique may suffice. [ABSTRACT FROM AUTHOR]

This paper presents a feasibility analysis of the technical, environmental, and economic sustainability of an existing mini-grid technology system in Nigeria. The study investigates the cost and other operational parameters of the Gbamu-Gbamu solar–battery–diesel hybrid mini-grid, specifically the 85 kWp solar PV installation in the Ijebu East Local Government area of Ogun state. Situated within the Owo forest in South-West Nigeria, the mini-grid aims to reduce the effects of global warming and promote sustainable technological development in rural communities by increasing energy access through renewable sources. To assess the system's viability, this research utilized RETScreen Expert software to validate the techno-economic and environmental sustainability of the installed mini-grid solar–PV–battery–diesel system in the region. Climatic data for the study were obtained from the National Aeronautics and Space Administration (NASA). The results demonstrate that the system is economically feasible and environmentally viable, as indicated by the positive net present value (NPV) and an average monthly irradiance of 4.78 kW/h/m2. Furthermore, the system achieved a 92.9% reduction in GHG emissions, provided a reasonable payback period of four years, and enabled a yearly electricity export of 203 MWh. These findings highlight the system's potential to enhance energy access and mitigate climate change. [ABSTRACT FROM AUTHOR]

This paper reports the surface quality of a miniature cylindrical titanium rod/bar (MCTB) turned by the wire electrical discharge turning (WEDT) process using a zinc-coated wire of 250 µm diameter. The surface quality was mainly evaluated by considering the very important surface roughness parameters, i.e., the mean roughness depth. A Box–Behnken design (BBD) of the response surface methodology (RSM) based on 17 experimental runs was conducted, where the spark duration "Ton" was found as the most influential parameter affecting the mean roughness depth "RZ" of the miniature titanium bar. Further, using the grey relational analysis (GRA) technique of optimization, we obtained the least value of "RZ" 7.42 µm after machining a miniature cylindrical titanium bar with the optimum combination of WEDT's variable parameters: Ton—0.9 µs, SV—30 V, and DOC—0.35 mm. This optimization led to a 37% reduction in the surface roughness Rz of the MCTB. The tribological characteristics of this MCTB were also found favorable after conducting a wear test. After completing a comparative study, we can claim that our results are better than those of the past research conducted in this area. The findings of this study are beneficial for the micro-turning of cylindrical bars made from a variety of difficult-to-machine materials. [ABSTRACT FROM AUTHOR]

In this paper, we introduce a new hybrid optimization method for the inverse design of metasurfaces, which combines the original Harris hawks optimizer (HHO) with a gradient-based optimization method. The HHO is a population-based algorithm that mimics the hunting process of hawks tracking prey. The hunting strategy is divided into two phases: exploration and exploitation. However, the original HHO algorithm performs poorly in the exploitation phase and may get trapped and stagnate in a basin of local optima. To improve the algorithm, we propose pre-selecting better initial candidates obtained from a gradient-based-like (GBL) optimization method. The main drawback of the GBL optimization method is its strong dependence on initial conditions. However, like any gradient-based method, GBL has the advantage of broadly and efficiently spanning the design space at the cost of computation time. By leveraging the strengths of both methods, namely GBL optimization and HHO, we show that the proposed hybrid approach, denoted as GBL–HHO, is an optimal scenario for efficiently targeting a class of unseen good global optimal solutions. We apply the proposed method to design all-dielectric meta-gratings that deflect incident waves into a given transmission angle. The numerical results demonstrate that our scenario outperforms the original HHO. [ABSTRACT FROM AUTHOR]

Deoxyadenosine triphosphate (dATP) is an important biochemical molecule. In this paper, the synthesis of dATP from deoxyadenosine monophosphate (dAMP), catalyzed by Saccharomyces cerevisiae, was studied. By adding chemical effectors, an efficient ATP regeneration and coupling system was constructed to achieve efficient synthesis of dATP. Factorial and response surface designs were used to optimize process conditions. Optimal reaction conditions were as follows: dAMP 1.40 g/L, glucose 40.97 g/L, MgCl2·6H2O 4.00 g/L, KCl 2.00 g/L, NaH2PO4 31.20 g/L, yeast 300.00 g/L, ammonium chloride 0.67 g/L, acetaldehyde 11.64 mL/L, pH 7.0, temperature 29.6 °C. Under these conditions, the substrate conversion was 93.80% and the concentration of dATP in the reaction system was 2.10 g/L, which was 63.10% higher than before optimization, and the concentration of product was 4 times higher than before optimization. The effects of glucose, acetaldehyde, and temperature on the accumulation of dATP were analyzed. [ABSTRACT FROM AUTHOR]

Injection molding (IM) is the most widespread and economical way to obtain high-quality plastic components. The process depends, however, to a great extent, on the quality and efficiency of the injection molding tools. Given the nature of the IM process, the temperature control system (TCS), its design, and its efficiency are of utmost importance for achieving the highest possible quality of plastic parts in the shortest possible time. For that reason, the implementation of additive manufacturing (AM) in novel IM temperature control strategies has gained considerable interest in academia and industry over the years. Conformal cooling channels (CCCs) are TCSs that have already demonstrated great potential when compared to conventional gun-drilling systems. Nevertheless, despite the recent advances, the design of these systems is still an open field of study and requires additional research in both aspects deemed as critical: thermo-mechanical models and the application of optimization techniques. This review paper tackles all the relevant, available papers on this topic, highlighting thermo-mechanical models developed by TCS designers and the optimization techniques used. The articles were thoroughly analyzed, and key points on the design of new TCS and new opportunities were identified. [ABSTRACT FROM AUTHOR]

In this paper, we propose an optimization method for protograph-based spatially coupled low-density parity-check (SC-LDPC) codes under window decoding (WD). Previous works on constructing SC-LDPC codes for WD typically focused on optimizing asymptotic performance metrics such as the WD threshold. However, in this paper, it is observed that the WD threshold is not an appropriate metric to sufficiently explain the finite-length behavior of SC-LDPC codes under WD. Thus, we propose a new performance metric, called the window mean parameter, based on a scaling analysis to capture the WD performance more accurately and formulate a code optimization algorithm that optimizes the proposed performance metric. Since the proposed metric depends on the window size, the optimization algorithm can provide a code family of SC-LDPC codes optimized for various target window sizes. Simulation results confirm that the improvement in the proposed metric leads to a finite-length performance improvement, resulting in one to two orders of the frame error rate gain over the conventional SC-LDPC codes for a wide range of window sizes. Furthermore, we investigate structural characteristics of the proposed codes to provide a supplementary explanation for the performance improvement, which also promotes a better understanding of SC-LDPC codes for WD. [ABSTRACT FROM AUTHOR]

In the field of reinforcement learning, we propose a Correct Proximal Policy Optimization (CPPO) algorithm based on the modified penalty factor β and relative entropy in order to solve the robustness and stationarity of traditional algorithms. Firstly, In the process of reinforcement learning, this paper establishes a strategy evaluation mechanism through the policy distribution function. Secondly, the state space function is quantified by introducing entropy, whereby the approximation policy is used to approximate the real policy distribution, and the kernel function estimation and calculation of relative entropy is used to fit the reward function based on complex problem. Finally, through the comparative analysis on the classic test cases, we demonstrated that our proposed algorithm is effective, has a faster convergence speed and better performance than the traditional PPO algorithm, and the measure of the relative entropy can show the differences. In addition, it can more efficiently use the information of complex environment to learn policies. At the same time, not only can our paper explain the rationality of the policy distribution theory, the proposed framework can also balance between iteration steps, computational complexity and convergence speed, and we also introduced an effective measure of performance using the relative entropy concept. [ABSTRACT FROM AUTHOR]

This paper focuses on optimal time-of-arrival (TOA) sensor placement for multiple target localization simultaneously. In previous work, different solutions only using non-shared sensors to localize multiple targets have been developed. Those methods localize different targets one-by-one or use a large number of mobile sensors with many limitations, such as low effectiveness and high network complexity. In this paper, firstly, a novel optimization model for multi-target localization incorporating shared sensors is formulated. Secondly, the systematic theoretical results of the optimal sensor placement are derived and concluded using the A-optimality criterion, i.e., minimizing the trace of the inverse Fisher information matrix (FIM), based on rigorous geometrical derivations. The reachable optimal trace of Cramér-Rao lower bound (CRLB) is also derived. It can provide optimal conditions for many cases and even closed form solutions for some special cases. Thirdly, a novel numerical optimization algorithm to quickly find and calculate the (sub-)optimal placement and achievable lower bound is explored, when the model becomes complicated with more practical constraints. Then, a hybrid method for solving the most general situation, integrating both the analytical and numerical solutions, is proposed. Finally, the correctness and effectiveness of the proposed theoretical and mathematical methods are demonstrated by several simulation examples. [ABSTRACT FROM AUTHOR]

The soil water retention curve (SWRC) has a significant role in determining the unsaturated properties of soil. A stochastic optimisation algorithm named Rao-1 algorithm is employed to estimate the parameters of the SWRC model in this paper. The Rao-1 algorithm is a simple heuristic search algorithm containing only addition and multiplication operations. This paper introduces the method and its application in determining soil water retention this model parameters in detail. In this study, the van Genuchten model is used to depict the SWRC for its good fitting capacity, and the van Genuchten model parameters are determined using Rao-1 algorithm. The feasibility and efficiency of the proposed method are validated via the experimental results of 24 soil samples of 12 soil textural classes. Besides, the performance of Rao-1 algorithm is compared with that of salp swarm algorithm, the particle swarm optimization algorithm, differential evolution algorithm, and RETC program. Through comparative analysis, Rao-1 algorithm outperforms other methods in determining SWRC parameters. [ABSTRACT FROM AUTHOR]

This paper proposes an innovative image compression scheme by utilizing the Adaptive Discrete Wavelet Transform-based Lifting Scheme (ADWT-LS). The most important feature of the proposed DWT lifting method is splitting the low-pass and high-pass filters into upper and lower triangular matrices. It also converts the filter execution into banded matrix multiplications with an innovative lifting factorization presented with fine-tuned parameters. Further, optimal tuning is the most important contribution that is achieved via a new hybrid algorithm known as Lioness-Integrated Whale Optimization Algorithm (LI-WOA). The proposed algorithm hybridizes the concepts of both the Lion Algorithm (LA) and Whale Optimization Algorithm (WOA). In addition, innovative cosine evaluation is initiated in this work under the CORDIC algorithm. Also, this paper defines a single objective function that relates multi-constraints like the Peak Signal-to-Noise Ratio (PSNR) as well as Compression Ratio (CR). Finally, the performance of the proposed work is compared over other conventional models regarding certain performance measures. [ABSTRACT FROM AUTHOR]

This paper presents the development of a novel multiobjective model for optimizing the planning of airport airside expansion projects that provides the capability of minimizing both airport operations disruption cost and total construction cost. The model computations are performed in four main modules: (1) a simulation module that calculates and quantifies the impact of airport construction activities on airport operations, (2) a multiobjective genetic algorithms optimization module that identifies an optimal schedule for airport airside expansion projects, (3) a scheduling module that calculates the start and finish times of each construction activity, and (4) a cost module that computes the total cost of construction-related disruptions in airport operations and the total construction cost. A real-life case study of an airport airside expansion project is analyzed to illustrate the use of the model and highlight its original contributions to the body of knowledge including its novel methodologies for (1) quantifying and minimizing the impact of construction activities on airport operations, (2) analyzing and minimizing the impact of air traffic data and airport operations on total construction cost, and (3) generating a set of optimal construction plans including optimal project start time, activities start time, and weekly and daily work plans for all activities. The results of the case study clearly illustrate the original contributions of the developed model and its novel capabilities that are expected to support airport and construction planners in their efforts to improve the cost-effectiveness and functional performance of airports during airside expansion projects. [ABSTRACT FROM AUTHOR]

The paper presents a solution to the problem of synthesis of control with respect to the sliding interval length for the optimization of a class of discrete linear multidimensional objects with a quadratic performance criterion. The equation of motion of a closed multidimensional discrete system in the general non-stationary case is derived based on the length of the optimization interval and their main properties. The closed-loop is fitted with a signal representing the predicted values averaged over the whole sliding interval of optimization with a certain weight. A problem with a sliding optimization interval may not require a real-time solution by means of a sequence of solutions on compressed intervals. Therefore, the study of control systems with optimization on a sliding interval is of undoubted interest for a number of practically important control problems. [ABSTRACT FROM AUTHOR]

Aircraft conflict resolution is one of the major tasks of computer-aided air traffic management and represents a challenging optimization problem. Many models and methods have been proposed to assist trajectory regulation to avoid conflicts. However, the question of testing the different mathematical optimization approaches against each other is still open. Standard benchmarks include unrealistic scenarios in which all the flights move toward a common point or completely random generated instances. There is a lack of a common set of test instances that allows comparison of the available methods under a variety of heterogeneous and representative scenarios. We present a flight deconfliction benchmark generator that allows the user to choose between (i) different predefined scenario inspired by existing benchmarks in the literature; (ii) pseudo-random traffic meeting certain congestion measurements; (iii) and randomly generated traffic. The proposed setting can account for different levels of difficulty in the deconfliction of the aircraft and allows to explore and compare the real limitations of optimization approaches for aircraft conflict resolution. History: Accepted by Ted Ralphs, area editor for Software Tools. Funding: This work was supported by the H2020 Marie Skłodowska-Curie Actions [Grant 764759 ITN "MINOA"]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information (https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.1265) as well as from the IJOC GitHub software repository (https://github.com/INFORMSJoC/2021.0283) at (http://dx.doi.org/10.5281/zenodo.7377734). [ABSTRACT FROM AUTHOR]

This paper proposes a novel optimization method for solving real-world optimization problems. It is inspired by a cooperative human phenomenon named the mountaineering team-based optimization (MTBO) algorithm. Proposed for the first time, the MTBO algorithm is mathematically modeled to achieve a robust optimization algorithm based on the social behavior and human cooperation needed in considering the natural phenomena to reach a mountaintop, which represents the optimal global solution. To solve optimization problems, the proposed MTBO algorithm captures the phases of the regular and guided movement of climbers based on the leader's experience, obstacles against reaching the peak and getting stuck in local optimality, and the coordination and social cooperation of the group to save members from natural hazards. The performance of the MTBO algorithm was tested with 30 known CEC 2014 test functions, as well as on classical engineering design problems, and the results were compared with that of well-known methods. It is shown that the MTBO algorithm is very competitive in comparison with state-of-art metaheuristic methods. The superiority of the proposed MTBO algorithm is further confirmed by statistical validation, as well as the Wilcoxon signed-rank test with advanced optimization algorithms. Compared to the other algorithms, the MTBO algorithm is more robust, easier to implement, exhibits effective optimization performance for a wide range of real-world test functions, and attains faster convergence to optimal global solutions. [ABSTRACT FROM AUTHOR]

Inspired by the bamboo growth process, Chu et al. proposed the Bamboo Forest Growth Optimization (BFGO) algorithm. It incorporates bamboo whip extension and bamboo shoot growth into the optimization process. It can be applied very well to classical engineering problems. However, binary values can only take 0 or 1, and for some binary optimization problems, the standard BFGO is not applicable. This paper firstly proposes a binary version of BFGO, called BBFGO. By analyzing the search space of BFGO under binary conditions, the new curve V-shaped and Taper-shaped transfer function for converting continuous values into binary BFGO is proposed for the first time. A long-mutation strategy with a new mutation approach is presented to solve the algorithmic stagnation problem. Binary BFGO and the long-mutation strategy with a new mutation are tested on 23 benchmark test functions. The experimental results show that binary BFGO achieves better results in solving the optimal values and convergence speed, and the variation strategy can significantly enhance the algorithm's performance. In terms of application, 12 data sets derived from the UCI machine learning repository are selected for feature-selection implementation and compared with the transfer functions used by BGWO-a, BPSO-TVMS and BQUATRE, which demonstrates binary BFGO algorithm's potential to explore the attribute space and choose the most significant features for classification issues. [ABSTRACT FROM AUTHOR]

As the semiconductor manufacturing process is moving towards the 3 nm node, there is a crucial need to reduce the edge placement error (EPE) to ensure proper functioning of the integrated circuit (IC) devices. EPE is the most important metric that quantify the fidelity of fabricated patterns in multi-patterning processes, and it is the combination of overlay errors and critical dimension (CD) errors. Recent advances in machine learning have enabled many new possibilities to improve the performance and efficiency of EPE optimization techniques. In this paper, we conducted a survey of recent research work that applied machine learning/ deep learning techniques for the purposes of enhancing virtual overlay metrology, reducing overlay error, and improving mask optimization methods for EPE reduction. Thorough discussions about the objectives, datasets, input features, models, key findings, and limitations are provided. In general, the results of the review work show a great potential of machine learning techniques in aiding the improvement of EPE in the field of semiconductor manufacturing. [ABSTRACT FROM AUTHOR]

Wildfires are recurrent natural events that have been increasing in frequency and severity in recent decades. They threaten human lives and damage ecosystems and infrastructure, leading to high recovery costs. To address the issue of wildfires, several activities must be managed and coordinated in order to develop a suitable response that is both effective and affordable. This includes actions taken before (mitigation, prevention, and preparedness), during (response), and after the event (recovery). Considering the available resources and the safety of the involved personnel is a key aspect. This article is a review focused on fire suppression, which comprises actions belonging to the preparedness phase (deployment) and the response phase (dispatching) of the wildfire management scheme. It goes through the models and methodologies that, applying operations research and optimization techniques, address the management of resources to address fire suppression. This article presents a review of the studies published after the last review on the topic in 2017, but also includes some interesting papers before that date. It concludes with some classifying tables and a few conclusions about possible future lines of research. [ABSTRACT FROM AUTHOR]

The Ball Mill Abrasion Test (BMAT) is a laboratory experiment used to measure the resistance of materials under high-stress abrasion conditions. This test, however, has yet to be standardized. In this work, statistical theory determines the optimal number of spheres per material to be included in BMAT. This theory and the optimization method presented in this paper show that the optimal number of spheres for the usual experimental conditions is six. Finally, it is shown that if the optimization process is extended over a broader range of experimental conditions, the optimum number of spheres per material is also six. [ABSTRACT FROM AUTHOR]