A Three-Layered Multifactorial Evolutionary Algorithm with Parallelization for Large-Scale Engraving Path Planning

Today, although laser engraving technology is widely used in 2D image engraving, when the image is larger and more complicated, most existing algorithms for engraving path planning have a huge computational burden and reduced engraving efficiency. Accordingly, this article addresses the trajectory o...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Electronics (Basel) Jg. 11; H. 11; S. 1712
Hauptverfasser: Liang, Antian, Yang, Hanshi, Sun, Liming, Sun, Meng
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Basel MDPI AG 01.06.2022
Schlagworte:
Computational efficiency
Efficiency
Engraving
Evolutionary algorithms
Genetic algorithms
Lasers
Methods
Optimization
Parallel processing
Trajectory optimization
Trajectory planning
Traveling salesman problem
ISSN:2079-9292, 2079-9292
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Today, although laser engraving technology is widely used in 2D image engraving, when the image is larger and more complicated, most existing algorithms for engraving path planning have a huge computational burden and reduced engraving efficiency. Accordingly, this article addresses the trajectory optimization problem in large-scale image engraving. First, we formulate the problem as an improved model based on the large-scale traveling salesman problem (TSP). Then, we propose a three-layered algorithm called 3L-MFEA-MP, structured as follows: an upper layer, the genetic algorithm (GA); a middle layer, the GA; and a bottom layer, the parallel multifactorial evolutionary algorithm. Experiments on four classic large-scale TSP datasets show that our algorithm exhibits superior performance in terms of the path length and engraving time compared with other algorithms. In particular, compared with the single-thread algorithm, the proposed parallel algorithm reduced the engraving time by 80%. Moreover, the engraving machine experiment demonstrated that the engraving time of our algorithm on mona-lisa 100K, vangogh 120K, and venus 140K was approximately one tenth that of the traditional dot engraving method. The results indicate that the proposed algorithm can reduce the computational burden and improve engraving efficiency in engraving path planning.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2079-9292
2079-9292
DOI:10.3390/electronics11111712