hrough the across-America-journey, in Jack Kerouac's renowned novel, On the Road, Sal Paradise and his friends accomplished a self-searching and truth-searching process.
Objective To propose a new dynamic extremum self searching method, which can be used in industrial processes extremum optimum control systems, to overcome the disadvantages of traditional method. Methods This algor...Objective To propose a new dynamic extremum self searching method, which can be used in industrial processes extremum optimum control systems, to overcome the disadvantages of traditional method. Methods This algorithm is based on correlation analysis. A pseudo random binary signal m sequence u(t) is added as probe signal in system input, construct cross correlation function between system input and output, the next step hunting direction is judged by the differential sign. Results Compared with traditional algorithm such as step forward hunting method, the iterative efficient, hunting precision and anti interference ability of the correlation analysis method is obvious over the traditional algorithm. The computer simulation experimental given illustrate these viewpoints. Conclusion The correlation analysis method can settle the optimum state point of device operating process. It has the advantage of easy condition , simple calculate process.展开更多
A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems＇ another feature lies in oversubscription, namely no...A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems＇ another feature lies in oversubscription, namely not all jobs can be scheduled within specified scheduling horizons due to the limited machine capacity. The objective is thus to maximize the overall profits of processed jobs while respecting machine constraints. A first-in- first-out heuristic is applied to find an initial solution, and then a large neighborhood search procedure is employed to relax and re- optimize cumbersome solutions. A machine learning mechanism is also introduced to converge on the most efficient neighborhoods for the problem. Extensive computational results are presented based on data from an application involving the daily observation scheduling of a fleet of earth observing satellites. The method rapidly solves most problem instances to optimal or near optimal and shows a robust performance in sensitive analysis.展开更多
There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced se...There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm （ESEA） to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.展开更多
文摘hrough the across-America-journey, in Jack Kerouac's renowned novel, On the Road, Sal Paradise and his friends accomplished a self-searching and truth-searching process.
文摘Objective To propose a new dynamic extremum self searching method, which can be used in industrial processes extremum optimum control systems, to overcome the disadvantages of traditional method. Methods This algorithm is based on correlation analysis. A pseudo random binary signal m sequence u(t) is added as probe signal in system input, construct cross correlation function between system input and output, the next step hunting direction is judged by the differential sign. Results Compared with traditional algorithm such as step forward hunting method, the iterative efficient, hunting precision and anti interference ability of the correlation analysis method is obvious over the traditional algorithm. The computer simulation experimental given illustrate these viewpoints. Conclusion The correlation analysis method can settle the optimum state point of device operating process. It has the advantage of easy condition , simple calculate process.
基金supported by the National Natural Science Foundation of China (7060103570801062)
文摘A self-adaptive large neighborhood search method for scheduling n jobs on m non-identical parallel machines with mul- tiple time windows is presented. The problems＇ another feature lies in oversubscription, namely not all jobs can be scheduled within specified scheduling horizons due to the limited machine capacity. The objective is thus to maximize the overall profits of processed jobs while respecting machine constraints. A first-in- first-out heuristic is applied to find an initial solution, and then a large neighborhood search procedure is employed to relax and re- optimize cumbersome solutions. A machine learning mechanism is also introduced to converge on the most efficient neighborhoods for the problem. Extensive computational results are presented based on data from an application involving the daily observation scheduling of a fleet of earth observing satellites. The method rapidly solves most problem instances to optimal or near optimal and shows a robust performance in sensitive analysis.
文摘较低的网络服务响应时间对提升用户体验至关重要.以搜索引擎这一典型的网络服务场景为例,服务提供商应确保网络服务(搜索)响应时间在1 s以内.在实践中,服务响应时间会受到用户浏览器、运营商、页面加载方式等诸多服务属性的影响.为了进行针对性的优化,服务提供商需要找出使服务响应时间过长的规则,即一些属性的组合.然而现有研究工作遇到了3方面挑战:1)搜索日志数据量大;2)搜索日志数据分布不平衡;3)要求泛化度高的规则.因此设计了Miner(multi-dimensional extraction of rules),一种新型服务响应时间异常诊断框架.Miner使用自步采样机制应对第1个挑战和第2个挑战.针对第3个挑战,Miner使用Corels算法挖掘出泛化率高且召回率高的规则.使用2家国内顶级搜索引擎服务提供商的响应时间日志数据评估了Miner性能,结果显示Miner的泛化率和召回率均高于现有方法,并证明了Miner挖掘出的规则可被运维人员采纳并做针对性的优化.
基金supported by the Aviation Science Funds of China(2010ZC13012)the Fund of Jiangsu Innovation Program for Graduate Education (CXLX11 0203)
文摘There are many population-based stochastic search algorithms for solving optimization problems. However, the universality and robustness of these algorithms are still unsatisfactory. This paper proposes an enhanced self-adaptiveevolutionary algorithm （ESEA） to overcome the demerits above. In the ESEA, four evolutionary operators are designed to enhance the evolutionary structure. Besides, the ESEA employs four effective search strategies under the framework of the self-adaptive learning. Four groups of the experiments are done to find out the most suitable parameter values for the ESEA. In order to verify the performance of the proposed algorithm, 26 state-of-the-art test functions are solved by the ESEA and its competitors. The experimental results demonstrate that the universality and robustness of the ESEA out-perform its competitors.
