Weaving scheduling based on an improved ant colony algorithm
Source abstract
Abstract
Weaving enterprises are faced with problems of small batches and many varieties, which leads to difficulties in manual scheduling during the production process, resulting in more delays in delivery. Therefore, an automatic scheduling method for the weaving process is proposed in this paper. Firstly, a weaving production scheduling model is established based on the conditions and requirements during actual production. By introducing flexible model constraints, the applicability of the model has been greatly expanded. Then, an improved ant colony algorithm is proposed to solve the model. To address the problem of the traditional ant colony algorithm that the optimizing process usually traps into local optimum, the proposed algorithm adopts an iterative threshold and the maximum and minimum ant colony system. In addition, the initial path pheromone distribution is formed according to the urgency of the order to balance each objective. Finally, the simulation experiments confirm that the proposed method achieves superior performance compared with manual scheduling and other automatic methods. The proposed method shows a certain guiding significance for weaving scheduling in practice.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Scheduling and Optimization Algorithms · Advanced Manufacturing and Logistics Optimization · Assembly Line Balancing Optimization
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Key Laboratory of Eco-textiles, Ministry of Education, Jiangnan University, China
References (35)
Show source-provided references
1. 10.1016/j.chieco.2011.03.00310.1016/j.chieco.2011.03.003 ↗
2. Haroun AE · J Sci Technol · 2012 · 9 · 234
3. 10.1016/j.cie.2006.01.00110.1016/j.cie.2006.01.001 ↗
4. Han J · J Syst Simulat · 2008 · 20 · 6839
5. 10.1016/j.eswa.2009.04.07510.1016/j.eswa.2009.04.075 ↗
6. 10.1080/00405000.2014.99546310.1080/00405000.2014.995463 ↗
7. Yan S · Electron Des Eng · 2015 · 23 · 116
8. Zhou L · J Clean Prod · 2016 · 09 · 721
9. 10.1016/j.knosys.2016.10.02610.1016/j.knosys.2016.10.026 ↗
10. Eroglu DY · J Text Inst · 2017 · 108 · 110.1080/00405000.2015.1133105 ↗
11. 10.1287/opre.9.3.29610.1287/opre.9.3.296 ↗
12. 10.4028/www.scientific.net/AMM.548-549.148310.4028/www.scientific.net/AMM.548-549.1483 ↗
13. Gong J · Oper Res Trans · 2016 · 248 · 453
14. 10.1016/S0924-0136(00)00720-210.1016/S0924-0136(00)00720-2 ↗
15. 10.1016/0305-0483(89)90059-510.1016/0305-0483(89)90059-5 ↗
16. Huang Z · Mini Micro Syst · 2005 · 34 · 211
17. 10.1016/j.cie.2018.01.00510.1016/j.cie.2018.01.005 ↗
18. 10.1016/j.eswa.2009.04.07510.1016/j.eswa.2009.04.075 ↗
19. Brahmadeep TS. A discrete event simulation model with genetic algorithm optimisation for customised textile production scheduling. Artificial Intelligence for Fashion Industry in the Big Data Era 2018; 05: 153–171.10.1007/978-981-13-0080-6_8 ↗
20. 10.4028/www.scientific.net/AMR.462.7110.4028/www.scientific.net/AMR.462.71 ↗
21. Amuthakkannan R · Int J Serv Oper Manag · 2010 · 7 · 215
22. 10.1016/j.asoc.2012.01.01110.1016/j.asoc.2012.01.011 ↗
23. 10.1016/j.asoc.2017.08.01310.1016/j.asoc.2017.08.013 ↗
24. Li X · Comput Ind Eng · 2017 · 131 · 1241
25. 10.1016/j.ins.2014.10.00910.1016/j.ins.2014.10.009 ↗
26. Gounot Y J R, Musafir R E. Genetic algorithms: A global search tool to find optimal equivalent source sets. J Sound Vibr 2009; 322: 282–298.10.1016/j.jsv.2008.11.001 ↗
27. Eberhart YS. Particle swarm optimization: developments, applications and resources. In: IEEE international conference on evolutionary computation (Derek Abbott) , Honolulu, USA, 12-17 May 2002, no. 01TH8546, pp.81-86. Washington: IEEE.10.1109/CEC.2001.934374 ↗
28. Qin G · Inform Contr · 2002 · 31 · 198
29. 10.1016/j.future.2003.07.01510.1016/j.future.2003.07.015 ↗
30. Montgomery J, Randall M and Hendtlass T. Structural advantages for ant colony optimisation inherent in permutation scheduling problems. In: International conference on industrial, engineering and other applications of applied intelligent systems (Moonis Ali, Floriana Esposito) , Bari, Italy, 22–24 June 2005, no. B00LKN9USY, pp.218–228. Berlin, Heidelberg: Springer.10.1007/11504894_31 ↗
31. 10.1109/3477.48443610.1109/3477.484436 ↗
32. 10.1109/4235.58589210.1109/4235.585892 ↗
33. Pan J and Wang D. An ant colony optimization algorithm for multiple travelling salesman problem. In: first international conference on innovative computing, information and control (Khanna, Gupta) , Beijing, China, 30 August -1 September 2006, no. 9123099, pp.210-213. Washington: IEEE.10.1109/ICICIC.2006.40 ↗
34. Li L · Comput Eng Appl · 2019 · 55 · 219
35. Ferdous SM · ResearchGate · 2014 · 24 · 187