MATEC Web Conf.
Volume 336, 20212020 2nd International Conference on Computer Science Communication and Network Security (CSCNS2020)
|Number of page(s)||6|
|Section||Industrial Design and Engineering Technology|
|Published online||15 February 2021|
Optimization of one-dimensional wire cutting with variable length based on genetic ant colony algorithm
1 Jiangxi Vocational Technical College of Industry & Trade, 330038 Nanchang, China
2 College of Information Engineering, Nanchang University, 330031 Nanchang, China
* Corresponding author: email@example.com
This paper presents an algorithm of one-dimensional wire cutting based on genetic algorithm and ant colony algorithm. Firstly, the dominant solution is screened out by genetic algorithm and transformed into the initial accumulation of pheromone in ant colony algorithm, and then the ant colony algorithm is used to adjust the dominant solution of genetic algorithm to obtain the approximate optimal solution. The experimental results show that the convergence rate of the fusion algorithm is faster than that of the ant colony algorithm, and the utilization rate of raw materials is higher than that of genetic algorithm. In addition, the optimal parameters are obtained by adjusting the experimental parameters of the fusion algorithm.
© The Authors, published by EDP Sciences, 2021
This is an Open Access article distributed under the terms of the Creative Commons Attribution License 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.