Flow shop scheduling problems are NP-hard problems. Heuristic algorithms and evolutionary metaheuristic algorithms are commonly used to solve this kind of problem. Although heuristic algorithms have high solving speed, the solution quality is not good. Evolutionary algorithms make up for this defect in small-scale problems, but the solution performance will deteriorate with the expansion of the problem scale and there will be premature problems. In order to improve the solving accuracy of flow shop scheduling problems, a computational efficient optimization approach combining NEH and niche genetic algorithm (NEH-NGA) is developed. It is strengthened in the following three aspects: NEH algorithm is used to optimize the initial population, three crossover operators are used to enhance the genetic efficiency, and the niche mechanism is used to control the population distribution. A concrete application scheme of the proposed method is introduced. The results of compared with NEH heuristic algorithm and standard genetic algorithm (SGA) evolutionary metaheuristic algorithm after testing on 101 FSP benchmark instances show that the solution accuracy has been significantly improved.
The K-Nearest Neighbor (KNN) algorithm is a classical machine learning algorithm. Most KNN algorithms are based on a single metric and do not further distinguish between repeated values in the range of K values, which can lead to a reduced classification effect and thus affect the accuracy of fault diagnosis. In this paper, a hybrid metric-based KNN algorithm is proposed to calculate a composite metric containing distance and direction information between test samples, which improves the discriminability of the samples. In the experiments, the hybrid metric KNN (HM-KNN) algorithm proposed in this paper is compared and validated with a variety of KNN algorithms based on a single distance metric on six data sets, and an HM-KNN application method is given for the forward gait stability control of a bipedal robot, where the abnormal motion is considered as a fault, and the distribution of zero moment points when the abnormal motion is generated is compared. The experimental results show that the algorithm has good data differentiation and generalization ability for different data sets, and it is feasible to apply it to the walking stability control of bipedal robots based on deep neural network control.
Aiming at the complex multiproduct scheduling problem with 0-wait constraint, a hybrid algorithm based on genetic algorithm (GA) and simulated annealing (SA) algorithm was studied. Based on the results of pruning and grading to the operation tree of complex multiproduct, the design structure matrix (DSM) with precedence constraints was established. Then, an initial population coding method based on DSM was proposed and three strategies to optimize the initial population were proposed to improve the quality of the initial population for the situation of multiple operations in the same grade which need to be processed on the same machine. The specific process flow and the setting method of related parameters for the hybrid algorithm were given out. For the infeasible solution produced in the crossover operation, the repair method was proposed. In the decoding process with makespan as the optimization objective, the chromosome genes were classified and the decoding for complex multiproduct scheduling problem with 0-wait constraint was realized through the analysis of its characteristics. The effectiveness of the proposed algorithm for complex multiproduct scheduling problem with 0-wait constraint is verified by the test of related examples in the existing literature.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.