A large number of intelligent algorithms based on social intelligent behavior have been extensively researched in the past few decades, through the study of natural creatures, and applied to various optimization fields. The learning-based intelligent optimization algorithm (LIOA) refers to an intelligent optimization algorithm with a certain learning ability. This is how the traditional intelligent optimization algorithm combines learning operators or specific learning mechanisms to give itself some learning ability, thereby achieving better optimization behavior. We conduct a comprehensive survey of LIOAs in this paper. The research includes the following sections: Statistical analysis about LIOAs, classification of LIOA learning method, application of LIOAs in complex optimization scenarios, and LIOAs in engineering applications. The future insights and development direction of LIOAs are also discussed.

A Survey of Learning-Based Intelligent Optimization Algorithms

Big data analytics for intelligent manufacturing systems: A review

Elephant herding optimization (EHO) is a nature-inspired metaheuristic optimization algorithm based on the herding behavior of elephants. EHO uses a clan operator to update the distance of the elephants in each clan with respect to the position of a matriarch elephant. The superiority of the EHO method to several state-of-the-art metaheuristic algorithms has been demonstrated for many benchmark problems and in various application areas. A comprehensive review for the EHO-based algorithms and their applications are presented in this paper. Various aspects of the EHO variants for continuous optimization, combinatorial optimization, constrained optimization, and multi-objective optimization are reviewed. Future directions for research in the area of EHO are further discussed.

https://www.mdpi.com/2227-7390/8/9/1415/pdf

Elephant Herding Optimization: Variants, Hybrids, and Applications

An improved grasshopper optimization algorithm (GOA) is proposed in this paper, termed as SGOA, which combines simulated annealing (SA) mechanism with the original GOA that is a natural optimizer widely used in finance, medical and other fields, and receives more promising results based on grasshopper behavior. To compare performance of the SGOA and other algorithms, an investigation to select CEC2017 benchmark function as the test set was carried out. Also, the Friedman assessment was performed to check the significance of the proposed method against other counterparts. In comparison with ten meta-heuristic algorithms such as differential evolution (DE), the proposed SGOA can rank first in the CEC2017, and also ranks first in comparison with ten advanced algorithms. The simulation results reveal that the SA strategy notably improves the exploration and exploitation capacity of GOA. Moreover, the SGOA is also applied to engineering problems and parameter optimization of the kernel extreme learning machine (KELM). After optimizing the parameters of KELM using SGOA, the model was applied to two datasets, Cleveland Heart Dataset and Japanese Bankruptcy Dataset, and they achieved an accuracy of 79.2% and 83.5%, respectively, which were better than the KELM model obtained other algorithms. In these practical applications, it is indicated that the proposed SGOA can provide effective assistance in settling complex optimization problems with impressive results.

SGOA: annealing-behaved grasshopper optimizer for global tasks

The Slime Mould Algorithm (SMA) is a recent metaheuristic inspired by the oscillation of slime mould. Similar to other original metaheuristic algorithms (MAs), SMA may suffer from drawbacks, such as being trapped in minimum local regions and improper balance between exploitation and exploration phases. To overcome these weaknesses, this paper proposes a hybrid algorithm: SMA combined to Adaptive Guided Differential Evolution Algorithm (AGDE) (SMA-AGDE). The AGDE mutation method is employed to enhance the swarm agents’ local search, increase the population’s diversity, and help avoid premature convergence. The SMA-AGDE’s performance is evaluated on the CEC’17 test suite, three engineering design problems – tension/compression spring, pressure vessel, and rolling element bearing – and two combinatorial optimization problems – bin packing and quadratic assignment. The SMA-AGDE is compared with three categories of optimization methods: (1) The well-studied MAs, i.e., Biogeography-Based Optimizer (BBO), Gravitational Search Algorithm (GSA), and Teaching Learning-Based Optimization (TLBO), (2) Recently developed MAs, i.e., Harris Hawks Optimization (HHO), Manta Ray Foraging optimization (MRFO), and the original SMA, and (3) High-performance MAs, i.e., Evolution Strategy with Covariance Matrix Adaptation (CMA-ES), and AGDE. The overall simulation results reveal that the SMA-AGDE ranked first among the compared algorithms, and so, over different function landscapes. Thus, the proposed SMA-AGDE is a promising optimization tool for global and combinatorial optimization problems and engineering design problems.

Hybrid slime mould algorithm with adaptive guided differential evolution algorithm for combinatorial and global optimization problems

The emergence of fuzzy sets makes job-shop scheduling problem (JSSP) become better aligned with the reality. This article addresses the JSSP with fuzzy execution time and fuzzy completion time (FJSSP). We choose the classic differential evolution (DE) algorithm as the basic optimization framework. The advantage of the DE algorithm is that it uses a special evolutionary strategy of difference vector sets to carry out mutation operation. However, DE is not very effective in solving some instances of FJSSP. Therefore, we propose a novel selection mechanism augmenting the generic DE algorithm (NSODE) to achieve better optimization results. The proposed selection operator adopted in this article aims at a temporary retention of all children generated by the parent generation, and then selecting N better solutions as the new individuals from N parents and N children. Various examples of fuzzy shop scheduling problems are experimented with to test the performance of the improved DE algorithm. The NSODE algorithm is compared with a variety of existing algorithms such as ant colony optimization, particle swarm optimization, and cuckoo search. Experimental results show that the NSODE can obtain superior feasible solutions compared with solutions produced by several algorithms reported in the literature.

Solving Fuzzy Job-Shop Scheduling Problem Using DE Algorithm Improved by a Selection Mechanism

The job-shop scheduling problem (JSP) is NP hard, which has very important practical significance. Because of many uncontrollable factors, such as machine delay or human factors, it is difficult to use a single real-number to express the processing and completion time of the jobs. JSP with fuzzy processing time and completion time (FJSP) can model the scheduling more comprehensively, which benefits from the developments of fuzzy sets. Fuzzy relative entropy leads to a method that can evaluate the quality of a feasible solution following the comparison between the actual value and the ideal value (the due date). Therefore, the multiobjective FJSP can be transformed into a single-objective optimization problem and solved by a hybrid adaptive differential evolution (HADE) algorithm. The maximum completion time, the total delay time, and the total energy consumption of jobs will be considered. HADE adopts a mutation strategy based on DE-current-to-best. Its parameters (CR and F) are all made adaptive and normally distributed. The new individuals are selected according to the fitness value (FRE) obtained from a population consisting of N parents and N children in HADE. The algorithm is analyzed from different viewpoints. As the experimental results demonstrate, the performance of the HADE algorithm is better than those of some other state-of-the-art algorithms (namely, ant colony optimization, artificial bee colony, and particle swarm optimization).

Da Gao

Papers

Solving Fuzzy Job-Shop Scheduling Problem Using DE Algorithm Improved by a Selection Mechanism

Solving Multiobjective Fuzzy Job-Shop Scheduling Problem by a Hybrid Adaptive Differential Evolution Algorithm