Narrow Results

With the rapid development of artificial intelligence technology, collaborative filtering (CF) algorithms are becoming increasingly widely used in the field of education. This paper aims to explore the application of CF algorithms in the reform and innovation of music teaching in universities, in order to improve teaching effectiveness and students’ learning experience. First, this paper analyzes the problems existing in current music teaching in universities, such as single teaching methods and low student participation. In order to complete the research on the extension of online music systems in music teaching, this paper reused the post filtering paradigm of contextual information and redesigned the two-stage process of the hybrid algorithm. After the initial screening of CF, the algorithm extracts recommendation results with contextual bias based on tag information. Then, based on the improved algorithm, an online music teaching system was implemented. Applying hybrid algorithm intelligent algorithms to university music teaching can not only improve the personalization and interactivity of teaching, but also promote the cultivation of students’ creativity and critical thinking abilities. The experimental results show that the music teaching system using hybrid intelligent algorithms significantly improves students’ learning participation, with an average participation rate increased by 30% compared to traditional teaching methods. At the same time, students’ learning outcomes have also significantly improved, with an average score increase of 15% in music theory exams. And in the assessment of creativity and critical thinking ability, students show stronger thinking activity and innovation ability. In addition, system feedback indicates that over 90% of students are satisfied with the teaching system, believing that it enhances the fun and interactivity of learning.

Currently, methods of combined classification are the focus of intense research. A properly designed group of combined classifiers exploiting knowledge gathered in a pool of elementary classifiers can successfully outperform a single classifier. There are two essential issues to consider when creating combined classifiers: how to establish the most comprehensive pool and how to design a fusion model that allows for taking full advantage of the collected knowledge. In this work, we address the issues and propose an AdaSS+, training algorithm dedicated for the compound classifier system that effectively exploits local specialization of the elementary classifiers. An effective training procedure consists of two phases. The first phase detects the classifier competencies and adjusts the respective fusion parameters. The second phase boosts classification accuracy by elevating the degree of local specialization. The quality of the proposed algorithms are evaluated on the basis of a wide range of computer experiments that show that AdaSS+ can outperform the original method and several reference classifiers.

Leader-based protocols rest on a primitive able to provide the processes with the same unique leader. Such protocols are very common in distributed computing to solve synchronization or coordination problems. Unfortunately, providing such a primitive is far from being trivial in asynchronous distributed systems prone to process crashes. (It is even impossible in fault-prone purely asynchronous systems.) To circumvent this difficulty, several protocols have been proposed that build a leader facility on top of an asynchronous distributed system enriched with synchrony assumptions. This paper introduces a novel approach to implement an eventual leader protocol, namely a time-free behavioral assumption on the flow of messages that are exchanged. It presents a very simple leader protocol based on this assumption. It then presents a second leader protocol combining this timeless assumption with eventually timely channels. As it considers several assumptions, the resulting hybrid protocol has the noteworthy feature to provide an increased overall assumption coverage. A probabilistic analysis shows that the time-free assumption is practically always satisfied.

Bus network design is an important problem in public transportation. In practice, some parameters of this problem are uncertain. We propose two models for the bus terminal location problem with fuzzy parameters. In the first formulation, the number of passengers corresponding to each node is a fuzzy number. In the second formulation, an additional assumption of fuzzy neighborhood is considered. These problems being NP-hard, we use a genetic algorithm (GA) and a simulated annealing (SA) algorithm for solving them. We also propose an idea to hybridize these algorithms. In our hybrid algorithm, SA is applied as a neighborhood search procedure of GA on the best individual of the population, which is the best available approximation of the optimal solution, with a varying probability that is gradually increased with the increase in the number of iterations in GA. We then implement GA, SA, our hybrid algorithm, and a recently proposed hybrid algorithm making use of a constant probability for application of SA on all the individuals of the population of GA, and use a nonparametric statistical test to compare their performances on a collection of randomly generated medium to large-scale test problems. Results of computational experiments demonstrating the efficiency and practicability of our proposed algorithm are reported.

In order to overcome the drawbacks of the K-means (KM) for clustering problems such as excessively depending on the initial guess values and easily getting into local optimum, a clustering algorithm of invasive weed optimization (IWO) and KM based on the cloud model has been proposed in the paper. The so-called cloud model IWO (CMIWO) is adopted to direct the search of KM algorithm to ensure that the population has a definite evolution direction in the iterative process, thus improving the performance of CMIWO K-means (CMIWOKM) algorithm in terms of convergence speed, computing precision and algorithm robustness. The experimental results show that the proposed algorithm has such advantages as higher accuracy, faster constringency, and stronger stability.

In order to accelerate the convergence and improve the calculation accuracy for parameter optimization of the Muskingum model, we propose a novel, adaptive hybrid particle swarm optimization (AHPSO) algorithm. With the decreasing of inertial weight factor proposed, this method can gradually converge to a global optimal with elite individuals obtained by hybrid PSO. In the paper, we analyzed the feasibility and the advantages of the AHPSO algorithm. Then, we verified its efficiency and superiority by application of the Muskingum model. We intensively evaluated the error fitting degree based on the comparison with four known formulas: the test method (TM), the least residual square method (LRSM), the nonlinear programming method (NPM), and the Broyden–Fletcher–Goldfarb–Shanno (BFGS) method. The results show that the AHPSO has a higher precision. In addition, we compared the AHPSO algorithm with the binary-encoded genetic algorithm (BGA), the Gray genetic algorithm (GGA), the Gray-encoded accelerating genetic algorithm (GAGA) and the particle swarm optimization (PSO), and results show that AHPSO has faster convergent speed. Moreover, AHPSO has a competitive advantage compared with the above eight methods in terms of robustness. With the efficiency of this approach it can be extended to estimate parameters of other dynamic models.

A hybrid invasive weed optimization (HIWO) algorithm based on the Broyden–Fletcher–Goldfarb–Shanno (BFGS) algorithm is proposed for the problems on parameter inversion of the nonlinear models of sun shadow with integer variables in the study. Our presented algorithm can take full advantage of the local search ability of BFGS algorithm and the global search ability of invasive weed optimization (IWO) algorithm. The HIWO algorithm can not only reverse the date of sun shadow model successfully, but also conquer the weaknesses that the classic mathematical methods are hard to address integer nonlinear optimization problems by utilizing integers in some random variables from algorithms. The results of numerical experiments demonstrate that the HIWO algorithm has not only high computing accuracy, but also fast convergence speed. It can effectively improve the accuracy and efficiency of the techniques of sun shadow location, and afford an effective and efficient technique to handle the issues of integer parameter inversion in engineering applications.

A chaos particle swarm optimization (CPSO) algorithm based on the chaos operator (CS) is proposed for global optimization problems and parameter inversion of the nonlinear sun shadow model in our study. The CPSO algorithm combines the local search ability of CS and the global search ability of PSO algorithm. The CPSO algorithm can not only solve the global optimization problems effectively, but also address the parameter inversion problems of the date of sun shadow model location successfully. The results of numerical experiment and simulation experiment show that the CPSO algorithm has higher accuracy and faster convergence than the-state-of-the-art techniques. It can effectively improve the computing accuracy and computing efficiency of the global optimization problems, and also provide a novel method to solve the problems of integer parameter inversion in real life.

With the rapid development of online e-commerce, traditional collaborative filtering algorithms have the disadvantages of data set reduction and sparse matrix filling cannot meet the requirements of users. This paper takes handicrafts as an example to propose the design and application of handicraft recommendation system based on an improved hybrid algorithm. Based on the theory of e-commerce system, through the traditional collaborative filtering algorithm of users, the personalized e-commerce system of hybrid algorithm is designed and analyzed. The personalized e-commerce system based on hybrid algorithm is further proposed. The component model of the business recommendation system and the specific steps of the improved hybrid algorithm based on user information are given. Finally, an experimental analysis of the improved hybrid algorithm is carried out. The results show that the algorithm can effectively improve the effectiveness and exemption of recommending handicrafts. What’s more, it can reduce the user item ratings of candidate set and improve accuracy of the forecast recommendation.

Harmony search algorithm, which simulates the musical improvisation process in seeking agreeable harmony, is a population based meta-heuristics algorithm for solving optimization problems. Although it has been successfully applied on various optimization problems; it suffers the slow convergence problem, which greatly hinders its applicability for getting good quality solution. Therefore, in this work, we propose a hybrid meta-heuristic algorithm that hybridizes a harmony search with simulated annealing for the purpose of improving the performance of harmony search algorithm. Harmony search algorithm is used to explore the search spaces. Whilst, simulated annealing algorithm is used inside the harmony search algorithm to exploit the search space and further improve the solutions that are generated by harmony search algorithm. The performance of the proposed algorithm is tested using the Solomon's Vehicle Routing Problem with Time Windows (VRPTW) benchmark. Numerical results demonstrate that the hybrid approach is better than the harmony search without simulated annealing and the hybrid also proves itself to be more competent (if not better on some instances) when compared to other approaches in the literature.

This paper describes the emergency rescue vehicle transportation network within the entire rescue period, and imitates rescue vehicle to select rescue route and to allocate emergency resource. The presented emergency rescue vehicle dispatch model seeks to minimize rescue time as the first objective function, minimize delay cost as the second objective function and maximize lifesaving utility as the last objective function in disaster response operations. To solve the proposed multiple objective model, a hybrid algorithm named nondominated sorting genetic algorithm (NSGA-II) with ant colony algorithm and a NSGA-II with random crossover and mutation, which can find better initial solution, are presented. In order to further prove the validity of the model and algorithm, a more complicated case is cited. Computational results are reported to illustrate the performance of the proposed model and algorithm. Statistical analysis confirms that the proposed random crossover and mutation operator outperforms the original crossover and mutation operator. The sensitivity analysis proves which parameter is more important for objective function values.

In this paper, an efficient hybrid method for solving constrained numerical and engineering optimization problems is presented. The proposed hybrid method uses a combination of three methods a genetic algorithm (GA), particle swarm optimization (PSO), and symbiotic organisms search (SOS) to find desired solution of problems in a complex design space and to control the feasibility of finding solutions using the penalty function method. There are three alternative phases in the proposed algorithm: GA, which develops and selects the best population for the next phases, PSO, which obtains the experiences for each appropriate solution and updates them, the SOS, which performs symbiotic interaction updates in real-world populations. For constraint handling, the penalty function method was used with same values to control the parameters based on the problem. The proposed algorithm was tested on a set of constrained problems from previous studies. Normality and non-parametric tests were performed on the proposed method. the obtained results have showed that the proposed method is able to score the best rank among the CEC 2010 competition algorithms. It is able to solve most of these numerical and engineering design problems up to the best desired solutions and reach the minimum number of function evaluations. The proposed method had a showed better performance than the $𝜀$DEag, which was the winner of the CEC 2010 competition.

Grey Wolf optimizer (GWO) has been used in several fields of research. The main advantages of this algorithm are its simplicity, little controlling parameter, and adaptive exploratory behavior. However, similar to other metaheuristic algorithms, the GWO algorithm has several limitations. The main drawback of the GWO algorithm is its low capability to handle a multimodal search landscape. This drawback occurs because the alpha, beta, and gamma wolves tend to converge to the same solution. This paper presents HDGM – a novel hybrid optimization model of dragonfly algorithm and grey wolf optimizer, aiming to overcome the disadvantages of GWO algorithm. Dragonfly algorithm (DA) is combined with GWO in this study because DA has superior exploration ability, which allows it to search in promising areas in the search space. To verify the solution quality and performance of the HDGM algorithm, we used twenty-three test functions to compare the proposed model’s performance with that of the GWO, DA, particle swam optimization (PSO) and ant lion optimization (ALO). The results show that the hybrid algorithm provides more competitive results than the other variants in terms of solution quality, stability, and capacity to discover the global optimum.

The sine cosine algorithm (SCA) and multi-verse optimizer (MVO) are the recognized optimization strategies frequently employed in numerous scientific areas. However, both SCA and MVO grapple with optimizing the transition between the exploitation and exploration mechanisms. Furthermore, MVO exhibits constraints in its exploitation capabilities. To tackle these limitations, this paper introduces a hybrid model termed SMVO, combining the advantages of both SCA and MVO. This hybrid approach seeks to harmonize exploitation and exploration stages by leveraging the unique advantages of each parent algorithm. The efficacy of SMVO was assessed using 23 benchmark test functions, revealing its competitive performance against not only SCA and MVO but also the ant lion optimization (ALO) and the dragonfly algorithm (DA). Additionally, SMVO’s applicability was further validated by successfully addressing three distinct engineering optimization challenges, underscoring its stability and promise as a global optimization tool.

This paper presents a simple, hybrid two phase global optimization algorithm called DE-PSO for solving global optimization problems. DE-PSO consists of alternating phases of Differential Evolution (DE) and Particle Swarm Optimization (PSO). The algorithm is designed so as to preserve the strengths of both the algorithms. Empirical results show that the proposed DE-PSO is quite competent for solving the considered test functions as well as real life problems.

In this paper, we propose a method to optimize etching yield parameters. By means of defining a fitness function between the actual etching profile and the simulation profile, the etching yield parameters solving problem is transformed into an optimization problem. The problem is nonlinear and high dimensional, and each simulation is computationally expensive. To solve this problem, we need to search a better solution in a multidimensional space. Ordinal optimization and tabu search hybrid algorithm is introduced to solve this complex problem. This method ensures getting good enough solution in an acceptable time. The experimental results illustrate that simulation profile obtained by this method is very similar with the actual etching profile in surface topography. It also proves that our proposed method has feasibility and validity.