In order to cope with the parameters optimization of the least square support vector machine, a backtracking search optimization algorithm-based least square support vector machine model is proposed. In this model, backtracking search optimization algorithm is introduced to optimize the parameters of the...
从vector容器中查找一个子串:search()算法 如果要从vector容器中查找是否存在一个子串序列,就像从一个字符串中查找子串那样,次数find()与find_if()算法就不起作用了,需要采用search()算法:例子: #include "stdafx.h" #include <iostream> #include <vector> #include <algorithm> using namespace std; int_t...
An improved backtracking search algorithm (BSA) is proposed to estimate the parameters of nonlinear Muskingum model. The orthogonal designed initialization population strategy and chaotic sequences are introduced to improve the exploration and exploitation ability of BSA. At the same time, a selection ...
G. (2016). Fuzzy logic speed controller optimization approach for induction motor drive using backtracking search algorithm. Measurement, 78, 49-62.J. A. Ali, M. A. Hannan, A. Mohamed, and M. G. M. Abdol- rasol, "Fuzzy logic speed controller optimization approach for induction motor ...
backtracking search algorithmIn this article, the enhanced backtracking search algorithm is employed to achieve optimal coordination of directional over-current relays. A novel objective function is formulated to minimize the total operating times while maintaining the validity of the coordination time ...
The backtracking search optimization algorithm (BSA) is a new nature-inspired method which possesses a memory to take advantage of experiences gained from previous generation to guide the population to the global optimum. BSA is capable of solving multimodal problems, but it slowly converges and poor...
This paper presents a novel hybrid long-term forecasting method with support vector regression(SVR) and backtracking search algorithm(BSA) optimization algorithm, which is used to obtain the parameters of the SVR. The practical case of China's annual electricity demand is used to evaluate the ...
This chapter explores that there are three main algorithmic techniques for solving constraint satisfaction problems: (1) backtracking search, (2) local search, and (3) dynamic programming. An algorithm for solving a constraint satisfaction problem (CSP) can be either complete or incomplete. Complete...
Backtracking search optimization algorithm for numerical optimization problems Appl. Math. Comput. (2013) GaoJ.et al. A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems Comput. Oper. Res. (2008) ...
The backtracking algorithm. EXAMPLE 5.4 Consider the graph-coloring problem in Figure 5.4. Assume a backtracking search for a solution using two possible orderings: d1 = x1, x2, x3, x4, x5, x6, x7 and d2 = x1, x7, x4, x5, x6, x3, x2. The search graphs along orderings d1 ...