期刊文献+
共找到4篇文章
< 1 >
每页显示 20 50 100
Electro-Hydraulic Servo System Identification of Continuous Rotary Motor Based on the Integration Algorithm of Genetic Algorithm and Ant Colony Optimization 被引量:1
1
作者 王晓晶 李建英 +1 位作者 李平 修立威 《Journal of Donghua University(English Edition)》 EI CAS 2012年第5期428-433,共6页
In order to increase the robust performance of electro-hydraulic servo system, the system transfer function was identified by the intergration algorithm of genetic algorithm and ant colony optimization(GA-ACO), which ... In order to increase the robust performance of electro-hydraulic servo system, the system transfer function was identified by the intergration algorithm of genetic algorithm and ant colony optimization(GA-ACO), which was based on standard genetic algorithm and combined with positive feedback mechanism of ant colony algorithm. This method can obtain the precise mathematic model of continuous rotary motor which determines the order of servo system. Firstly, by constructing an appropriate fitness function, the problem of system parameters identification is converted into the problem of system parameter optimization. Secondly, in the given upper and lower bounds a set of optimal parameters are selected to meet the best approximation of the actual system. And the result shows that the identification output can trace the sampling output of actual system, and the error is very small. In addition, another set of experimental data are used to test the identification result. The result shows that the identification parameters can approach the actual system. The experimental results verify the feasibility of this method. And it is fit for the parameter identification of general complex system using the integration algorithm of GA-ACO. 展开更多
关键词 continuous rotary motor system identification genetic algorithm and ant colony optimization (GA-ACO) algorithm
在线阅读 下载PDF
Power Line Communications Networking Method Based on Hybrid Ant Colony and Genetic Algorithm
2
作者 Qianghui Xiao Huan Jin Xueyi Zhang 《Engineering(科研)》 2020年第8期581-590,共10页
When solving the routing problem with traditional ant colony algorithm, there is scarce in initialize pheromone and a slow convergence and stagnation for the complex network topology and the time-varying characteristi... When solving the routing problem with traditional ant colony algorithm, there is scarce in initialize pheromone and a slow convergence and stagnation for the complex network topology and the time-varying characteristics of channel in power line carrier communication of low voltage distribution grid. The algorithm is easy to fall into premature and local optimization. Proposed an automatic network algorithm based on improved transmission delay and the load factor as the evaluation factors. With the requirements of QoS, a logical topology of power line communication network is established. By the experiment of MATLAB simulation, verify that the improved Dynamic hybrid ant colony genetic algorithm (DH_ACGA) algorithm has improved the communication performance, which solved the QoS routing problems of power communication to some extent. 展开更多
关键词 Power Line Carrier Communication Network Quality of Service Hybrid ant colony and genetic algorithm
在线阅读 下载PDF
Genetic algorithm for short-term scheduling of make-and-pack batch production process 被引量:1
3
作者 Wuthichai Wongthatsanekorn Busaba Phruksaphanrat 《Chinese Journal of Chemical Engineering》 SCIE EI CAS CSCD 2015年第9期1475-1483,共9页
This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage ti... This paper considers a scheduling problem in industrial make-and-pack batch production process. This process equips with sequence-dependent changeover time, multipurpose storage units with limited capacity, storage time, batch splitting, partial equipment connectivity and transfer time. The objective is to make a production plan to satisfy all constraints while meeting demand requirement of packed products from various product families. This problem is NP-hard and the problem size is exponentially large for a realistic-sized problem. Therefore,we propose a genetic algorithm to handle this problem. Solutions to the problems are represented by chromosomes of product family sequences. These sequences are decoded to assign the resource for producing packed products according to forward assignment strategy and resource selection rules. These techniques greatly reduce unnecessary search space and improve search speed. In addition, design of experiment is carefully utilized to determine appropriate parameter settings. Ant colony optimization and Tabu search are also implemented for comparison. At the end of each heuristics, local search is applied for the packed product sequence to improve makespan. In an experimental analysis, all heuristics show the capability to solve large instances within reasonable computational time. In all problem instances, genetic algorithm averagely outperforms ant colony optimization and Tabu search with slightly longer computational time. 展开更多
关键词 genetic algorithm ant colony optimization Tabu search Batch scheduling Make-and-pack production Forward assignment strategy
在线阅读 下载PDF
Research on a Task Planning Method for Multi-Ship Cooperative Driving 被引量:4
4
作者 CHEN Yaojie XIANG Shanshan CHEN Feixiang 《Journal of Shanghai Jiaotong university(Science)》 EI 2019年第2期233-242,共10页
A new method for a cooperative multi-task allocation problem(CMTAP) is proposed in this paper,taking into account the multi-ship, multi-target, multi-task and multi-constraint characteristics in a multi-ship cooperati... A new method for a cooperative multi-task allocation problem(CMTAP) is proposed in this paper,taking into account the multi-ship, multi-target, multi-task and multi-constraint characteristics in a multi-ship cooperative driving(MCD) system. On the basis of the general CMTAP model, an MCD task assignment model is established. Furthermore, a genetic ant colony hybrid algorithm(GACHA) is proposed for this model using constraints, including timing constraints, multi-ship collaboration constraints and ship capacity constraints. This algorithm uses a genetic algorithm(GA) based on a task sequence, while the crossover and mutation operators are based on similar tasks. In order to reduce the dependence of the GA on the initial population, an ant colony algorithm(ACA) is used to produce the initial population. In order to meet the environmental constraints of ship navigation, the results of the task allocation and path planning are combined to generate an MCD task planning scheme. The results of a simulated experiment using simulated data show that the proposed method can make the assignment more optimized on the basis of satisfying the task assignment constraints and the ship navigation environment constraints. Moreover, the experimental results using real data also indicate that the proposed method can find the optimal solution rapidly, and thus improve the task allocation efficiency. 展开更多
关键词 multi-ship cooperative task allocation path planning MULTI-TASK MULTI-OBJECTIVE genetic ant colony hybrid algorithm(GACHA)
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部