Search

Most existing evolutionary algorithms encounter difficulties in dealing with multi-objective problems (MOPs) whose Pareto optimal solutions are sparse, especially when the decision space of the MOP is large. Most existing sparse evolutionary algorithms (EAs) lack the tricks specially for large-scale problems, and the existing tricks need some grouping/variable analysis methods to divide the large-scale variables, which severely affects the effect of optimization. To fill this gap, an evolutionary algorithm based on rank-1 approximation, suitable to reduce the dimensionality of sparse higher-order datasets, is proposed. First, canonical polyadic decomposition is introduced to divide the higher-dimensional set of decision variables into several lower-dimensional sub-sets. These sub-populations are alternatively optimized by a sparse evolution algorithm with special genetic strategies, to search for improved solutions in their respective lower-dimensional decision sub-space. Finally, the whole population is asymptotically optimized by all the sub-populations. The proposed algorithm first introduces the rank-1 approximation into the dimensionality reduction in sparse large-scale variables, combines it with the sparse EA, and proposes efficient alternative optimization strategy to solve the non-convex problem resulted from the multiple sub-problems. It is compared with other state-of-the-art algorithms for large-scale and sparse problems. The experimental results indicate that it outperforms other algorithms in terms of optimization performance and convergence rate. [ABSTRACT FROM AUTHOR]

Meta-heuristics have been successfully applied to many complex optimization problems. One of the main reasons for its success is its ability to handle non-convex, nonlinear, multimodal, multi-variable, and multi-objective problems with easy implementation. However, the quality of the response of these algorithms to an optimization problem is highly susceptible to the control parameters, and few works aim to tune them or find tools that can improve the algorithms. The literature is rich in proposals for new algorithms, but not for improving existing ones. This paper presents different strategies for tuning and accelerating meta-heuristics using the first hybrid algorithm in the literature. The Lichtenberg algorithm is inspired by lightning and Lichtenberg figures and has been increasingly successfully applied to various optimization problems. However, a study of its best parameters has never been presented until now. After a discussion of the best tuning tools, its tuning parameters are performed using response surface methodology. Then, 14 versions are studied through 10 test functions using chaos theory and Lévy flights scenarios. After 13,500 simulations, the chaotic Lichtenberg algorithm equipped with the piecewise function and tuned parameters proved the best version with only 16% similarity to the original algorithm. Then, it was compared to the genetic algorithm, particle swarm optimization, gray wolf optimizer, salp swarm optimization, whale optimization algorithm, and dragonfly algorithm. The proposed algorithm had both the best average accuracy, lower computational cost, and the smallest standard deviation. [ABSTRACT FROM AUTHOR]

Empirical distribution-based framework (EDBF) is employed to lots of multi-parent crossover algorithms (MCAs) to make it much more efficient to spawn coefficients within a certain boundary at each iteration. However, EDBF cannot work with the numerous parent chromosomes especially exceeding fifty. To address this problem, an enhanced EDBF framework, namely adaptive boundary constraint framework (ABCF), is proposed by adaptively changing the boundary of weight assigned to each parent chromosome according to the constraint law. Furthermore, ABCF is compared with EDBF, ABPSO and RCBBFA algorithms on 20 benchmark functions in terms of convergence, efficiency and accuracy. Experimental results demonstrate that ABCF outperforms comparative algorithms on most of benchmark functions. As a general framework rather than a specific algorithm, ABCF is easy to implement and can easily be accommodated to any existing MCAs. [ABSTRACT FROM AUTHOR]

A Hybrid Quantum Genetic Algorithm with an Adaptive Rotation Angle (HQGAAA) for the 0-1 knapsack problem is presented. This novel proposal uses the Deutsch-Jozsa quantum circuit to generate quantum populations, which synergistically works as haploid recombination and mutation operators taking advantage of quantum entanglement providing exploitative and explorative features to produce new individuals. Furthermore, the created individuals are updated using an adaptive rotation angle operator that helps refine new individuals to converge to the optimal solution. We performed comparative tests with other quantum evolutionary algorithms and the classical genetic algorithm to demonstrate that this proposal performed better with the tested problem. Results showed that quantum algorithms performed similar but better than the classic genetic algorithm regarding accuracy. Moreover, statistic tests demonstrated that our proposal is faster than the other quantum algorithms tested. [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]

The purpose of this article is to develop a competitive supply chain network (SCN) in the face of uncertainty. The objective of the leader chain is to maximize total network profits by strategically locating suppliers, manufacturers, distribution centers, and retailers. Additionally, the follower chain seeks to maximize the network's profit. Both factors, optimal flow allocation to different echelons of the SCN and product pricing, are examined in the leader chain and follower chain. The KKT conditions are used in this article to convert a bi-level model to a one-level model. Additionally, a fuzzy programming technique is used to control the problem's uncertain parameters. According to the results obtained using the fuzzy programming technique, increasing the uncertainty rate increases demand while decreasing the OBFV and average selling price of products. Finally, the problem was untangled using a novel hybrid genetic and ant-lion optimization algorithm (HGALO). The results of problem solving in larger sizes demonstrate HGALO's superior efficiency in comparison with the other algorithm. [ABSTRACT FROM AUTHOR]

Many new, nature-inspired optimization algorithms are proposed these days, and these algorithms are gaining popularity day by day. These algorithms are frequently preferred for these real-world problems as they need less information, are reliable and robust, and have a structure that can easily be applied to discrete problems. Too many algorithms result in difficulty choosing the correct technique for the problem, and selecting an unwise method affects the solution quality. In addition, some algorithms cannot be reliable for some specific real-world problems but very successful for others. In order to guide and give insight into the practitioners and researchers about this problem, studies involving the comparison and evaluation of the performance of algorithms are needed. In this study, the performances of six nature-inspired methods, which included five new implementations of differential evolutionary algorithms (DE), scatter search (SS), equilibrium optimizer (EO), marine predators algorithm (MPA), and honey badger algorithm (HBA) applied to land redistribution problem and genetic algorithms (GA), were compared. In order to compare the algorithms in detail, various performance indicators were used as problem based and algorithm based. Experimental results showed that DE and SS algorithms have a more successful performance than the other methods by solution quality, robustness, and many problem-based indicators. [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]

Field-road trajectory segmentation, which aims to automatically divide a trajectory into a sequence of field-road segments, is one of the important tasks of the agricultural machinery trajectory process. This study aims to enhance the performance of the field-road segmentation problem by introducing a novel parameter optimization strategy that relies on metaheuristic algorithms. The utilization of the metaheuristic algorithm offers precise and efficient techniques for determining parameter combinations in the field-road segmentation model. A novel enhanced optimization algorithm called the chaos sensing slime mould algorithm (CSSMA), aimed at determining out the optimal parameter combination from a large constrained solution space is proposed to further improve the segmentation performance of the model. First, to strengthen the exploration capability of the algorithm, a chaotic strategy is used to initialize the search agents. Furthermore, the CSSMA incorporates the beetle antennae search algorithm and the genetic algorithm to improve its exploitation potential. Ultimately, a proposed technique for updating control parameters in a nonlinear and dynamic manner aims to achieve a balance between exploration and exploitation. This strategy involves adaptively adjusting computing operations based on feedback from the optimization process. In order to assess the effectiveness of the CSSMA, the algorithm is compared to other metaheuristic algorithms using 23 standard benchmark functions. Furthermore, the CSSMA is utilized to address the practical implementation of the parameter optimization approach for field-road segmentation. The goal is to achieve the utmost accuracy in segmentation and compare it with the current method. Experimental results demonstrate the superior convergence and speed of CSSMA, along with its benefits in extracting optimal parameter structures. It surpasses prior techniques in handling the complexities of field-road trajectory processing problems including several models and nonlinearity features. Additionally, it offers a comprehensive solution for optimizing parameters in various field-road segmentation models. [ABSTRACT FROM AUTHOR]

This work addresses the Knapsack Problem with Forfeit Sets, a recently introduced variant of the 0/1 Knapsack Problem considering subsets of items associated with contrasting choices. Some penalty costs need to be paid whenever the number of items in the solution belonging to a forfeit set exceeds a predefined allowance threshold. We propose an effective metaheuristic to solve the problem, based on the Biased Random-Key Genetic Algorithm paradigm. An appropriately designed decoder function assigns a feasible solution to each chromosome, and improves it using some additional heuristic procedures. We show experimentally that the algorithm outperforms significantly a previously introduced metaheuristic for the problem. [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]

With the growth of multinational companies, increasing international and domestic competition between companies, upgrading information technology, and increasing customer expectations, accurate supply chain (SC) planning is essential. In such an environment, pollution has become more severe in recent decades, and with the weakening of the environment and global warming, green SC management strategies have become significant issues in recent decades. In this research, we consider the integrated production and distribution planning problem of a multi-level green closed-loop SC system, which includes multiple recycling, manufacturing/ remanufacturing, and distribution centers. We present a three-level bi-objective programming model to maximize profit and minimize the amount of greenhouse gas emissions. A hierarchical iterative approach utilizing the LP-metric method and the non-dominated sorting genetic algorithm (NSGA-II) is introduced to solve the proposed model. The Taguchi approach is applied to find optimum control parameters of NSGA-II. Moreover, Monte Carlo (MC) simulation is applied to tackle uncertainty in demand, and the NSGA-II algorithm is integrated with MC simulation (MCNSGA-II). Through numerical experiments on randomly generated instances, we observe that the average of the relative gaps NSGA-II and LP-metric method are 7%, 7%, and 1% for the three levels, respectively. Furthermore, it is observed that the value of convergence (C) and spacing (S) metrics of the MCNSGA-II algorithm are 0 and 1.82E + 07, which are better than NSGA-II. [ABSTRACT FROM AUTHOR]

Heart disease is the most life-threatening disease globally, affecting human life very critically. On-time and precise diagnosis of heart disease is vital for the prevention and treatment of heart failure. In the earlier stage, several detection techniques were developed to detect heart disease using machine learning techniques. But the heart problems have not been detected accurately with the minimum required time. This paper presented an effective heart disease prediction system that accurately diagnoses abnormality within a short duration. The feature selection process is carried with stochastic gradient boosting with a recursive feature elimination approach. For classification, the features are clustered by using the adaptive Harris hawk optimization clustering approach. Based on clustered features, the classification is processed with an enhanced deep genetic algorithm. This method improves the performance of the deep neural network by augmenting its initial weights with an enhanced genetic algorithm, which recommends better weights for the neural network. The demonstration of the proposed work is simulated in the MATLAB platform and the dataset used in UCI machine learning repository. The experimental outcome shows that the developed feature selection and classification approach attain 98.36% and 97.3% accuracy compared with the state-of-the-art techniques. [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 this paper, we present a novel hybrid metaheuristic for the Knapsack Problem with Forfeits (KPF). KPF is a recently introduced generalization of the Knapsack Problem. In this variant, a penalty cost incurs whenever both items composing a so-called forfeit pair belong to the solution. Our proposed algorithm, called GA–CG Forfeits, combines the strengths of the Genetic and Carousel Greedy paradigms. In this work, we define the algorithm and compare it with two previously proposed heuristics on a set of benchmark instances. In these tests, GA–CG Forfeits provided significantly better solutions than the other two algorithms on all instances. [ABSTRACT FROM AUTHOR]

A large amount of data available on Web has proven to be an immense resource for innovative recommender system (RS) techniques and concepts. The traditional recommender system intended to provide recommendations for a single user. However, in certain domains the recommendation is required for a group of users. As to provide better recommendations for a group of users, we leverage the concept of circles in a network. In this work, we use the genetic algorithm (GA) K_Means clustering algorithm to generate social circles in a network. Then, we compute the status of each user in these overlapping circles. Finally, a circle-based group recommendation approach is used to generate the final group recommendation. The results obtained on the Epinions dataset validate the eminence of the proposed model over traditional approaches of group recommendation. [ABSTRACT FROM AUTHOR]

One of the most effective corrective control strategies to prevent voltage collapse and instability is load shedding. In this paper, a multiple-deme parallel genetic algorithm is used for a suitable design of load shedding. The load shedding algorithm is implemented when the voltage stability margin index of the power system is lower than a predefined value. In order to increase the computational speed, the voltage stability margin index is estimated by a modular neural network method in a fraction of a second. In addition, in order to use the exact values of the voltage stability margin index for neural network training, a simultaneous equilibrium tracing technique has been employed considering the detailed model of the components of the generating units such as the governor and the excitation system. In the proposed algorithm, the entire population is partitioned into several isolated subpopulations (demes) in which demes distributed in different processors and individuals may migrate occasionally from one subpopulation to another. The proposed technique has been tested on New England-39 bus test system, and the obtained results indicate the efficiency of the proposed method. [ABSTRACT FROM AUTHOR]

In this paper, the load forecasting model is established to increase the precision of meteorological impacts, temperature, short-term power load forecasting, working and holiday factors by considering the power load. Further, IGA-LS-SVM is proposed which is a short-term power load forecasting technique based on AI algorithm. And to increase the forecast accuracy and generalization capability of LS-SVM, we applied the adopted mutation probability and new coding technology to the parameter optimization of LS-SVM. The temperature, load, weather state, working and holiday days be taken as prediction model as input, and load value was predicted output. We selected the sample data from meteorological information and historical load of a city in Yunnan province. By results, the prediction verifies the good prediction effect when associated with existing BP algorithm and the proposed IGA- LS-SVM algorithm yields a value 0.8274 more significant than all others, which is appropriate for short-term power load prediction. [ABSTRACT FROM AUTHOR]

In construction industry, general contractors (GCs) need to manage and conduct numerous projects simultaneously. To this aim, they usually have subcontractors conduct available tasks and projects. So, subcontractor management is becoming a major challenge. To deal with this challenge, GCs aim to reduce total costs of projects including employment/subcontracting costs, indirect costs, tardiness penalties, and the money which must be paid for movement of workforce from one project to another. The aim of current research study is to propose a model for selecting subcontractors and assigning available tasks in the project to them in order to reduce the costs of the GC. Then, a genetic algorithm is proposed to solve a real problem. The proposed algorithm is innovative from three points of view: (1) generation of initial population; (2) subcontractor assignment approach; and (3) the objective function. The problem was also solved by means of an exact method. Then, the results of proposed algorithm were compared to the outcomes of the exact method. This comparison shows that the proposed algorithm can efficiently help GCs select subcontractors and assign available tasks to each subcontractor when several projects must be carried out simultaneously. [ABSTRACT FROM AUTHOR]