1
|
Zhang W, Hao J, Liu F. Effective social spider optimization algorithms for distributed assembly permutation flowshop scheduling problem in automobile manufacturing supply chain. Sci Rep 2024; 14:6370. [PMID: 38493263 PMCID: PMC10944525 DOI: 10.1038/s41598-024-57044-8] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 10/27/2023] [Accepted: 03/13/2024] [Indexed: 03/18/2024] Open
Abstract
This paper presents a novel distributed assembly permutation flowshop scheduling problem (DAPFSP) based on practical problems in automobile production. Different from the existing research on DAPFSP, this study considers that each component of the final product is composed of more than one part. Components are processed in a set of identical components manufacturing factories and are assembled into products in the assembly factory. The integration of manufacturing processes is an important objective of Industry 4.0. For solving this problem with the minimum makespan criterion, we introduce a three-level representation and a novel initialization method. To enhance the search ability of the proposed algorithms, we design three local search methods and two restart procedures according to characteristics of the problem. Then, by incorporating the problem specific knowledge with the social spider optimization algorithm (SSO), we propose three SSO variants: the SSO with hybrid local search strategies (HSSO), the HSSO with restart procedures (HSSOR), and the HSSOR with self-adaptive selection probability (HSSORP). Finally, 810 extended instances based on the famous instances are used to test the proposed algorithms. In most cases, HSSOR performs the best, with an average comparison metric value of 0.158% across three termination conditions, while the average comparison metric value for the best comparison method is 2.446%, which is 15.481 times that of HSSOR. Numerical results demonstrate that the proposed algorithms can solve the problem efficiently.
Collapse
Affiliation(s)
- Weiwei Zhang
- School of Science, Shandong Jiaotong University, Jinan, 250357, China
| | - Jianhua Hao
- School of Information Science and Engineering, Shandong Normal University, Jinan, 250014, China.
| | - Fangai Liu
- School of Information Science and Engineering, Shandong Normal University, Jinan, 250014, China
| |
Collapse
|
2
|
Tang J, Wang L. A whale optimization algorithm based on atom-like structure differential evolution for solving engineering design problems. Sci Rep 2024; 14:795. [PMID: 38191911 PMCID: PMC10774322 DOI: 10.1038/s41598-023-51135-8] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [Grants] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Received: 09/14/2023] [Accepted: 12/31/2023] [Indexed: 01/10/2024] Open
Abstract
The whale optimization algorithm has received much attention since its introduction due to its outstanding performance. However, like other algorithms, the whale optimization algorithm still suffers from some classical problems. To address the issues of slow convergence, low optimization precision, and susceptibility to local convergence in the whale optimization algorithm (WOA). Defining the optimization behavior of whale individuals as quantum mechanical behavior, a whale optimization algorithm based on atom-like structure differential evolution (WOAAD) is proposed. Enhancing the spiral update mechanism by introducing a sine strategy guided by the electron orbital center. Improving the random-walk foraging mechanism by applying mutation operations to both the electron orbital center and random individuals. Performing crossover operations between the newly generated individuals from the improved mechanisms and random dimensions, followed by a selection process to retain superior individuals. This accelerates algorithm convergence, enhances optimization precision, and prevents the algorithm from falling into local convergence. Finally, implementing a scouting bee strategy, where whale individuals progressively increase the number of optimization failures within a limited parameter L. When a threshold is reached, random initialization is carried out to enhance population diversity. Conducting simulation experiments to compare the improved algorithm with the whale optimization algorithm, other optimization algorithms, and other enhanced whale optimization algorithms. The experimental results indicate that the improved algorithm significantly accelerates convergence, enhances optimization precision, and prevents the algorithm from falling into local convergence. Applying the improved algorithm to five engineering design problems, the experimental results demonstrate that the improved algorithm exhibits good applicability.
Collapse
Affiliation(s)
- Junjie Tang
- College of Information Science and Technology, Gansu Agricultural University, No. 1 Yingmen Village, Lanzhou, 730070, Gansu, China
| | - Lianguo Wang
- College of Information Science and Technology, Gansu Agricultural University, No. 1 Yingmen Village, Lanzhou, 730070, Gansu, China.
| |
Collapse
|
3
|
Mao X, Yang Q, Wang X, Li J. Application of Variational Mode Decomposition and Whale Optimization Algorithm to Laser Ultrasonic Signal Denoising. SENSORS (BASEL, SWITZERLAND) 2022; 23:354. [PMID: 36616949 PMCID: PMC9823361 DOI: 10.3390/s23010354] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Abstract] [Key Words] [MESH Headings] [Track Full Text] [Figures] [Subscribe] [Scholar Register] [Received: 11/16/2022] [Revised: 12/23/2022] [Accepted: 12/26/2022] [Indexed: 06/17/2023]
Abstract
Laser ultrasound signal echoes are easily drowned out by the surrounding environmental noise in industrial field applications, and it is worthwhile to study methods of retaining the weak ultrasound signal during signal processing. To address this problem, this paper proposes to adopt the parameters optimized by the whale optimization algorithm to the variational mode decomposition (VMD) of laser ultrasound signals. The optimized parameters can avoid the frequency mixing and incomplete noise separation caused by the choice of artificial VMD parameters. The Hausdorff distance is applied in the process of reconstructing the signal to help accurately select the relevant modes and improve the signal-to-noise ratio. Simulation and experimental results show that the proposed method is feasible and effective compared with the other three available denoising methods.
Collapse
|
4
|
A Novel Hybrid Whale Optimization Algorithm for Flexible Job-Shop Scheduling Problem. MACHINES 2022. [DOI: 10.3390/machines10080618] [Citation(s) in RCA: 2] [Impact Index Per Article: 1.0] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/17/2022]
Abstract
The flexible job shop scheduling problem (FJSP) is an extension of the classical job shop scheduling problem and one of the more well-known NP-hard problems. To get better global optima of the FJSP, a novel hybrid whale optimization algorithm (HWOA) is proposed for solving FJSP, in which minimizing the makespan is considered as the objective. Firstly, the uniformity and extensiveness of the initial population distribution are increased with a good point set (GPS). Secondly, a new nonlinear convergence factor (NCF) is proposed for coordinating the weight of global and local search. Then, a new multi-neighborhood structure (MNS) is proposed, within which a total of three new neighborhoods are used to search for the optimal solution from different directions. Finally, a population diversity reception mechanism (DRM), which ensures to some extent that the population diversity is preserved with iteration, is presented. Seven international benchmark functions are used to test the performance of HWOA, and the results show that HWOA is more efficient. Finally, the HWOA is applied to 73 FJSP and four Ra international instances of different scales and flexibility, and the results further verify the effectiveness and superiority of the HWOA.
Collapse
|
5
|
Adaptive Population NSGA-III with Dual Control Strategy for Flexible Job Shop Scheduling Problem with the Consideration of Energy Consumption and Weight. MACHINES 2021. [DOI: 10.3390/machines9120344] [Citation(s) in RCA: 5] [Impact Index Per Article: 1.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/16/2022]
Abstract
The flexible job shop scheduling problem has always been the focus of research in the manufacturing field. However, most of the previous studies focused more on efficiency and ignored energy consumption. Energy, especially non-renewable energy, is an essential factor affecting the sustainable development of a country. To this end, this paper designs a flexible job shop scheduling problem model with energy consideration more in line with the production field. Except for the processing stage, the energy consumption of the transport, set up, unload, and idle stage are also included in our model. The weight property of jobs is also considered in our model. The heavier the job, the more energy it consumes during the transport, set up, and unload stage. Meanwhile, this paper invents an adaptive population non-dominated sorting genetic algorithm III (APNSGA-III) that combines the dual control strategy with the non-dominated sorting genetic algorithm III (NSGA-III) to solve our flexible job shop scheduling problem model. Four flexible job shop scheduling problem instances are formulated to examine the performance of our algorithm. The results achieved by the APNSGA-III method are compared with five classic multi-objective optimization algorithms. The results show that our proposed algorithm is efficient and powerful when dealing with the multi-objective flexible job shop scheduling problem model that includes energy consumption.
Collapse
|
6
|
A Self-Adaptive Cuckoo Search Algorithm Using a Machine Learning Technique. MATHEMATICS 2021. [DOI: 10.3390/math9161840] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.7] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 01/02/2023]
Abstract
Metaheuristics are intelligent problem-solvers that have been very efficient in solving huge optimization problems for more than two decades. However, the main drawback of these solvers is the need for problem-dependent and complex parameter setting in order to reach good results. This paper presents a new cuckoo search algorithm able to self-adapt its configuration, particularly its population and the abandon probability. The self-tuning process is governed by using machine learning, where cluster analysis is employed to autonomously and properly compute the number of agents needed at each step of the solving process. The goal is to efficiently explore the space of possible solutions while alleviating human effort in parameter configuration. We illustrate interesting experimental results on the well-known set covering problem, where the proposed approach is able to compete against various state-of-the-art algorithms, achieving better results in one single run versus 20 different configurations. In addition, the result obtained is compared with similar hybrid bio-inspired algorithms illustrating interesting results for this proposal.
Collapse
|
7
|
Madruga M, Campos-Roca Y, Pérez CJ. Impact of noise on the performance of automatic systems for vocal fold lesions detection. Biocybern Biomed Eng 2021. [DOI: 10.1016/j.bbe.2021.07.001] [Citation(s) in RCA: 0] [Impact Index Per Article: 0] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/20/2022]
|
8
|
Zhang Z, Guan Z, Xie X. Innovation development and capability evolution for traditional machinery manufacturing enterprises based on genetic algorithm. ENTERP INF SYST-UK 2020. [DOI: 10.1080/17517575.2020.1849815] [Citation(s) in RCA: 2] [Impact Index Per Article: 0.5] [Reference Citation Analysis] [Track Full Text] [Journal Information] [Subscribe] [Scholar Register] [Indexed: 10/22/2022]
Affiliation(s)
- Zhe Zhang
- School of Management Science and Engineering, Shandong University of Finance and Economics; Jinan, 250014, China
- School of Economics and Management, Beijing Jiaotong University, Beijing, 100044, China
| | - Zhongliang Guan
- School of Economics and Management, Beijing Jiaotong University, Beijing, 100044, China
| | - Xiang Xie
- School of Economics and Management, Beijing Jiaotong University, Beijing, 100044, China
| |
Collapse
|
9
|
Clustering-Based Binarization Methods Applied to the Crow Search Algorithm for 0/1 Combinatorial Problems. MATHEMATICS 2020. [DOI: 10.3390/math8071070] [Citation(s) in RCA: 6] [Impact Index Per Article: 1.5] [Reference Citation Analysis] [Abstract] [Track Full Text] [Subscribe] [Scholar Register] [Indexed: 11/17/2022]
Abstract
Metaheuristics are smart problem solvers devoted to tackling particularly large optimization problems. During the last 20 years, they have largely been used to solve different problems from the academic as well as from the real-world. However, most of them have originally been designed for operating over real domain variables, being necessary to tailor its internal core, for instance, to be effective in a binary space of solutions. Various works have demonstrated that this internal modification, known as binarization, is not a simple task, since the several existing binarization ways may lead to very different results. This of course forces the user to implement and analyze a large list of binarization schemas for reaching good results. In this paper, we explore two efficient clustering methods, namely KMeans and DBscan to alter a metaheuristic in order to improve it, and thus do not require on the knowledge of an expert user for identifying which binarization strategy works better during the run. Both techniques have widely been applied to solve clustering problems, allowing us to exploit useful information gathered during the search to efficiently control and improve the binarization process. We integrate those techniques to a recent metaheuristic called Crow Search, and we conduct experiments where KMeans and DBscan are contrasted to 32 different binarization methods. The results show that the proposed approaches outperform most of the binarization strategies for a large list of well-known optimization instances.
Collapse
|
10
|
Abstract
Short term memory that records the current population has been an inherent component of Evolutionary Algorithms (EAs). As hardware technologies advance currently, inexpensive memory with massive capacities could become a performance boost to EAs. This paper introduces a Long Term Memory Assistance (LTMA) that records the entire search history of an evolutionary process. With LTMA, individuals already visited (i.e., duplicate solutions) do not need to be re-evaluated, and thus, resources originally designated to fitness evaluations could be reallocated to continue search space exploration or exploitation. Three sets of experiments were conducted to prove the superiority of LTMA. In the first experiment, it was shown that LTMA recorded at least 50 % more duplicate individuals than a short term memory. In the second experiment, ABC and jDElscop were applied to the CEC-2015 benchmark functions. By avoiding fitness re-evaluation, LTMA improved execution time of the most time consuming problems F 03 and F 05 between 7% and 28% and 7% and 16%, respectively. In the third experiment, a hard real-world problem for determining soil models’ parameters, LTMA improved execution time between 26% and 69%. Finally, LTMA was implemented under a generalized and extendable open source system, called EARS. Any EA researcher could apply LTMA to a variety of optimization problems and evolutionary algorithms, either existing or new ones, in a uniform way.
Collapse
|