Optimization of Spiral Drum Based on Improved Ant Colony Algorithm

2011 ◽  
Vol 403-408 ◽  
pp. 3022-3025
Author(s):  
Duan Yi Wang

Spiral drum as the work device of sheer, plays an important role for working performance and economic benefit .By analyzing the working principle of ant colony algorithm and its deficiencies; it proposed an improved ant colony algorithm to realize the optimization of spiral drum. In the paper, optimization model is established with coal-loading capacity as the objective function, and it make use of Matlab software to realize optimization of spiral drum.

2014 ◽  
Vol 721 ◽  
pp. 539-542
Author(s):  
Cong Cong Liu ◽  
Yi Cai He ◽  
Chang Peng An

From the actual operation of the lock, respectively, with the objections to maximize utilization of the average chamber area and minimize average opening time and the product of the weight of the ship and minimize lock operating costs, it can make the use of AHP calculate the right target weight, so as to establish a multi-objective function model. Based on the constraints of each objection, it can be used improved ant colony algorithm for multi-site on the same river ship Joint operation, using MATLAB software for solving scheduling simulation, the results shows that the utilization and lock navigable levels have significantly improved . It proved this method can be used to optimize multi-site joint scheduling.


2014 ◽  
Vol 1037 ◽  
pp. 357-362
Author(s):  
Zhen Jun He ◽  
Peng Xu ◽  
Jiang Xiao Liao

By applying improved ant colony algorithm, this paper analyzed multi-objective design problem in optimal design of cam mechanism profile curve, which were then transformed into TSP problem, that is, multi-objective function minimization problem into TSP shortest path searching problem. For the multiple complex variables and target weight parameters in design, a concept of multidimensional space node in ant colony optimization path was proposed, converting multi-objective function with weight coefficient into a multidimensional space nodes (city).At the same time, improved ant colony algorithm, combined with genetic algorithm, was used to avoid optimization calculation falling into a locally optimal solution. Exemplified by dual objective function in cam mechanism profile curve design, this paper solved optimal value problem of dual objective optimization design involving the biggest fullness coefficient and minimum abrasion quantity of variable weight coefficient under the three-dimensional parameters n, m and w.


2011 ◽  
Vol 314-316 ◽  
pp. 1278-1281
Author(s):  
Zhi Qi Huang

Using the improved Ant Colony Algorithm to optimize torsion bar diameter, and take the optimization results into practice. Results not only show the Ant Colony Algorithm is feasible and provides a new method choosing torsion bar diameter but also is satisfied.Based on maximum deformation energy and not exceeding the allowable stress values of a torsion-bar spring, the thesis builds the optimization model for the self-balancing torsion bar.


2012 ◽  
Vol 482-484 ◽  
pp. 2470-2474 ◽  
Author(s):  
Li Yi Zhang ◽  
Teng Fei ◽  
Yun Shan Sun

Emergency logistics distribution, as an important role, is the key to the whole logistics. Emergency logistics is mainly reflected in emergency. For the disaster, economic benefit is not the first thing to be thought about. High efficiency is the key to emergency logistics. This article concentrates on path optimization of emergency logistics distribution. Propose emergency logistics distribution path optimization model which considers timeliness as the first goal. Utilize Simulated Annealing Ant Colony Algorithm to search for optimization. Based on simulation, Simulated Annealing Ant Colony Algorithm owns better timeliness to solve emergency logistics distribution.


2013 ◽  
Vol 390 ◽  
pp. 495-499 ◽  
Author(s):  
Bi Wei Tang ◽  
Zhan Xia Zhu ◽  
Qun Fang ◽  
Wei Hua Ma

The effectiveness of path planning and path replanning for intelligent robot using improved ant colony algorithm is explored in this paper. For the purpose of avoiding falling into local optimum and preventing iterative stagnant, this paper describes a new algorithm named stochastic self-adaptive ant colony algorithm to improve the basic ant colony algorithm. Based on the improved ant colony algorithm, the approaches of path planning and path replanning are presented in this paper. Aiming at improving the speed of the algorithm and simplifying the objective function of traditional path planning, this paper presents a principle of eliminating the path nodes .Finally, some constrast emulators are designed.The simulation results proves that the improved ant colony algorithm has strong adaptability in intelligent robots path path planning and replanning.


Sign in / Sign up

Export Citation Format

Share Document