Optimal Mechanism Design of a Shearing Machine Using an Ant Colony Optimization Algorithm

Abstract:

The shearing machine is an important and complex accessory equipment of the continue-mode rolling mills. Its mechanism design scheme determines the shearing quality of steel. The shearing machine mechanism design (SMMD) contains multi conflicting technical requirements and belongs to a multi objective optimization problem with the nonlinear constraints. Recently, ant colony optimization (ACO), a swarm based computing methods, has demonstrated its superiority in many complex optimization problems. This paper presented a quasi TSP-based SMMD model and an ACO algorithm for the SMMDP. The presented method dispersed the searching space of the design variables by setting several different search steps, and an ACO algorithm was adopted to search the best searching step of each design variable dynamically during the whole optimization process. Computational results showed that the proposed method can improve the computational accuracy and produce better solutions within short running times.

• Periodical: Applied Mechanics and Materials (Volumes 52-54)
• Pages: 938-942
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.52-54.938
• Online since: March 2011
• Authors: Jun Zhou Huo, Jing Chen, Zhen Li
• Keywords: Ant Colony Optimization (ACO), Mechanism Design, Multi-Objective Optimization (MOP), Shearing Machine

References

[1] Chen L Z and Zhang Y H. Optimal design of mechanism (M). Shanghai：Shanghai Science and Technology Press(1982).

[2] Chen L Z. (1981) Optimal mechanism design of the shearing machine'. Beijing Iron and Steel Institute, Mechanism design in China, s Third Symposium. Beijing：Journal of Beijing Iron and Steel Institute, (1982) pp.65-68.

[3] Colorni A, Dorigo M and Maniezzo V. Distributed optimization by ant colonies. Proceeding of the First European Congress on Artificial Life. Pans, France: Elsevier, (1991) pp.134-142.

[4] Dorigo M, Maniezzo V, Colorni A. Ant system: optimization by colony of cooperating agents. IEEE Transactions on System, Man and Cybernetics (Part B), Vol. 26 (1996), No. 1, pp.29-41.

DOI: 10.1109/3477.484436

[5] Dorigo M, Bonabeau E, Theraulaz G. Ant algorithm and stigmergy. Future Generation Computer Systems, Vol. 16(2000), No. 8, pp.851-871.

DOI: 10.1016/s0167-739x(00)00042-x

[6] Dorigo M, Gambardella L M. Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, Vol. 1 (1997), No. 1, pp.53-66.

DOI: 10.1109/4235.585892

[7] Talbi E G, Roux O, Fonlupt C, Robillard D. Parallel ant colonies for the quadratic assignment. Future Generation Computer Systems, Vol. 17 (2001), No. 4, pp.441-449.

DOI: 10.1016/s0167-739x(99)00124-7

[8] Colorni A. Ant system for the job-shop scheduling. JORBEL, Vol. 34(1994), No. 1, pp.39-53.

[9] Gambardella L M, Dorigo M. Solving symmetric and asymmetric TSPs by ant colonies. Proceeding of the IEEE Conference on Evolutionary Computation, (1996) pp.622-627.

DOI: 10.1109/icec.1996.542672

[10] Costa D, Hertz A, Dubuis O. Imbedding of a sequential algorithm within an evolutionary algorithm for coloring problem in graphs. Journal of heuristics, (1995) No. 1, pp.105-128.

DOI: 10.1007/bf02430368

[11] Wang Lei, Wu Qi-di. Ant system algorithm for optimization in continuous space. Proceeding of the 2001 IEEE International Conference on Control Applications, Mexico City, Mexico, Sept., (2001) pp.395-400.

DOI: 10.1109/cca.2001.973897

[12] Stützle T, Hoos H H. Max-min ant system. Future Generation Computer Systems, Vol. 16 (2000), No. 8, pp.889-914.

DOI: 10.1016/s0167-739x(00)00043-1