Ant Colony Optimization for Optimal Control in Manufacturing Engineering

Article Preview

Abstract:

A meta-heuristic algorithm optimization, Ant Colony Optimization, is used to solve a general optimal control problem. Ant Colony Optimization is introduced briefly in this paper. The disc resection of the control time and control input is investigated. A piece wise interval is considered in the converting. And the simulation in numerical results show this strategy is feasible and effective.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

273-276

Citation:

Online since:

July 2013

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] E. Bonabeau, M. Dorigo, and G. Theraulaz (2000) Inspiration for Optimization from Social Insect Behaviour. Nature 1(5): 39-42.

DOI: 10.1038/35017500

Google Scholar

[2] L. Collatz (1960) the Numerical Treatment of Differential Equations. Berlin: Springer, 2(3): 5-17.

Google Scholar

[3] Cordon, F. Herrera, and Testable (2002) A review on the Ant Colony Optimization metaheuristic: basis, models and new trends. Math ware and Soft Computing3(6): 189-197.

Google Scholar

[4] M. Dorigo, Optimization (1992) Learning and Natural Algorithms. Ph.D. thesis, Polytechnic did Milano 4(6): 363-376.

Google Scholar

[5] M. Dorigo and L. M. Gambardella (1997) Ant Colonies for the Travelling Salesman Problem Biosystems 5(8): 259-274.

DOI: 10.1016/s0303-2647(97)01708-5

Google Scholar