Accelerating 3D Printing Process Using an Extended Ant Colony Optimization Algorithm

Kai Yin Fok, Chi Tsun Cheng, Nuwan Ganganath, Herbert Ho Ching Iu, Chi K. Tse

Research output: Chapter in Book/Conference paperConference paper

1 Citation (Scopus)

Abstract

Ant colony optimization (ACO) algorithms have been widely adopted in solving combinatorial problems, like the traveling salesman problem (TSP). Nevertheless, with a proper transformation to TSP, ACO is capable of solving undirected rural postman problems (URPP) as well. In fact, nozzle path planning problems in 3D printing can be represented as URPP. Therefore, in this work, ACO is utilized as a URPP solver to accelerate the printing process in fused deposition modeling applications. Furthermore, mechanisms which exploit unique properties in 3D models are proposed to further extend the ACO in the above optimization process. These mechanisms are capable of accelerating ACO by adaptively adjusting its number of iterations on-the-fly. Simulation results using real-life 3D models show that the proposed extensions can accelerate ACO without affecting the quality of its solutions significantly.

Original languageEnglish
Title of host publication2018 IEEE International Symposium on Circuits and Systems, ISCAS 2018 - Proceedings
PublisherIEEE, Institute of Electrical and Electronics Engineers
Volume2018-May
ISBN (Electronic)9781538648810
DOIs
Publication statusPublished - 26 Apr 2018
Event2018 IEEE International Symposium on Circuits and Systems, ISCAS 2018 - Firenze Fiera Congress and Exhibition Center, Florence, Italy
Duration: 27 May 201830 May 2018

Conference

Conference2018 IEEE International Symposium on Circuits and Systems, ISCAS 2018
CountryItaly
CityFlorence
Period27/05/1830/05/18

Fingerprint

Ant colony optimization
Printing
Traveling salesman problem
Motion planning
Nozzles

Cite this

Fok, K. Y., Cheng, C. T., Ganganath, N., Iu, H. H. C., & Tse, C. K. (2018). Accelerating 3D Printing Process Using an Extended Ant Colony Optimization Algorithm. In 2018 IEEE International Symposium on Circuits and Systems, ISCAS 2018 - Proceedings (Vol. 2018-May). [8351113] IEEE, Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISCAS.2018.8351113
Fok, Kai Yin ; Cheng, Chi Tsun ; Ganganath, Nuwan ; Iu, Herbert Ho Ching ; Tse, Chi K. / Accelerating 3D Printing Process Using an Extended Ant Colony Optimization Algorithm. 2018 IEEE International Symposium on Circuits and Systems, ISCAS 2018 - Proceedings. Vol. 2018-May IEEE, Institute of Electrical and Electronics Engineers, 2018.
@inproceedings{9135f07eef6949e89bfbb7466f24affc,
title = "Accelerating 3D Printing Process Using an Extended Ant Colony Optimization Algorithm",
abstract = "Ant colony optimization (ACO) algorithms have been widely adopted in solving combinatorial problems, like the traveling salesman problem (TSP). Nevertheless, with a proper transformation to TSP, ACO is capable of solving undirected rural postman problems (URPP) as well. In fact, nozzle path planning problems in 3D printing can be represented as URPP. Therefore, in this work, ACO is utilized as a URPP solver to accelerate the printing process in fused deposition modeling applications. Furthermore, mechanisms which exploit unique properties in 3D models are proposed to further extend the ACO in the above optimization process. These mechanisms are capable of accelerating ACO by adaptively adjusting its number of iterations on-the-fly. Simulation results using real-life 3D models show that the proposed extensions can accelerate ACO without affecting the quality of its solutions significantly.",
keywords = "3D printing, Additive manufacturing, Ant colony optimization, Undirected rural postman problem",
author = "Fok, {Kai Yin} and Cheng, {Chi Tsun} and Nuwan Ganganath and Iu, {Herbert Ho Ching} and Tse, {Chi K.}",
year = "2018",
month = "4",
day = "26",
doi = "10.1109/ISCAS.2018.8351113",
language = "English",
volume = "2018-May",
booktitle = "2018 IEEE International Symposium on Circuits and Systems, ISCAS 2018 - Proceedings",
publisher = "IEEE, Institute of Electrical and Electronics Engineers",
address = "United States",

}

Fok, KY, Cheng, CT, Ganganath, N, Iu, HHC & Tse, CK 2018, Accelerating 3D Printing Process Using an Extended Ant Colony Optimization Algorithm. in 2018 IEEE International Symposium on Circuits and Systems, ISCAS 2018 - Proceedings. vol. 2018-May, 8351113, IEEE, Institute of Electrical and Electronics Engineers, 2018 IEEE International Symposium on Circuits and Systems, ISCAS 2018, Florence, Italy, 27/05/18. https://doi.org/10.1109/ISCAS.2018.8351113

Accelerating 3D Printing Process Using an Extended Ant Colony Optimization Algorithm. / Fok, Kai Yin; Cheng, Chi Tsun; Ganganath, Nuwan; Iu, Herbert Ho Ching; Tse, Chi K.

2018 IEEE International Symposium on Circuits and Systems, ISCAS 2018 - Proceedings. Vol. 2018-May IEEE, Institute of Electrical and Electronics Engineers, 2018. 8351113.

Research output: Chapter in Book/Conference paperConference paper

TY - GEN

T1 - Accelerating 3D Printing Process Using an Extended Ant Colony Optimization Algorithm

AU - Fok, Kai Yin

AU - Cheng, Chi Tsun

AU - Ganganath, Nuwan

AU - Iu, Herbert Ho Ching

AU - Tse, Chi K.

PY - 2018/4/26

Y1 - 2018/4/26

N2 - Ant colony optimization (ACO) algorithms have been widely adopted in solving combinatorial problems, like the traveling salesman problem (TSP). Nevertheless, with a proper transformation to TSP, ACO is capable of solving undirected rural postman problems (URPP) as well. In fact, nozzle path planning problems in 3D printing can be represented as URPP. Therefore, in this work, ACO is utilized as a URPP solver to accelerate the printing process in fused deposition modeling applications. Furthermore, mechanisms which exploit unique properties in 3D models are proposed to further extend the ACO in the above optimization process. These mechanisms are capable of accelerating ACO by adaptively adjusting its number of iterations on-the-fly. Simulation results using real-life 3D models show that the proposed extensions can accelerate ACO without affecting the quality of its solutions significantly.

AB - Ant colony optimization (ACO) algorithms have been widely adopted in solving combinatorial problems, like the traveling salesman problem (TSP). Nevertheless, with a proper transformation to TSP, ACO is capable of solving undirected rural postman problems (URPP) as well. In fact, nozzle path planning problems in 3D printing can be represented as URPP. Therefore, in this work, ACO is utilized as a URPP solver to accelerate the printing process in fused deposition modeling applications. Furthermore, mechanisms which exploit unique properties in 3D models are proposed to further extend the ACO in the above optimization process. These mechanisms are capable of accelerating ACO by adaptively adjusting its number of iterations on-the-fly. Simulation results using real-life 3D models show that the proposed extensions can accelerate ACO without affecting the quality of its solutions significantly.

KW - 3D printing

KW - Additive manufacturing

KW - Ant colony optimization

KW - Undirected rural postman problem

UR - http://www.scopus.com/inward/record.url?scp=85057073731&partnerID=8YFLogxK

U2 - 10.1109/ISCAS.2018.8351113

DO - 10.1109/ISCAS.2018.8351113

M3 - Conference paper

VL - 2018-May

BT - 2018 IEEE International Symposium on Circuits and Systems, ISCAS 2018 - Proceedings

PB - IEEE, Institute of Electrical and Electronics Engineers

ER -

Fok KY, Cheng CT, Ganganath N, Iu HHC, Tse CK. Accelerating 3D Printing Process Using an Extended Ant Colony Optimization Algorithm. In 2018 IEEE International Symposium on Circuits and Systems, ISCAS 2018 - Proceedings. Vol. 2018-May. IEEE, Institute of Electrical and Electronics Engineers. 2018. 8351113 https://doi.org/10.1109/ISCAS.2018.8351113