A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Se...
详细信息
A discrete artificial bee colony algorithm is proposed for solving the blocking flow shop scheduling problem with total flow time criterion. Firstly, the solution in the algorithm is represented as job permutation. Secondly, an initialization scheme based on a variant of the NEH (Nawaz-Enscore-Ham) heuristic and a local search is designed to construct the initial population with both quality and diversity. Thirdly, based on the idea of iterated greedy algorithm, some newly designed schemes for employed bee, onlooker bee and scout bee are presented. The performance of the proposed algorithm is tested on the well-known Taillard benchmark set, and the computational results demonstrate the effectiveness of the discrete artificial bee colony algorithm. In addition, the best known solutions of the benchmark set are provided for the blocking flow shop scheduling problem with total flow time criterion.
In this paper, a new control strategy was proposed to deal with the discrete-time multi-agent consensus problem. Two types of protocols are discussed in this paper: i) networks of single-integrators without delay unde...
详细信息
ISBN:
(纸本)9781467357661
In this paper, a new control strategy was proposed to deal with the discrete-time multi-agent consensus problem. Two types of protocols are discussed in this paper: i) networks of single-integrators without delay under centralized eventtriggered control and ii) networks of single-integrators with delay under distributed event-triggered control. For each consensus protocol, we prove that the multi-agent network will achieve consensus asymptotically. Numerical examples are provided to demonstrate the effectiveness of the obtained theoretical results.
This paper is concerned with the stochastic bounded consensus tracking problems of leader-follower multi-agent systems, where the control input of an agent can only use the information measured at the sampling instant...
详细信息
This paper is concerned with the stochastic bounded consensus tracking problems of leader-follower multi-agent systems, where the control input of an agent can only use the information measured at the sampling instants from its neighbours or the virtual leader with a time-varying reference state, and the measurements are corrupted by random noises. The probability limit theory and the algebra graph theory are employed to derive the necessary and sufficient conditions guaranteeing the mean square bounded consensus tracking. It is shown that the maximum allowable upper boundary of the sampling period simultaneously depends on the constant feedback gains and the network topology. Furthermore, the effects of the sampling period on the tracking performance are analysed. It turns out that from the view point of the sampling period, there is a trade-off between the tracking speed and the static tracking error. Simulations are provided to demonstrate the effectiveness of the theoretical results.
Fault monitoring of bioprocess is important to ensure safety of a reactor and maintain high quality of products. It is difficult to build an accurate mechanistic model for a bioprocess, so fault monitoring based on ri...
详细信息
Fault monitoring of bioprocess is important to ensure safety of a reactor and maintain high quality of products. It is difficult to build an accurate mechanistic model for a bioprocess, so fault monitoring based on rich historical or online database is an effective way. A group of data based on bootstrap method could be resampling stochastically, improving generalization capability of model. In this paper, online fault monitoring of generalized additive models (GAMs) combining with bootstrap is proposed for glutamate fermentation process. GAMs and bootstrap are first used to decide confidence interval based on the online and off-line normal sampled data from glutamate fermentation experiments. Then GAMs are used to online fault monitoring for time, dissolved oxygen, oxygen uptake rate, and carbon dioxide evolution rate. The method can provide accurate fault alarm online and is helpful to provide useful information for removing fault and abnormal phenomena in the fermentation.
In this paper, the synchronization of a nonlinear network with time-varying coupling delay is investigated via distributed impulsive control. Our objective is to design the distributed impulsive controller with minimu...
详细信息
In this paper, the synchronization of a nonlinear network with time-varying coupling delay is investigated via distributed impulsive control. Our objective is to design the distributed impulsive controller with minimum coupling strength such that the nonlinear network with coupling delay is globally exponentially synchronous. Some sufficient conditions have been derived based on Lyapunov-Razumikhin method in terms of matrix inequalities. An example is presented to illustrate the effectiveness of the proposed control methods.
Density-based algorithm for discovering clusters in large spatial databases with noise(DBSCAN) is a classic kind of density-based spatial clustering algorithm and is widely applied in several aspects due to good perfo...
详细信息
Density-based algorithm for discovering clusters in large spatial databases with noise(DBSCAN) is a classic kind of density-based spatial clustering algorithm and is widely applied in several aspects due to good performance in capturing arbitrary shapes and detecting outliers. However, in practice, datasets are always too massive to fit the serial DBSCAN. And a new parallel algorithm-Parallel DBSCAN(PDBSCAN) was proposed to solve the problem which DBSCAN faced. The proposed parallel algorithm bases on MapReduce mechanism. The usage of parallel mechanism in the algorithm focuses on region query and candidate queue processing which needed substantive computation resources. As a result, PDBSCAN is scalable for large-scale dataset clustering and is extremely suitable for applications in E-Commence, especially for recommendation.
The ammonia synthesis reactor is the core unit in the whole ammonia synthesis production. The ammonia concentration at the ammonia converter outlet is a significant process variable, which reflects directly the produc...
详细信息
The ammonia synthesis reactor is the core unit in the whole ammonia synthesis production. The ammonia concentration at the ammonia converter outlet is a significant process variable, which reflects directly the production efficiency. However, it is hard to be measured reliably online in real applications. In this paper, a soft sensor based on BP neural network (BPNN) is applied to estimate the ammonia concentration. A modified group search optimization with nearest neighborhood (GSO-NH) is proposed to optimize the weights and thresholds of BPNN. GSO-NH is integrated with BPNN to build a soft sensor model. Finally, the soft sensor model based on BPNN and GSO-NH (GSO-NH-NN) is used to infer the outlet ammonia concentration in a real-world application. Three other modeling methods are applied for comparison with GSO-NH-NN. The results show that the soft sensor based on GSO-NH-NN has a good prediction performance with high accuracy. Moreover, the GSO-NH-NN also provides good generalization ability to other modeling problems in ammonia synthesis production.
For complex industrial processes with multiple operational conditions, it is important to develop effective monitoring algorithms to ensure the safety of production processes. This paper proposes a novel monitoring st...
详细信息
For complex industrial processes with multiple operational conditions, it is important to develop effective monitoring algorithms to ensure the safety of production processes. This paper proposes a novel monitoring strategy based on fuzzy C-means. The high dimensional historical data are transferred to a low dimensional subspace spanned by locality preserving projection. Then the scores in the novel subspace are classified into several overlapped clusters, each representing an operational mode. The distance statistics of each cluster are integrated though the membership values into a novel BID (Bayesian inference distance) monitoring index. The efficiency and effectiveness of the proposed method are validated though the Tennessee Eastman benchmark process.
States of traffic situations can be classified into peak and nonpeak periods. The complexity of peak traffic brings more difficulty to forecasting models. Travel time index (TTI) is a fundamental measure in transporta...
详细信息
States of traffic situations can be classified into peak and nonpeak periods. The complexity of peak traffic brings more difficulty to forecasting models. Travel time index (TTI) is a fundamental measure in transportation. How to master the characteristics and provide accurate real-time forecasts is essential to intelligent transportation systems (ITS). Cooperating with state space approach, least squares support vector machines (LS-SVMs) are investigated to solve such a practical problem in this paper. To the best of our knowledge, it is the first time to apply the technique and analyze the forecast performance in the domain. For comparison purpose, other two nonparametric predictors are selected because of their effectiveness proved in past research. Having good generalization ability and guaranteeing global minima, LS-SVMs perform better than the others. Providing sufficient improvement in stability and robustness reveals that the approach is practically promising.
暂无评论