Improved Genetic-ant Algorithm for the Optimization of Rapid Prototyping Contour Path

DOI

10.2991/emeit.2012.124How to use a DOI?

Keywords

Rapid prototyping, Contour path optimization, Improved genetic-ant algorithm, Time distance, Dual integer coding

Abstract

In rapid prototyping contour scanning process, to reduce the spare travel time, a mathematical model which has considered the minimal time distance is established. The situation that the starting point is different from the end point is analyzed. In the improved genetic-ant algorithm, the dual integer coding is adopted to optimize the contour scanning order and starting point of contour simultaneously, we adopt genetic algorithm to produce initialization pheromone, and realize the fusion of ant colony algorithm and genetic algorithm. In the hybrid algorithm, the new state transition rule is adopted, dynamic volatile coefficient is adopted for pheromone updating, the pheromone and elicitation information are used to choose crossover and mutation positions. The computation result shows that the algorithm can optimize the rapid prototyping contour path effectively.

Copyright

© 2012, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Baoye Liu
AU  - Jianjun Yang
AU  - Shaoshuai Guo
PY  - 2012/09
DA  - 2012/09
TI  - Improved Genetic-ant Algorithm for the Optimization of Rapid Prototyping Contour Path
BT  - Proceedings of the 2nd International Conference on Electronic & Mechanical Engineering and Information Technology (EMEIT 2012)
PB  - Atlantis Press
SP  - 590
EP  - 593
SN  - 1951-6851
UR  - https://doi.org/10.2991/emeit.2012.124
DO  - 10.2991/emeit.2012.124
ID  - Liu2012/09
ER  -