GA Implementation Path Optimization of Pneumatic Marking System

Article Preview

Abstract:

According to the characteristics of pneumatic marking system, and the typing path was seen as a TSP problem. After comparing the Dijkstra optimization algorithm of marking path results, and applying the genetic algorithm (GA) to analysis, research, and solve the optimization problem, reasonable to get print needle typing path. In this case, printing mark time was shorten as much as possible. It was proved by MATLAB simulation that the study can solve the problem of path optimization and improve the efficiency of marking greatly.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

390-393

Citation:

Online since:

September 2013

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] ZHANG Chu, LI Xiang-long, SONG Hong-wei. The design of ARM9-based pneumatic marking machine system [J]. The servo control . 2012, 1 (7): 85.

Google Scholar

[2] LIU Ping, GAO Jun, DINGXiao-ling. Steel structural typing path in the process of optimization traveling salesman problem solving [J]. Electronic Design Engineering, 2012, 20 (9): 7.

Google Scholar

[3] Misra J. A walk over the shortest path: Dijkstra's Algorithm viewed as fixed-point computation [J]. Information Processing Letters, 2001, 24: 30 – 35.

DOI: 10.1016/s0020-0190(00)00202-7

Google Scholar

[4] ZHOU Sheng, LI Rui, WANG Yang. Path Optimization Algorithm for NC Spraying Based on Genetic Algorithm[J]. Journal of Wuhan University of science and technology. 2013, 37(1): 71-73.

Google Scholar

[5] Merz P. Acomparison of mimetic recombination operators for the traveling salesman problem [J]. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO). (2002).

Google Scholar