Search

The wireless network is composed of multiple micronetwork nodes that are difficult to replace. These network nodes are usually located in areas with poor environmental conditions, so the energy consumption and security of nodes have become the main limitations and challenges. Therefore, this paper discusses the network topology, data transmission and node trust mechanism, and proposes a cloud computing technology algorithm for intelligent regional wireless network. According to the data of arrival delay difference in intelligent regional wireless network environment, the approximate location of mobile system is set as different positioning results. The dynamic position of the mobile system is obtained through multiple calculations. With the support of cloud computing technology, this paper also studies the color rendering system of 3D animation. 3D animation can not only express emotions and feelings, but also color render through the facial expressions of characters in the animation, so as to enhance the entertainment and interest visible to the audience. However, due to the great demand for computing resources and color rendering resources, at present, the main research and implementation are carried out on the desktop platform. There are also solutions to use high-end infrared devices for 3D animation color rendering on the mobile system. However, because this method has high cost in use and does not have universality on the mobile device, this paper proposes a rendering system suitable for the general mobile platform. This paper studies the 3D animation color rendering system based on wireless network cloud computing technology, hoping to realize the universality of the system with the support of technology. [ABSTRACT FROM AUTHOR]

Calculus equation is an important tool for mathematical research and plays an important role in most natural science research. Since the beginning of the eighteenth century, people have gradually used differential and integral equations to solve physical problems. In general, several different aspects of differential equations in the field of mathematics are concerned and studied by most scholars. However, this paper studies and establishes the optimal model for numerical solution of differential equations through deep learning and genetic algorithm. In this paper, the solution of ordinary differential equations is solved through the use of polynomial function space, while the linear combination of simple function x and its product nx can obtain multinomial function space. The space function form of polynomial is very simple, and the operation ability is very strong. Almost all functions can be approximated, and the function space can be transformed by a simple function. Through data simulation test results, it can be found that the oscillation of neural network output is stronger and stronger with the increase in depth, that is to say, the deeper depth endows the neural network with stronger oscillation properties, so for the oscillation function, the depth neural network fitting effect is better than the shallow neural network. Therefore, by combining deep learning and genetic algorithm, this paper studies and establishes the optimal model for numerical solution of differential equations, and finds that the deep neural network can largely complete data simulation. [ABSTRACT FROM AUTHOR]

Big data technology has undoubtedly accelerated the efficiency of data processing, made data become an important reference basis in enterprise operation, and changed the mode of enterprise operation as well as the existing business model. With the development of computer technology and related equipment, more and more enterprises and organizations can begin to use big data processing technology. However, many small and medium-sized enterprises, because they cannot afford the high cost of research and development and leasing, are gradually eliminated in the information-based business competition, so it is necessary to adopt certain strategies to help small and medium-sized enterprises out of this crisis. For fragmented big data obtained from different data sources, this paper adopts load-balancing technology to provide horizontal service cluster scalability and designs a separate system module for routine testing. The experimental results show that the improved big data processing system based on genetic algorithm in this paper can better meet the business needs of small and medium-sized enterprises and meet the application needs of small and medium-sized enterprises. The simulation results also show the advantages of the system in this paper, which is faster, higher accuracy, less energy consumption, lower requirements for equipment, and more suitable for small and medium-sized enterprises. This paper designs a kind of effective big data processing system by studying genetic algorithm and computer technology. [ABSTRACT FROM AUTHOR]

This paper presents a new hybrid genetic-particle swarm optimization (GPSO) algorithm for solving multi-constrained optimization problems. This algorithm is different from the traditional GPSO algorithm, which adopts genetic algorithm (GA) and particle swarm optimization (PSO) in series, and it combines PSO and GA through parallel architecture, so as to make full use of the high efficiency of PSO and the global optimization ability of GA. The algorithm takes PSO as the main body and runs PSO at the initial stage of optimization, while GA does not participate in operation. When the global best value (gbest) does not change for successive generations, it is assumed that it falls into local optimum. At this time, GA is used to replace PSO for particle selection, crossover and mutation operations to update particles and help particles jump out of local optimum. In addition, the GPSO adopts adaptive inertia weight, adaptive mutation parameters and multi-point crossover operation between particles and personal best value (pbest) to improve the optimization ability of the algorithm. Finally, this paper uses a nonlinear constraint problem (Himmelblau's nonlinear optimization problem) and three structural optimization problems (pressure vessel design problem, the welded beam design problem and the gear train design problem) as test functions and compares the proposed GPSO with the traditional GPSO, dingo optimization algorithm, whale optimization algorithm and grey wolf optimizer. The performance evaluation of the proposed algorithm is carried out by using the evaluation indexes such as best value, mean value, median value, worst value, standard deviation, operation time and convergence speed. The comparison results show that the proposed GPSO has obvious advantages in finding the optimal value, convergence speed and time overhead. [ABSTRACT FROM AUTHOR]

Efficient resource scheduling is one of the most critical issues for big data centers in clouds to provide continuous services for users. Many existing scheduling schemes based on tasks on virtual machine (VM), pursued either load balancing or migration cost under certain response time or energy efficiency, which cannot meet the true balance of the supply and demand between users and cloud providers. The paper focuses on the following multi-objective optimization problem: how to pay little migration cost as much as possible to keep system load balancing under meeting certain quality of service (QoS) via dynamic VM scheduling between limited physical nodes in a heterogeneous cloud cluster. To make these conflicting objectives coexist, a joint optimization function is designed for an overall evaluation on the basis of a load balancing estimation method, a migration cost estimation method and a QoS estimation method. To optimize the consolidation score, an array mapping and a tree crossover model are introduced, and an improved genetic algorithm (GA) based on them is proposed. Finally, empirical results based on Eucalyptus platform demonstrate the proposed scheme outperforms exiting VM scheduling models. [ABSTRACT FROM AUTHOR]

In the construction of enterprise financial risk prediction model, the obtaining of the optimal solution has a key impact on the prediction effect of the prediction model. Exploring the optimization and improvement of the prediction model to obtain the optimal solution is an urgent problem. In this paper, based on genetic algorithm and data mining technology, a genetic algorithm model based on adaptive improvement is proposed. Through linear adaptive optimization, the optimal solution of complex problems is obtained. When estimating parameters, EM algorithm is used to estimate, so that the final effect of model fusion can reach the expectation. At the same time, it integrates data mining technology, Borderline STATE EasyEnsemble sampling method and SVM intelligent technology to build an optimized comprehensive risk early warning model, which realizes the automatic integration and prediction of financial risks. The adjusted mathematical model is better than the single technical model. This study verified that the prediction ability of the improved model for minority samples has been greatly improved. Under the new method, F1 + F2 + F3 has increased by 14.83% compared with the single F1 feature, and the prediction accuracy of most types of samples has not been reduced. The prediction effect has generally improved. Finally, according to the current situation of enterprise finance, this paper puts forward effective measures to prevent enterprise financial risks. [ABSTRACT FROM AUTHOR]

Meta-syntheses from experts' judgements and quantitative metrics are two main forms of evaluation. But they both have limitations. This paper constructs a framework for mapping the evaluation results between quantitative metrics and experts' judgements such that they may be solved. In this way, the weights of metrics in quantitative evaluation are objectively obtained, and the validity of the results can be testified. Weighted average percentile (WAP) is employed to aggregate different experts' judgements into standard WAP scores. The Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) method is used to map quantitative results into experts' judgements, while WAP scores are equal to the final closeness coefficients generated by the TOPSIS method. However, the closeness coefficients of TOPSIS rely on the weights of quantitative metrics. In this way, the mapping procedure is transformed into an optimization problem, and a genetic algorithm is introduced to search for the best weights. An academic journal ranking in the field of Supply Chain Management and Logistics (SCML) is used to test the validity obtained by mapping results. Four prominent ranking lists from Association of Business Schools, Australian Business Deans Council, German Academic Association for Business Research, and Comité National de la Recherche Scientifique were selected to represent different experts' judgements. Twelve indices including IF, Eigenfactor Score (ES), H-index, Scimago Journal Ranking, and Source Normalized Impact per Paper (SNIP) were chosen for quantitative evaluation. The results reveal that the mapping results possess high validity for the relative error of experts' judgements, the quantitative metrics are 43.4%, and the corresponding best weights are determined in the meantime. Thus, some interesting findings are concluded. First, H-index, Impact Per Publication (IPP), and SNIP play dominant roles in the SCML journal's quality evaluation. Second, all the metrics are positively correlated, although the correlation varies among metrics. For example, ES and NE are perfectly, positively correlated with each other, yet they have the lowest correlation with the other metrics. Metrics such as IF, IFWJ, 5-year IF, and IPP are highly correlated. Third, some highly correlated metrics may perform differently in quality evaluation, such as IPP and 5-year IF. Therefore, when mapping the quantitative metrics and experts' judgements, academic fields should be treated distinctively. [ABSTRACT FROM AUTHOR]

This paper proposes an improved genetic algorithm (IGA) to provide feasible solutions to the technician routing and scheduling problem (TRSP). The TRSP covers the feasible team generation, the assignment of feasible teams to suitable tasks, the proficiency level of workers, routings considering the allowed days, and the skill desire of the task. The paper deals with a five-day multi-period planning horizon, and a task is performed in any one of 5 days. The IGA consists of crossover, mutation, and three neighborhood structures. Mutation and crossover largely try to avoid getting caught in the local solution trap. Three neighborhood structures improve genetic algorithm (GA) by searching for better solutions. Further, the performance of the proposed algorithm is experimentally compared with GA and improved particle swarm optimization (IPSO) algorithm by providing the TRSP solutions on the generated benchmark instances. The numerical results indicate that IGA offers fast and better solutions considering GA and IPSO algorithms. [ABSTRACT FROM AUTHOR]

The fast progress of artificial intelligence (AI) technology has significantly impacted the field of interpretation. Nonetheless, interpretation education at many Chinese schools and universities is poor quality. It strongly emphasizes theory while providing basic content, resulting in minimal pupil growth. Furthermore, existing interpretation assessment procedures must be revaluated to improve comprehensive instructional growth. Aiming at this problem, this paper systematically constructs the Automatic Interpretation Assessment System by integrating key components. Firstly, this paper explains the significance of interpretation as a cognitive bridge between AI and human cognition by emphasizing the critical relevance of interpretability in AI systems. Second, the research explores the intricacies of the internal workings of backpropagation (BP) neural networks. It explains their structural composition, signal propagation processes, and weight adjustment procedures, all of which are strategically employed to enable optimal learning within the context of the model. Third, it integrates genetic algorithms (GA) with BP neural networks in a unique way, combining the optimization capabilities of GA. This collaborative strategy employs selection, crossover, and mutation strategies to improve system performance and create a strong issue-detection feedback mechanism. Finally, utilizing interpretable AI theory, the study methodically creates the Automatic Interpretation Assessment System. This approach has a three-tier paradigm, with careful evaluation criteria including interpreter ability and skill. The requirements include bilingual competence, extra-lingual knowledge, interpreting abilities, professional excellence, and psychological quality. We comprehensively evaluated using essential parameters such as accuracy, precision, recall, F1 score, and execution time. These results demonstrate that our proposed system excels with an accuracy of 95%, a precision of 94%, a recall of 96%, and an F1-score of 0.95, showcasing its superiority over the other systems. These findings highlight our proposed system effectiveness in reliably assessing interpretation quality and efficient processing capabilities. [ABSTRACT FROM AUTHOR]

Music expresses thoughts and emotions in artistic form and is made up of different components including harmony, rhythm, and melody. Several musical elements are tied together during the songwriting process in order to generate melodies that are harmonic. A music melody is the essential element of any music to generate strong feelings from listeners and capture their interest. In the process of music appreciation, melody controls the emotional changes of music. It is an efficiently perceived part and the tone of a song. In recent years, Sichuan unvoiced music has developed rapidly and attracted much attention. This paper selects Sichuan unvoiced music as the main research theme and constructs a melody generation algorithm by utilizing the state-of-the-art techniques of deep learning (DL) and evolutionary algorithms (EAs) such as recurrent neural network-long short-term memory (RNN-LSTM) and genetic algorithm (GA). Firstly, this paper briefly describes the concept of DL algorithms, the deep generation model, and sequence to sequence model, as they constitute the technological foundation for this research. Secondly, this paper proposes a melody generation algorithm that utilizes RNN-LSTM for melody generation and GA for melody optimization. More specifically, the melody is generated by preprocessing data, creating, and training the RNN-LSTM model. A GA was used to determine the melodic fitness function for eight songs as the fitness function directly affects the selected termination condition. The fitness function can be thought of as either a person or an evolutionary rule. Finally, the average score of these songs, before and after evolution, is calculated, which demonstrates that the analysis and rotation creation methods are more precise and that the song's average melody score is higher. The method proposed in this study has been thoroughly compared to the existing approaches proposed in earlier studies, and it was found that the approach we propose is more effective in terms of accuracy and the average melody score. [ABSTRACT FROM AUTHOR]

Accurately predicting the performance in various sports is crucial in comprehending training characteristics and enhancing physical education and training processes. The increasing significance of sports in China has enhanced the interest for developing prediction models to assess athletes' sports performance, accurately. These models will greatly contribute to improving sports performance and implementing scientific training methods. This paper proposes a prediction model for athletes' sports performance using Neural Networks as the underlying framework. This research aims to enhance sports performance and scientific training by developing a reliable and effective prediction model. First, the proposed model utilizes neural network algorithms, including error backpropagation and genetic algorithms, to train and optimize the prediction model. Second, it analyzes temporal patterns, extracts statistical features, and adapts to new data by ensuring reliability and effectiveness of the proposed model. Third, this paper conducts an error analysis by comparing the prediction errors between our proposed method and traditional models to evaluate the accuracy of the prediction model. In addition, this paper conducts an error analysis by comparing the prediction errors between our proposed method and traditional models. Finally, the results demonstrate that our proposed method achieves a maximum error of 36.12%, with the highest error rate in the BP network prediction being 6.76%. Furthermore, we compared our predicted results with multiple linear regression and other existing prediction methods, and our proposed method demonstrated superior accuracy with an overall prediction accuracy of 97.6%. Our suggested solution surpasses previous approaches with much higher accuracy, reduced latency, improved recall, and increased scalability. [ABSTRACT FROM AUTHOR]

The purpose of this paper is to develop and test three meta-heuristic algorithms to solve large size multi-objective supply chain network design problems. The algorithms are based on tabu search, genetic algorithm, and simulated annealing to find near-optimal global solutions. The three algorithms are designed, coded, and tested, and their parameters are fine tuned. The exact ε-constraint algorithm embedded in the General Algebraic Modeling System is used to validate the results of the three algorithms. The algorithms are compared using a typical multi-objective supply chain model utilizing several performance measures. The measures include the mean ideal distance, diversification metric, and percent of domination, inverted generational distance, and computation time. The results show that the tabu search algorithm outperformed the other two algorithms in terms of the percent of domination and computation time. On the other hand, the simulated annealing solutions are the best in terms of their diversity. The work in this paper is expected to help managers to solve large-scale supply chain problems that arise in oil and gas, petrochemical, and food supply chains. [ABSTRACT FROM AUTHOR]

In this paper, a new bi-objective hub facility location problem is studied where the demands of customers are stochastic and follow a normal distribution function. The first objective is to minimize total amount of value at risk which has a new probabilistic criterion and optimizes amount of lost demand. In addition, the second objective minimizes total costs of the network. Furthermore, some constraints are nonlinear in this model and it is aimed to linearize them by efficient approximate procedures. This paper tries to apply three efficient solution procedures to solve the bi-objective model. Thus, three algorithms are $$\varepsilon $$ -constraint, non-dominated sorting genetic algorithm-II (NSGA-II), and multi-objective particle swarm optimizers (MOPSO) which are creativity ways used in this paper to approximate the Pareto-optimal solutions. Taguchi experimental design is used to find the right parameter settings for metaheuristic algorithms. A comparative study of three proposed algorithms demonstrates the most effectiveness algorithm with respect to five existing performance measures for numerous test problems. Finally, the comparison within each two algorithms is completed by applying multiple statistical tests and diagrams. The obtained solutions by MOPSO are better than NSGA-II at 95 % confidence level. [ABSTRACT FROM AUTHOR]

The world population continues to increase which imposes rising demand in agriculture production. How to improve crop breeding to feed the growing population is a significant challenge. The traditional crop breeding is resource-intensive and time-consuming. Predictive modeling on crop yield can speed up the breeding process and make it resource-efficient. In this paper, a genetic algorithm (GA)-assisted deep learning solution method is proposed for the crop yield prediction. The proposed method consists of two phases, i.e., the global search phase and the local search phase. In the global search phase, GA is used to search for the best initial weights of the neural network. In the local search phase, random perturbation is added to avoid the local optimum and vanishing gradient problems. A case study of crop yield prediction is conducted to compare the proposed method and other gradient-based methods. The results show that the proposed method outperforms the gradient-based methods in terms of convergence speed and prediction accuracy. [ABSTRACT FROM AUTHOR]

Complex system optimization is an emerging research topic in the field of evolutionary computation, whose goal is to handle complex systems with multiple coupled subsystems, each including multiple objectives and multiple constraints in real-world applications. This paper proposes a multi-system genetic algorithm (MSGA), stemming from implicit parallelism in population-based search algorithms, to solve multiple coupled subsystems simultaneously in a complex system. The proposed MSGA is composed of within-subsystem evolution and cross-subsystem migration operators. The objective of the former is to optimize each subsystem by appropriate search strategies, and the objective of the latter is to exchange information between multiple subsystems by migration, which is based on the similarity probability of objectives and constraints, and the intersection probability of solutions in different subsystems. During migration across subsystems, three statistical approaches of measuring similarity and three metrics of solution intersection in information theory are used to calculate these probabilities. Performance is tested on a set of multi-subsystem benchmark functions, and the simulation results show that cross-subsystem migration plays the key role for the performance of MSGA. Furthermore, the proposed MSGA is compared with other competitive algorithms, and results show that it is a promising multi-system optimization algorithm. In summary, the contribution of this paper is the introduction of multi-system optimization to the EA community. [ABSTRACT FROM AUTHOR]

This paper proposes a framework for time-efficiently finding multiple answers that meet multiple logical constraints and are Pareto-optimal for multiple objective functions. The proposed framework determines a set of optimal answers by iteratively replacing a set of definite clauses. Clause replacement is performed using a SAT solver consisting of equivalent transformation rules (ETRs). An ETR replaces a definite clause with one or more clauses while preserving the declarative meaning of the union of the original clause and problem clauses. To efficiently find optimal answers, in this paper, we define a new class of ETRs that are generated based on the evaluation results of a multi-objective genetic algorithm (MOGA) and propose a method for generating ETRs that belong to the new class. ETRs belonging to the new class help to replace definite clauses according to user objectives such as cost–benefit performance, reliability, and financial constraints. Thus, a SAT solver that uses the new ETR class in addition to extant ETR classes can preferentially replace definite clauses that produce the optimal answer for user objectives. Experimental results indicate that the proposed framework can significantly reduce the computation time and memory usage necessary to determine a set of optimal answers for user objectives. [ABSTRACT FROM AUTHOR]

An introduction is presented in which the author discusses various topics including the advances in evolutionary computation, fuzzy systems and neural networks, genetic algorithm for solving the many-objective optimization problem and methods for accomplishing annotation tasks using crowdsourcing.

This paper focuses on optimizing the laser cladding process parameters of WC/Inconel 625 composite on a low-carbon steel substrate. This process aims to improve industrial parts' wear and corrosion properties in corrosive and high-temperature environments. Laser power, laser cladding speed, powder-feeding rate, and WC content percentage were process input parameters, each at three levels. The dilution ratio and micro-hardness of samples were considered as process responses. Taguchi orthogonal arrays were employed for experimental design, and the results were analyzed using signal-to-noise ratio and analysis of variance. A linear regression model was developed to understand the relationship between process parameters and responses. In addition, two-objective optimization of the process parameters using the second-generation non-dominated sorting genetic algorithm (NSGA-II), and a hybrid algorithm based on the multi-objective whale optimization algorithm (MOWOAGA) were carried out to determine the optimal parameters that minimize the dilution ratio and maximize the cladding hardness. The results showed that the laser power and the powder-feeding rate have the most excellent effect on the dilution ratio. In contrast, WC content percentage and powder-feeding rate strongly affect micro-hardness. Based on the applied meta-heuristic algorithms and confirmed by experimental tests, the laser power of 370 W, laser cladding speed of 4 mm/s, powder-feeding rate of 8 g/min, and WC content percentage of 20.5% are the most optimal process parameters that lead to micro-hardness of 397 Vickers and dilution percentage of 2.5%. This research guides selecting, controlling, and optimizing WC/Inconel 625 composite laser cladding process parameters. [ABSTRACT FROM AUTHOR]

In this paper, an adaptive genetic algorithm is used to conduct an in-depth study and analysis of English text background elimination, and a corresponding model is designed. The curve results after the initial character editorialization are curved and transformed, and the adaptive genetic algorithm is used for the transformation to solve the influence of multiple inflection points of curve images on feature extraction. Then, using the minimum deviation method, the error values of the input characters and the sample set in the spatial coordinate system are calculated, and the deviation values of the angle and the straight line are used to match the characters with the smallest deviation value to match the highest degree. To enhance identification accuracy, a genetic algorithm is used to iterate the feature sets of angles and line segments, and the optimum features are ultimately generated via cross evolution of generations. The character library is then utilized as an input item for average grouping for trials, and the resulting feature sets are placed in a position matrix and compared one by one to the samples in the database. It is found that the improved stroke-structure feature extraction algorithm based on a genetic algorithm can improve the recognition accuracy and better accomplish the recognition task with better results compared to others. Finally, by analyzing the limitations and characteristics of traditional particle swarm optimization algorithm and differential evolution algorithm, and giving full play to the advantages and applicability of different algorithms, a new differential evolution particle swarm algorithm with better performance and more stable performance is proposed. The algorithm is based on the PSO algorithm, and when the population update of the PSO algorithm is stagnant and the search space is limited, the crossover and mutation operations of the DE algorithm are used to perturb the population, increase the diversity of the population, and improve the global optimization ability of the algorithm. The algorithm is tested on a common dataset for text mining to verify the effectiveness and feasibility of the algorithm. [ABSTRACT FROM AUTHOR]

The multi-objective design of suspension system for multi-axle heavy goods vehicle (HGV) is presented in this paper. Minimum road damage and goods damage are taken as design criteria for design. The objective function and constraint calculation in suspension design involve dynamic responses of the vehicle that has a high computational cost. Hence, a hybrid genetic algorithm (GA) is proposed for fast convergence. Proposed hybrid GA is designed using the selection method of two different genetic algorithms, i.e. non-dominated sorting genetic algorithm II (NSGA-II) and 2-objective geometry inspired genetic algorithm (2GIGA). Proposed hybrid GA is tested for different benchmarking optimization problems along with suspension optimization problems. Two types of suspension systems, passive and semi-active suspensions, are designed. A semi-active suspension system design involves designing a controller for a controllable damper along with passive elements. An improvised control law using a proportional integral derivative (PID) controller is used for the semi-active suspension system of multi-axle HGV. This control law is designed in such a way that it will eliminate the need for a passive damper in a semi-active suspension system. Results of the proposed hybrid GA are compared with the NSGA-II and 2GIGA. The proposed hybrid GA is performing better and saves significant computational cost for the suspension design of HGV. [ABSTRACT FROM AUTHOR]

Most genetic operators use random mating selection strategy and fixed rate crossover operator to solve various optimization problems. In order to improve the convergence and diversity of the algorithm, an adaptive adjacent maximum distance crossover operator is proposed in this paper. A new mating selection strategy (distance-based mating selection strategy) and an adaptive mechanism (adaptive crossover strategy based on population convergence) are adopted. Distance-based mating selection strategy purposefully selects parents to produce better offspring. Adaptive crossover strategy based on population convergence increases the convergence speed of the algorithm by controlling the crossover probability. The proposed crossover strategy is evaluated on the simulated binary crossover operators of non-dominated sorting genetic algorithm II and multi-objective evolutionary algorithm based on decomposition. The performance of the algorithm is verified on a series of standard test problems. Finally, the optimization results of the improved algorithm using adaptive adjacent maximum distance crossover operator and the standard algorithm are compared and analyzed. The experimental results show that the algorithm using adaptive adjacent maximum distance crossover operator has better optimization results. [ABSTRACT FROM AUTHOR]

As natural disasters often cause catastrophic damages, disaster management must be considered. Relief logistics planning in disaster management is a dynamic process that includes deliberate processes taken before and after a disaster. This paper presents a robust optimization model for relief logistics planning covering before and after disaster actions to minimize the total cost. In this model, demand and traveling time between nodes are non-deterministic parameters, and scenario-based robust optimization is applied to handle uncertainty. The model is an integrated multi-echelon, multi-period, and multi-commodity vehicle routing problem considering the fair distribution of goods and services in a way that social costs are minimized. Vehicles can enter nodes and exit them several times. In this paper, a genetic algorithm (GA) is considered the solution approach. To estimate the GA parameters, an experimental design based on the Taguchi method is considered. A roulette wheel method is applied to select a child from parents for the next generation. Single-point crossover and swap mutation operators are used to generate the new child. Test problems in different scales are generated and solved using GAMS and GA. The results indicate that GA solutions have 3.75% gaps in average with optimal solutions. Finally, the model is applied with the data of a real case (Tehran). The results also indicate that it is better to consider the appropriate capacity for supply centers and distributors and select vehicles. [ABSTRACT FROM AUTHOR]

In this paper, a new U-shaped assembly line balancing problem is studied. For the first time, the criteria such as equipment cost, number of stations and activity performing quality level are considered to be optimized simultaneously by activity to station and worker to station decisions. For this aim, a multi-objective nonlinear formulation is proposed and its linearized version is also presented. Since, according to the literature, the U-shaped assembly line balancing problem with equipment requirements is an NP-hard problem, the problem of this study is NP-hard too. Because of this complexity, the classical algorithms like simulated annealing, variable neighborhood search, and classical genetic algorithm with a novel encoding/decoding scheme are used as solution approaches. As an extension, two hybrid versions of the proposed classical algorithms are proposed according to the characteristics of the problem. In order to evaluate the proposed meta-heuristics, because the problem is new, some test problems are generated randomly. Computational study of the paper, including sensitivity analysis of the proposed meta-heuristics and final experiments on the test problems, proves the superiority of the hybrid versions of the classical algorithms. [ABSTRACT FROM AUTHOR]

In the ensemble feature selection method, if the weight adjustment is performed on each feature subset used, the ensemble effect can be significantly different; therefore, how to find the optimized weight vector is a key and challenging problem. Aiming at this optimization problem, this paper proposes an ensemble feature selection approach based on genetic algorithm (EFS-BGA). After each base feature selector generates a feature subset, the EFS-BGA method obtains the optimized weight of each feature subset through genetic algorithm, which is different from traditional genetic algorithm directly processing single features. We divide the EFS-BGA algorithm into two types. The first is a complete ensemble feature selection method; based on the first, we further propose the selective EFS-BGA model. After that, through mathematical analysis, we theoretically explain why weight adjustment is an optimization problem and how to optimize. Finally, through the comparative experiments on multiple data sets, the advantages of the EFS-BGA algorithm in this paper over the previous ensemble feature selection algorithms are explained in practice. [ABSTRACT FROM AUTHOR]

This paper proposes a Stackelberg game approach to maximize the profit of the electricity retailer (utility company) and minimize the payment bills of its customers. The electricity retailer determines the retail price through the proposed smart energy pricing scheme to optimally adjust the real-time pricing with the aim to maximize its profit. The price information is sent to the customers through a smart meter. According to the announced price, the customers can automatically manage the energy use of appliances in the households by the proposed optimal electricity consumption scheduling system with the aim to minimize their electricity bills. We model the interactions between the retailer and its electricity customers as a 1-leader, N-follower Stackelberg game. At the leader’s side, i.e., for the retailer, we adopt genetic algorithms to maximize its profit while at the followers’ side, i.e., for customers, we develop an analytical solution to the linear programming problem to minimize their bills. Simulation results show that the proposed approach is beneficial for both the customers and the retailer. [ABSTRACT FROM AUTHOR]

This paper addresses the multi-objective optimization of water–rail–road (WRR) intermodal transport system under uncertainty by explicitly capturing intermodal hub operation activities. Through the use of hub-and-spoke-type network, we formulate an uncertain multi-objective programming model for the WRR intermodal transportation network design problem, in which the cost, time and reliability objectives are simultaneously considered. Subsequently, we turn the original model into a deterministic equivalent multi-objective programming model under mild assumptions. Eventually, we utilize the ε -constraint method to reformulate the crisp multi-objective programming model to a modified mono objective one, which has proven to be NP-hard. Hence, we develop a memetic algorithm (MA) by combining a genetic algorithm and local intensification to solve the proposed problem. When designing the MA, we propose a combination encoding scheme to represent the location of intermodal hubs, the allocation of the demand nodes and the assignment of transportation modes. Moreover, we provide two local intensification operators to enhance exploitation ability. Finally, we implement a series of numerical experiments based on the Turkish network data set to verify the practicability of the proposed model and effectiveness of the solution approach developed in the paper. [ABSTRACT FROM AUTHOR]

In collaborative logistics network, all task demands are centralized by logistics platform for resource allocation, and then resource owners execute discretely under final plan. The key point of this study is to effectively balance the different appeals of stakeholders. In this paper, a bi-level programming model is presented to solve multi-deport LRP considered the constraint of hard time window, vehicle capacity and vehicle backhaul cost, which aims at achieving the effective interest coordination between upper layer platform and lower layer vehicle owners. To solve this bi-level model, genetic algorithm is redesigned according to this specific situation. Optimal results of simulation sample show that the satisfied solution for both platform and vehicle owners could be obtained using this method. Feasibility and validity of this model and adaptive algorithm have been verified in the paper. The bi-level model provides a practical and effective method to solve the profit distribution problem between platform and vehicle owners. [ABSTRACT FROM AUTHOR]

Students' performance prediction systems play a vital role in enhancing the educational performance inside universities, schools, and training centers. Big data can come from different resources such as examination centers, virtual courses, registration departments, e-learning systems. Extracting meaningful knowledge from educational data is a complex task, so reducing the data dimensionality is needed. In this paper, we proposed an enhanced binary genetic algorithm (EBGA) as a wrapper feature selection algorithm. Novel hybrid selection mechanism based on a k-means algorithm and electromagnetic-like mechanism (EM) method is proposed. K-means will cluster the population into a set of clusters, while EM will determine a value called a total force (TF) for each solution. Each cluster has an accumulated total force (ATF) (i.e., adding all TFs together). Selection process will select two solutions with the highest TF from the cluster, which has the highest ATF. We employed a hybrid machine learning approach between the proposed EBGA and five different classifiers (i.e., k-Nearest Neighbors (k-NN), Decision Trees (DT), Naive Bayes (NB), Support Vector Machine (SVM), and Linear Discriminant Analysis (LDA)). Two real case studies obtained from UCI Machine Learning Repository are used in this paper. Obtained results showed the ability of the proposed approach to enhance the performance of the binary genetic algorithm. Moreover, the performances of all classifiers are improved between 1 % and 11 % . [ABSTRACT FROM AUTHOR]

In this paper, we propose a method for solving the system of fuzzy relation equations (SFRE) with extended max–min composition for inverse inference problems. The properties of interval and constrained solutions with granular and relational structure of the solution set are investigated. The extended max–min SFRE can be represented in the form of the max–min subsystems aggregated using the min operator or dual min–max subsystems aggregated using the max operator. When decomposing the SFRE, the set of solutions can be decomposed into the lower and upper subsets bounded by the same aggregating solutions. Each lower (upper) subset is defined by the unique greatest (least) or aggregating solution and the set of minimal (maximal) solutions. Following Bartl et al. (Fuzzy Sets Syst 187:103–112, 2012), to avoid excessive granularity and ensure interpretability of the interval solutions when restoring causes through observed effects, the constraints in the form of linguistic modifiers are imposed on the measures of causes significances. The interval solutions are modeled by the complete crisp solutions, that is, the maximum solutions for the vectors of binary weights of the linguistic modifiers. The search for approximate solutions of the SFRE amounts to solving the optimization problem using the genetic algorithm. Due to the properties of the solution set, the genetic search for the lower and upper subsets is parallelized for each aggregating solution. The developed method makes it possible to simplify the search for the solution set based on the constraints on accuracy (interpretability) of the applied problem. [ABSTRACT FROM AUTHOR]

The influence of distributed generation sources in the Islanded microgrid has adverse effects on frequency stability because of the absence of inertia. Accordingly, the concept of a virtual synchronous generator (VSG) has been proposed, which follows the behavior of conventional synchronous generators. The virtual inertia control can be implemented on energy storage systems (ESSs) as a part of a virtual synchronous generator. Virtual inertial control does not perform optimally against the uncertainty of islanded microgrid parameters and disturbances. Therefore, virtual inertial control requires a supplementary controller in its structure that is resistant to these effects. In this paper, a new robust output feedback control method was used to control the virtual inertia in a two-area microgrid, which is based on the linear matrix inequality. The proposed control method does not need to measure all modes and only uses the output feedback. We compared the results of the proposed controller for controlling the virtual inertia in multiple different scenarios by considering the uncertainty of the two-area microgrid parameters as well as disturbances applied to the microgrid with the virtual inertia control based on optimized PI controllers (genetic algorithm), no controller (virtual inertia), and without considering virtual inertia (conventional methods). Accordingly, the effectiveness of the proposed method was demonstrated in terms of response speed, reduction of the frequency deviations and tie-line power deviations, robustness against parameters' uncertainty, and disturbances occurring to the two-area microgrid. [ABSTRACT FROM AUTHOR]

The transportation problems, which consist of multiple objectives with heterogeneous conveyances, are the pragmatic representation of the transportation occurring in the real world. However, situations do exist where the solutions obtained by the classical optimization techniques do not reflect the acumen of the decision-maker. Against this backdrop, a systematic algorithm is proposed in this paper to generate an initial population to tackle the multi-objective solid transportation problem efficiently. In addition, the non-dominated sorting genetic algorithm (NSGA) III is carried out to acquire solutions that can demonstrate the varying degrees of objectives. Furthermore, two problems of different sizes are framed, and their performance is compared via NSGA II, hybrid genetic algorithm, and fuzzy programming technique. [ABSTRACT FROM AUTHOR]

This paper presents an evolutionary approach-based solution of multi-objective transportation-p-facility location problem (MOT-p-FLP) that minimizes overall transportation time, cost of transportation, and carbon emission (CE) from available sites to facility sites by seeking transported product quantities and the facility locations in the Euclidean plane. Genetic algorithm (GA), non-dominated sorting genetic algorithm (NSGA-II and NSGA-III), and modified Self-Adaptive Multi-Population Elitism Jaya Algorithm (SAMPE JA) are utilized to solve the problem. We compared obtained compromise solutions of the problem by evolutionary algorithms with population size, the maximum number of generations, crossover probability, mutation probability, and computational time. Sensitivity analysis for supply, demand, and carbon cap parameters is incorporated in the model's solution, which helps the decision maker make the appropriate decision. These evolutionary algorithms (NSGA-II and NSGA-III) give Pareto-optimal solutions, and it helps management decide on the selection of p-facility locations. They could transport their product to the facility locations easily, with minimum transport, CE costs, and transportation time. As a result, management can give equal attention to their profit and environment, which helps to build world market credibility. At last, the paper concludes the results. [ABSTRACT FROM AUTHOR]

Developing fault diagnosis for the cooling dehumidifier is very important for improving the equipment reliability and saving energy consumption. This paper mainly studies and explores the compound fault diagnosis for the cooling dehumidifier. Firstly, the dehumidifier data acquisition system is built, which can be applied to the data acquisition, work status simulation and fault diagnosis. Secondly, a compound fault diagnosis model based on radial basis function neural network (RBFNN) improved by kernel principle component analysis (KPCA) and adaptive genetic algorithm (AGA) is proposed. Aiming at the problems that the selection of RBF width depends on expert experience and knowledge, the network structure scale is large or the training speed is slow in the conventional RBFNN models; on the one hand, AGA and K-means clustering algorithm are employed to automatically optimize the RBF width, the number of hidden layer neurons and the neuron centers, which guarantees the model has small structure and fast running speed on the premise of sufficient output precision, and the local optimization problem of K-means clustering algorithm is well suppressed by AGA group calculation; this also ensures the performance of RBFNN; on the other hand, KPCA is employed to reduce the dimension of the model input data, which not only effectively extract the nonlinear features, but also further simplify the network structure. Finally, the proposed method is validated and compared with the conventional models. The results show that this proposed model can not only be effectively applied to the dehumidifier compound fault diagnosis, but also has prominent application advantages. [ABSTRACT FROM AUTHOR]

An introduction to the journal is presented in which the guest editors discuss various reports within the issue on topics related to evolutionary learning and optimisation including particle swarm optimization (PSO), cellular genetic algorithms, and dynamic combinatorial optimisation.

Feature selection and instance selection are two data preprocessing methods widely used in data mining and pattern recognition. The main goal is to reduce the computational cost of many learning tasks. Recently, joint feature and instance selection has been approached by solving some global optimization problems using meta-heuristics. This approach is not only computationally expensive, but also does not exploit the fact that the data usually have a structured manifold implicitly hidden in the data and its labels. In this paper, we address joint feature and instance selection using scores derived from discriminant analysis theory. We present three approaches for joint feature and instance selection. The first scheme is a wrapper technique, while the other two schemes are filtering techniques. In the filtering approaches, the search process uses a genetic algorithm where the evaluation criterion is mainly given by the discriminant analysis score. This score depends simultaneously on the feature subset candidate and the best corresponding subset of instances. Thus, the best feature subset and the best instances are determined by finding the best score. The performance of the proposed approaches is quantified and studied using image classification with Nearest Neighbor and Support Vector Machine Classifiers. Experiments are conducted on five public image datasets. We compare the performance of our proposed methods with several state-of-the-art methods. The experiments performed show the superiority of the proposed methods over several baseline methods. [ABSTRACT FROM AUTHOR]

Recommender system plays an increasingly important role in identifying the individual's preference and accordingly makes a personalized recommendation. Matrix factorization is currently the most popular model-based collaborative filtering (CF) method that achieves high recommendation accuracy. However, similarity computation hinders the development of CF-based recommendation systems. Preference obtained only depends on the explicit rating without considering the implicit content feature, which is the root cause of preference bias. In this paper, the content feature of items described by fuzzy sets is integrated into the similarity computation, which helps to improve the accuracy of user preference modeling. The importance of a user is then defined according to preferences, which serves as a baseline standards of the core users selection. Furthermore, core users based matrix factorization model (CU-FHR) is established, then genetic algorithm is used to predict the missing rating on items. Finally, MovieLens is used to test the performance of our proposed method. Experiments show CU-FHR achieves better accuracy in prediction compared with the other recommendation methods. [ABSTRACT FROM AUTHOR]

This paper proposes a novel fault detection system by the combination of Support Vector Data Description and Squirrel Search Algorithm. This approach is capable to deal with processes or machines where the number of fault observations is small or not even available for training phase. In this work the use of classic Support Vector Data Description as well as its fast version with two kernel functions is proposed. The experimental results showed that the proposed system exhibits suitable capabilities for fault detection in complex industrial processes such as the one presented in this research. Moreover, a nonparametric statistical analysis is also included in order to compare the considered strategies and enhance the efficiency of the presented approach. Finally, a comparison with genetic algorithm approach and the one-class classifier based on support vectors is carried out which shows that the proposed algorithm outperforms traditional techniques. [ABSTRACT FROM AUTHOR]

Rescheduling-based congestion management schemes are prominent solutions for secure and reliable power flow under deregulated environment. Since the rescheduling process exhibits multimodal behavior by nature, the role of heuristic methods has become crucial. Despite numerous heuristic search algorithms are reported in the literature to address the challenge, this paper attempts to improve Particle Swarm Optimization (PSO), which is a renowned swarm intelligence-based optimization algorithm. Our improved version of PSO intends to determine adaptive acceleration constants based on the particle position and the evaluation it has undergone till the current iteration. Due to the distributed nature of acceleration constant, this paper calls the proposed PSO as PSO with distributed acceleration constant (PSODAC). PSODAC attempts to solve the rescheduling problem in a hybrid electricity market so that congestion is aimed to minimize at best rescheduling cost. An experimental investigation is carried out in IEEE14 bus system under single point as well as multipoint congestion scenarios. Subsequently, the dynamics of the particles are also investigated. The experimental results show that PSODAC is better than PSO in terms of cost-effective congestion mitigation as well as exhibiting high particle dynamics. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of locating vehicle-identification sensors along the arcs of the transportation network. The aim is to estimate the traffic volumes for a given set of routes under the assumption that the available sensors are insufficient to uniquely identify all route flows. We present a novel mixed-integer linear programming (MILP) model to determine the sensor locations so that in the system of linear equations solved in the path reconstruction phase, those routes whose volume cannot be uniquely determined, are linked to each other by equations involving a small number of unknowns. By this approach, experts' opinions or historical information can be used to give a more precise estimation for those routes whose volumes are not uniquely observable. Since the direct resolution of the model via MILP solvers is time-consuming over moderate- and large-sized instances, by utilizing the problem structure, a genetic algorithm is adopted to find high-quality solutions to the model. Computational experiments over different instances, taken from the literature, confirm the effectiveness of the proposed model and algorithm. [ABSTRACT FROM AUTHOR]

Product Portfolio Planning (PPP) is one of the most critical decisions for companies to gain an edge in the competitive market. It seeks for the optimal combination of products and attribute levels offered for customers in the target market, which is a NP-hard combinatorial optimization problem. In this paper, a Probability-based Discrete Particle Swarm Optimization (PDPSO) algorithm is proposed to solve the PPP problem. In PDPSO, the particle is encoded as discrete values, which can be straightforwardly used to represent the product portfolio with discrete attributes. PDPSO adopts a probability-based mechanism to update particles. Specifically, a probability vector is used to decide the probability of three search behaviors, i.e., learning from the personal best position, global best position, or random search. In experiments, the search performance of PDPSO has been compared with that of a Genetic Algorithm (GA) and a Simulated Annealing (SA) algorithm on generated PPP problem cases with different sizes. The results indicate that PDPSO obtains significantly better optimization results than GA and SA in most cases and obtains desirable/near-optimal solutions on various PPP problem cases. A case study of notebook computer portfolio planning is also presented to illustrate the efficiency and effectiveness of PDPSO. [ABSTRACT FROM AUTHOR]

Advancements in technology have led to a significant growth of agricultural data. The potential for forecasting crop yield depends on parameters such as climate, soil characteristics, and water factors has emerged as significant research area. Combining a comprehensive dataset from diverse sources like climate, soil and water parameters for precise time series forecasting in agricultural yield prediction is a significant challenge. Therefore, there is a need to integrate this data with agricultural processes to enhance crop production. In this paper, propose Genetic Algorithm based Autoregressive Integrated Moving Average (ARIMA) and Reinforced Random Forest Algorithm forecasting models for enhancing crop yield prediction. The genetic algorithm emulates the evolutionary process, simulating the selection of the strongest individuals over weaker ones through mechanisms such as selection, crossover, and mutation. The new approach incorporates reinforcement learning during the selection of attributes for tree construction by optimizing sample usage. By assessing variable significance, it identifies the most significant variables for node splitting improving model development and maximizing training data utilization. In addition to internal cross-validation, the method minimizes parameter tuning, mitigates overfitting, accelerates computations, and enhances transparency. The proposed model Genetic Algorithm based ARIMA achieves better results for enhancing crop yield forecasting on evaluation metrics, i.e., MAE (0.80%), RMSE (3.75%), RRSE (1.21%), RAE (0.82%), MSE (0.07%), R2 (0.54%) and accuracy (80.00%). For Reinforced Random Forest Algorithm model, i.e. MAE (1.28%), RMSE (2.48%), RRSE (0.54%), RAE (0.91%), MSE (0.55%), R2 (0.98%) and accuracy (78.00%). The analysis reveals that the genetic algorithm based ARIMA model outperforms the reinforced random forest algorithm in terms of efficiency and accuracy. Both proposed models better perform than machine learning classical models excelling not only in enhanced crop yield forecasting but also in terms of computational efficiency. [ABSTRACT FROM AUTHOR]

Enhancing the financial ecosystem encourages financial reform, stability, and the achievement of all-encompassing and sustainable development. Financial risk assessment is essential, because it affects not only a company's development but also the general economic progress of society. The backpropagation neural network (BPNN) was used in this study to create a proactive financial risk pre-alarm system by recognizing the critical role that risk assessment plays in promoting financial reform, stability, and sustainable development within the financial ecosystem. In this paper, we utilized the capabilities of the backpropagation neural network (BPNN) as a way of creating a proactive financial risk pre-alarm system by realizing the crucial significance of risk assessment in supporting financial reform, stability, and sustainable development within the financial ecosystem. First, data on assessing financial risk is collected, including earnings reports, economic indicators, political developments that have an impact on the economy, and some previous financial data. After the data have been acquired, it is preprocessed by being cleaned, having extra attributes removed, missing values removed, and normalized. An initial set of random parameters is used to create a BPNN architecture, which is then trained using a fraction of the collected data. Next, a genetic algorithm is employed to optimize the parameters of BPNN, including learning rate, neuronal count, hidden layer count, etc. The remaining data from the collection is then used to test the optimized BPNN, and its performance is assessed. The result of the developed model is carefully assessed and compared with other methodologies and with previously published works, showing that this method's accuracy is unquestionably superior to that of the other financial risk analysis algorithms. The mistake is reduced by 45.69%, and our model's accuracy is 97.94%, which is 21.32% greater than the accuracy of the comparison algorithm. [ABSTRACT FROM AUTHOR]

This paper addresses an integrated material flow optimization problem of cross-docking satellites, in which the transportation problem, the truck-door assignment problem with material placement plans, and the two-dimensional truck loading problem are taken into account. The study aims to find the best distribution and operational plans for the cross-docking satellites to minimize the total transportation cost of the materials. To solve the considered problem, a hybrid genetic algorithm (HGA) is developed, which integrates simulated annealing (SA) algorithm within a genetic algorithm (GA). In this way, a new individual with a low solution quality is rejected by using the stochastic solution acceptance feature of the SA. Moreover, the HGA is enhanced with an advanced two-dimensional loading-check procedure and a rule-based material placement procedure to obtain efficient solutions. The proposed loading-check procedure reduces the processing time of the HGA by avoiding duplicate examinations for the truck loading plans. Likewise, the rule-based material placement procedure prevents unnecessary searches for the assignment plans of the products in a temporary storage area. In computational studies, the performance of the HGA is tested on two different problem sets by comparing HGA with the SA and GA. Furthermore, the HGA is applied to a problem set that is formed by using real-life data of a logistics company. The computational results show that the HGA introduces effective solutions and outperforms both the SA and GA. In addition, the results of the real-life application denote that the HGA can be employed to find effective material flow plans in real situations of cross-docking operations. [ABSTRACT FROM AUTHOR]

Evolutionary multi-objective optimization is a field that has experienced a rapid growth in the last two decades. Although an important number of new multi-objective evolutionary algorithms have been designed and implemented by the scientific community, the popular Non-Dominated Sorting Genetic Algorithm (NSGA-II) remains as a widely used baseline for algorithm performance comparison purposes and applied to different engineering problems. Since every evolutionary algorithm needs several parameters to be set up in order to operate, parameter control constitutes a crucial task for obtaining an effective and efficient performance in its execution. However, despite the advancements in parameter control for evolutionary algorithms, NSGA-II has been mainly used in the literature with fine-tuned static parameters. This paper introduces a novel and computationally lightweight self-adaptation mechanism for controlling the distribution index parameter of the polynomial mutation operator usually employed by NSGA-II in particular and by multi-objective evolutionary algorithms in general. Additionally, the classical NSGA-II using polynomial mutation with a static distribution index is compared with this new version utilizing a self-adapted parameter. The experiments carried out over twenty-five benchmark problems show that the proposed modified NSGA-II with a self-adaptive mutator outperforms its static counterpart in more than 75% of the problems using three quality metrics (hypervolume, generalized spread, and modified inverted generational distance). [ABSTRACT FROM AUTHOR]

Under the retailing environment, shelf space-based competition between items with different brands has drawn much attention from practitioners and researchers, the decision for low-temperature stored items on limited shelf spaces are compounding this challenge. This paper discusses the shelf display space partition assignment decision for low-temperature dairy items with two-phase demand in remaining shelf-life to maximize the profit of the shelf. Two-phase demand is assumed for the first time based on the knowledge that consumers' perception on the quality of the dairy item is unequal to its true shelf-life. Moreover, considering shelf partitions in different heights carry different sale gaining potentials, three profit weights are given to the partitions. Herein, a new research model named as SPSPA of shelf profit space partition assignment for the low-temperature stored dairy items is constructed. To effectively solve the proposed SPSPA, a hybrid firefly particle swarm optimization (HFPSO) is developed combing the superiority of particle swarm optimization (PSO) in coarse search and firefly algorithm (FA) in fine search. Numerical experiments have been performed on small- and large-scale cases to verify the performance of the proposed HFPSO algorithm by comparing with genetic algorithm, differential evolution (DE), PSO, and FA based on which management insights are obtained for the shelf space assignment decision. [ABSTRACT FROM AUTHOR]

This paper addresses a sustainable cement supply chain network problem for an Indian city (Srinagar). The major problem addressed in this research is the dilemma of several sites and selecting sites to set up distribution centers and retail centers for cement supply chain networks. The primary goal of this research work is to focus on sustainable product delivery to clients, which leads us to the topic of facility site selection. The quality of a facility's location has a direct impact on the company's output and operations. As a result, businesses need to develop scientific and effective methodologies for assessing facility location issues and making informed decisions. The conundrum of several sites and picking places to set up distribution centers and retail centers for cement supply chain networks is the key challenge addressed in this research. This research focuses on the current state of the location problem, with an emphasis on the mathematical model and a genetic algorithm in the analysis and analytical approach of the location problem. In this regard, a sustainable supply chain network model has been developed. A real-coded genetic algorithm-based solution approach has been developed for optimizing the sustainable supply chain network design for Srinagar city. Using the input data as a search space for the solving procedure, the resulting solution will provide us with the ideal site selection points. A model for a long-term supply chain network has been established in this regard. For optimizing the sustainable supply chain network architecture for Srinagar city, a real-coded genetic algorithm-based solution strategy has been created. A real-life case study of a cement supply chain network has been considered for validation of the proposed model. [ABSTRACT FROM AUTHOR]

The operational law proposed by Zhou et al. (J Intell Fuzzy Syst 30(1): 71–87, 2016) contributes to developing fuzzy arithmetic, while its applicable conditions are confined to strictly monotone functions and regular LR fuzzy numbers, which are hindering their operational law from dealing with more general cases, such as problems formulated as monotone functions and problems with fuzzy variables represented as fuzzy intervals (e.g., trapezoidal fuzzy numbers). In order to handle such cases we generalize the operational law of Zhou et al. in both the monotonicity of function and fuzzy variables in this paper and then apply the extensive operational law to the cases with monotone (but not necessarily strictly monotone) functions with regard to regular LR fuzzy intervals (LR-FIs) (of which regular LR fuzzy numbers are special cases). Specifically, we derive the computational formulae for expected values (EVs) of LR-FIs and monotone functions with regard to regular LR-FIs, respectively. On the other hand, we develop a solution scheme to dispose of fuzzy optimization problems with regular LR-FIs, in which a fuzzy programming is converted to a deterministic equivalent one and a newly devised solution algorithm is utilized to get the deterministic programming solved. The numerical experiments are conducted using our proposed solution scheme and the traditional fuzzy simulation-based genetic algorithm in the context of a purchasing planning problem. Computational results show that our method is much more efficient, yielding high-quality solutions. [ABSTRACT FROM AUTHOR]

The objective of a fixed-cost transportation problem (FCTP) is to minimize the total transportation cost (or to maximize the total profit). FCTPs become more complex due to the presence of uncertain factors like suppliers' capacity, customers' demand, fixed cost and amount of goods transported. In order to deal with its complexity, three mathematical models, namely the expected value, chance-constrained and measure chance models, are basically available in the literature. This paper aims to solve the crisp equivalent models of an uncertain two-echelon FCTP by employing a robust hybrid evolutionary algorithm. The framework of the designed algorithm comprises of parameter-free Jaya algorithm and the efficient quadratic approximation operator. Initially, its efficiency is validated on the 24 constrained benchmark functions from CEC 2006 (Liang et al. in Problem definitions and evaluation criteria for the CEC 2006 special session on constrained real-parameter optimization, 2006) and 30 unconstrained benchmark functions (Rao in Int J Ind Eng Comput 7:19–34, 2016). Friedman rank test and Iman–Davenport test are conducted for both constrained and unconstrained test instances. Additionally, five real-life engineering design problems are solved to further analyze the flexibility of the proposed algorithm. The computational results and convergence graphs justify the robustness of the designed algorithm over state-of-the-art algorithms. Finally, its application is demonstrated on chance-constrained and measure chance two-echelon FCTP models. Near-optimal results are contradicted by genetic algorithm and particle swarm optimization in solving both these models. Further, a few large-scale instances of FCTP are solved by the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, an enhanced version of the salp swarm algorithm (SSA) for global optimization problems was developed. Two improvements have been proposed: (i) Diversification of the SSA population referred as SSA std , (ii) SSA parameters are tuned using a self-adaptive technique-based genetic algorithm (GA) referred as SSA G A - t u n e r . The novelty of developing a self-adaptive SSA is to enhance its performance through balancing search exploration and exploitation. The enhanced SSA versions are evaluated using twelve benchmark functions. The diversified population of SSA std enhances convergence behavior, and self-adaptive parameter tuning of SSA G A - t u n e r improves the convergence behavior as well, thus improving performance. The comparative evaluation against nine well-established methods shows the superiority of the proposed SSA versions. The enhancement amount in accuracy was between 2.97 and 99% among all versions of algorithm. In a nutshell, the proposed SSA version shows a powerful enhancement that can be applied to a wide range of optimization problems. [ABSTRACT FROM AUTHOR]

Grasshopper optimization algorithm (GOA) is one of the promising optimization algorithms for optimization problems. However, it has the main drawback of trapping into a local minimum, which causes slow convergence or inability to detect a solution. Several modifications and combinations were suggested to overcome this problem. This paper presents a modified grasshopper optimization algorithm (MGOA)-based genetic algorithm to overcome this problem. Modifications rely on certain mathematical assumptions and varying the domain of the control parameter, Cmax, to escape from the local minimum and move the search process to an improved point. Parameter C is one of the essential parameters in GOA, where it balances the exploration and exploitation of the search space. These modifications aim to speed up the convergence rate by reducing the repeated solutions and the number of iterations. Both the original GOA and the proposed algorithms are tested with 19 main test functions to investigate the influence of the proposed modifications. In addition, the algorithm will be applied to solve five different cases of nonlinear systems with different types of dimensions and regularity to show the reliability and efficiency of the proposed algorithm. Promising results are achieved compared to the original GOA. The proposed approach shows an average percentage of improvement of 96.18 as illustrated in the detailed results. [ABSTRACT FROM AUTHOR]