A multi-objective optimization for brush monofilament tufting process design

被引:0
作者
Salmasnia, Ali [1 ]
Hasannejad, Saeed [2 ]
Mokhtari, Hadi [3 ]
机构
[1] Univ Qom, Fac Engn & Technol, Dept Ind Engn, Qom, Iran
[2] Eyvanekey Univ, Dept Ind Engn, Fac Engn, Eyvanekey, Iran
[3] Univ Kashan, Dept Ind Engn, Fac Engn, Kashan, Iran
关键词
Monofilament tufting; Traveling Salesman Problem; Multi-Objective Optimization; NSGA-II; MOPSO; PRINTED-CIRCUIT BOARD; DEPENDENT SETUP TIMES; EVOLUTIONARY ALGORITHMS; CUTTING PARAMETERS; GENETIC ALGORITHMS; SELECTION; MODEL;
D O I
10.1016/j.jcde.2017.08.001
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This paper addresses the optimization of monofilament tufting process as the most important and the main stage of toothbrush production in sanitary industries. In order to minimize both process time and depreciation costs, and ultimately increase the production efficiency in such an industrial unit, we propose a metaheuristic based optimization approach to solve it. The Traveling Salesman Problem (TSP) is used to formulate the proposed problem. Then by using multi-objective evolutionary algorithms, NSGA-II and MOPSO, we seek to obtain the best solution and objective functions described above. Extensive computational experiments on three different kinds of toothbrush handles are performed and the results demonstrate the applicability and appropriate performance of algorithms. The comparison metrics like spacing, number of Pareto solutions, time, mean distance from the ideal solution and diversity are used to evaluate the quality of solutions. Moreover a sensitivity analysis is done for investigation of the performance in various setting of parameters. (C) 2017 Society for Computational Design and Engineering. Publishing Services by Elsevier. This is an open access article under the CC BY-NC-ND license.
引用
收藏
页码:120 / 136
页数:17
相关论文
共 34 条
[1]   Bi-objective hybrid flow shop scheduling with sequence-dependent setup times and limited buffers [J].
Abyaneh, Sina Hakimzadeh ;
Zandieh, M. .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2012, 58 (1-4) :309-325
[2]   Application of the NSGA-II algorithm to a multi-period inventory-redundancy allocation problem in a series-parallel system [J].
Alikar, Najmeh ;
Mousavi, Seyed Mohsen ;
Ghazilla, Raja Ariffin Raja ;
Tavana, Madjid ;
Olugu, Ezutah Udoncy .
RELIABILITY ENGINEERING & SYSTEM SAFETY, 2017, 160 :1-10
[3]   The optimization of printed circuit board manufacturing by improving the drilling process productivity [J].
Ancau, Mircea .
COMPUTERS & INDUSTRIAL ENGINEERING, 2008, 55 (02) :279-294
[4]  
[Anonymous], THESIS
[5]  
[Anonymous], 2006, Int J Comput Intell Res, DOI DOI 10.5019/J.IJCIR.2006.68
[6]   Optimizing drilling conditions in printed circuit board by considering hole quality - Optimization from viewpoint of drill-movement time [J].
Aoyama, E ;
Hirogaki, T ;
Katayama, T ;
Hashimoto, N .
JOURNAL OF MATERIALS PROCESSING TECHNOLOGY, 2004, 155 :1544-1550
[7]   Bi-criteria flexible job-shop scheduling with sequence-dependent setup times-Variable neighborhood search approach [J].
Bagheri, A. ;
Zandieh, M. .
JOURNAL OF MANUFACTURING SYSTEMS, 2011, 30 (01) :8-15
[8]   Adaptive multi-objective genetic algorithms for scheduling of drilling operation in printed circuit board industry [J].
Chang, Pei-Chann ;
Hsieh, Jih-Chang ;
Wang, Chih-Yuan .
APPLIED SOFT COMPUTING, 2007, 7 (03) :800-806
[9]   Genetic algorithm-based optimization of cutting parameters in turning processes [J].
D'Addona, Doriana M. ;
Teti, Roberto .
FORTY SIXTH CIRP CONFERENCE ON MANUFACTURING SYSTEMS 2013, 2013, 7 :323-328
[10]   Reliable classification of two-class cancer data using evolutionary algorithms [J].
Deb, K ;
Reddy, AR .
BIOSYSTEMS, 2003, 72 (1-2) :111-129