期刊文献+
共找到8篇文章
< 1 >
每页显示 20 50 100
Vibration Suppression for Active Magnetic Bearings Using Adaptive Filter with Iterative Search Algorithm
1
作者 Jin-Hui Ye Dan Shi +2 位作者 Yue-Sheng Qi Jin-Hui Gao Jian-Xin Shen 《CES Transactions on Electrical Machines and Systems》 EI CSCD 2024年第1期61-71,共11页
Active Magnetic Bearing(AMB) is a kind of electromagnetic support that makes the rotor movement frictionless and can suppress rotor vibration by controlling the magnetic force. The most common approach to restrain the... Active Magnetic Bearing(AMB) is a kind of electromagnetic support that makes the rotor movement frictionless and can suppress rotor vibration by controlling the magnetic force. The most common approach to restrain the rotor vibration in AMBs is to adopt a notch filter or adaptive filter in the AMB controller. However, these methods cannot obtain the precise amplitude and phase of the compensation current. Thus, they are not so effective in terms of suppressing the vibrations of the fundamental and other harmonic orders over the whole speed range. To improve the vibration suppression performance of AMBs,an adaptive filter based on Least Mean Square(LMS) is applied to extract the vibration signals from the rotor displacement signal. An Iterative Search Algorithm(ISA) is proposed in this paper to obtain the corresponding relationship between the compensation current and vibration signals. The ISA is responsible for searching the compensating amplitude and shifting phase online for the LMS filter, enabling the AMB controller to generate the corresponding compensation force for vibration suppression. The results of ISA are recorded to suppress vibration using the Look-Up Table(LUT) in variable speed range. Comprehensive simulations and experimental validations are carried out in fixed and variable speed range, and the results demonstrate that by employing the ISA, vibrations of the fundamental and other harmonic orders are suppressed effectively. 展开更多
关键词 Active Magnetic Bearing(AMB) Adaptive filter iterative search algorithm Least mean square(LMS) Vibration suppression
下载PDF
A path planning method for robot patrol inspection in chemical industrial parks
2
作者 王伟峰 YANG Ze +1 位作者 LI Zhao ZHAO Xuanchong 《High Technology Letters》 EI CAS 2024年第2期109-116,共8页
Safety patrol inspection in chemical industrial parks is a complex multi-objective task with multiple degrees of freedom.Traditional pointer instruments with advantages like high reliability and strong adaptability to... Safety patrol inspection in chemical industrial parks is a complex multi-objective task with multiple degrees of freedom.Traditional pointer instruments with advantages like high reliability and strong adaptability to harsh environment,are widely applied in such parks.However,they rely on manual readings which have problems like heavy patrol workload,high labor cost,high false positives/negatives and poor timeliness.To address the above problems,this study proposes a path planning method for robot patrol in chemical industrial parks,where a path optimization model based on improved iterated local search and random variable neighborhood descent(ILS-RVND)algorithm is established by integrating the actual requirements of patrol tasks in chemical industrial parks.Further,the effectiveness of the model and algorithm is verified by taking real park data as an example.The results show that compared with GA and ILS-RVND,the improved algorithm reduces quantification cost by about 24%and saves patrol time by about 36%.Apart from shortening the patrol time of robots,optimizing their patrol path and reducing their maintenance loss,the proposed algorithm also avoids the untimely patrol of robots and enhances the safety factor of equipment. 展开更多
关键词 path planning robot patrol inspection iterated local search and random variableneighborhood descent(ILS-RVND)algorithm
下载PDF
Intelligent Iterated Local Search Methods for Solving Vehicle Routing Problem with Different Fleets
3
作者 李妍峰 李军 赵达 《Journal of Southwest Jiaotong University(English Edition)》 2007年第4期344-352,共9页
To solve vehicle routing problem with different fleets, two methodologies are developed. The first methodology adopts twophase strategy. In the first phase, the improved savings method is used to assign customers to a... To solve vehicle routing problem with different fleets, two methodologies are developed. The first methodology adopts twophase strategy. In the first phase, the improved savings method is used to assign customers to appropriate vehicles. In the second phase, the iterated dynasearch algorithm is adopted to route each selected vehicle with the assigned customers. The iterated dynasearch algorithm combines dynasearch algorithm with iterated local search algorithm based on random kicks. The second methodplogy adopts the idea of cyclic transfer which is performed by using dynamic programming algorithm, and the iterated dynasearch algorithm is also embedded in it. The test results show that both methodologies generate better solutions than the traditional method, and the second methodology is superior to the first one. 展开更多
关键词 Vehicle routing problem Savings method Iterated dynasearch algorithm Dynamic programming Iterated local search Random kick Cyclic transfer
下载PDF
Multi-satellite observation integrated scheduling method oriented to emergency tasks and common tasks 被引量:23
4
作者 Guohua Wu Manhao Ma +1 位作者 Jianghan Zhu Dishan Qiu 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2012年第5期723-733,共11页
Satellite observation scheduling plays a significant role in improving the efficiency of satellite observation systems.Although many scheduling algorithms have been proposed,emergency tasks,characterized as importance... Satellite observation scheduling plays a significant role in improving the efficiency of satellite observation systems.Although many scheduling algorithms have been proposed,emergency tasks,characterized as importance and urgency(e.g.,observation tasks orienting to the earthquake area and military conflict area),have not been taken into account yet.Therefore,it is crucial to investigate the satellite integrated scheduling methods,which focus on meeting the requirements of emergency tasks while maximizing the profit of common tasks.Firstly,a pretreatment approach is proposed,which eliminates conflicts among emergency tasks and allocates all tasks with a potential time-window to related orbits of satellites.Secondly,a mathematical model and an acyclic directed graph model are constructed.Thirdly,a hybrid ant colony optimization method mixed with iteration local search(ACO-ILS) is established to solve the problem.Moreover,to guarantee all solutions satisfying the emergency task requirement constraints,a constraint repair method is presented.Extensive experimental simulations show that the proposed integrated scheduling method is superior to two-phased scheduling methods,the performance of ACO-ILS is greatly improved in both evolution speed and solution quality by iteration local search,and ACO-ILS outperforms both genetic algorithm and simulated annealing algorithm. 展开更多
关键词 satellite scheduling emergency task ant colony optimization(ACO) iteration local search(ILS) acyclic directed graph model
下载PDF
An iterated local coordinate-exchange algorithm for constructing experimental designs for multi-dimensional constrained spaces 被引量:1
5
作者 YOU Yang JIN Guang +1 位作者 PAN Zhengqiang GUO Rui 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2021年第5期1212-1220,共9页
Iterated local search(ILS)is used to construct the optimal experimental designs for multi-dimensional constrained spaces,in which the inner loop is based on the stochastic coordinate-exchange(SCE)algorithm.Every time ... Iterated local search(ILS)is used to construct the optimal experimental designs for multi-dimensional constrained spaces,in which the inner loop is based on the stochastic coordinate-exchange(SCE)algorithm.Every time a local optimal solution is found by the SCE algorithm,the perturbation operator is applied to it,and then a new solution is explored in the areas where the exchange of coordinates may produce improvement,so as to retain the features and attributes of the current optimal solution and avoid the defects of random restart.We implement the iterated local coordinate-exchange algorithm for experimental designs in the multi-dimensional constrained spaces.In addition,sensitivity analysis was conducted to analyze the impacts of the parameters on the performance of the proposed algorithm.Also we compared the performance of the proposed algorithm to the SCE algorithm using the random restart strategy.The analysis shows that the proposed algorithm is better than the SCE algorithm in terms of efficiency and quality,especially in the experimental designs for high-dimensional constrained space. 展开更多
关键词 constrained space experimental design coordinate-exchange iterated local search(ILS)
下载PDF
Particle Swarm Optimization with Directed Mutation
6
作者 王杰 李红文 《Journal of Donghua University(English Edition)》 EI CAS 2016年第5期774-780,共7页
In the standard particle swarm optimization(SPSO),the big problem is that it suffers from premature convergence,that is,in complex optimization problems,it may easily get trapped in local optima.In order to mitigate p... In the standard particle swarm optimization(SPSO),the big problem is that it suffers from premature convergence,that is,in complex optimization problems,it may easily get trapped in local optima.In order to mitigate premature convergence problem,this paper presents a new algorithm,which is called particle swarm optimization(PSO) with directed mutation,or DMPSO.The main idea of this algorithm is to "let the best particle(the smallest fitness of the particle swarm) become more excellent and the worst particle(the largest fitness of the particle swarm) try to be excellent".The new algorithm is tested on a set of eight benchmark functions,and compared with those of other four PSO variants.The experimental results illustrate the effectiveness and efficiency of the DMPSO.The comparisons show that DMPSO significantly improves the performance of PSO and searching accuracy. 展开更多
关键词 swarm fitness benchmark illustrate premature mutation searching Mutation iteration trapped
下载PDF
Crossover Iterated Local Search for SDCARP 被引量:1
7
作者 An-Yang Liang Dan Lin 《Journal of the Operations Research Society of China》 EI 2014年第3期351-367,共17页
This paper introduces a new algorithm based on local search for the capacitated arc routing problem(CARP)and the split-delivery capacitated arc routing problem(SDCARP).We present a intermediate model to transfer CARP ... This paper introduces a new algorithm based on local search for the capacitated arc routing problem(CARP)and the split-delivery capacitated arc routing problem(SDCARP).We present a intermediate model to transfer CARP to SDCARP and then solve the two problems by an algorithm which combines the iterated local search and the memetic algorithm.We use crossovers to perform fully reproducible initializations in each local search iteration and edge-marking to save computation time.The computational results on 63 instances of standard benchmarks show that the proposed algorithm outperforms most of the existing best-known solutions obtained by other heuristics within a reasonable computing time.Furthermore,compared with the CARP solutions,our algorithm finds three optimums for the SDCARP. 展开更多
关键词 Capacitated arc routing problem Split-delivery Memetic algorithm Iterated local search
原文传递
The Jointed Decision Model on a Newsboy-type Ordering and Pricing for Retailer
8
作者 Bin Liu Hui Zhang Sifeng Liu 《Journal of Systems Science and Information》 2006年第3期467-475,共9页
This paper deals with the jointed decision question on ordering and pricing for a short-life-cycle product under stochastic multiplicative demand depended selling price. According to the marketing practices, which ret... This paper deals with the jointed decision question on ordering and pricing for a short-life-cycle product under stochastic multiplicative demand depended selling price. According to the marketing practices, which retailers sell their products in different periods with the different marketing policies, we depict the jointed decision question with a stochastic dynamic programming model from the view of the centralized system. Then, we prove that the expected profit function are concave on decision vectors respectively, and develop the decision method for ordering and pricing. Lastly, we design the iterative search arithmetic to find the optimal decision vectors. 展开更多
关键词 newsboy model jointed decision stochastic dynamic programming iterative search arithmetic multiplicative demand
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部