http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
A multi-objective optimization for brush monofilament tufting process design
Salmasnia, Ali,Hasannejad, Saeed,Mokhtari, Hadi Society for Computational Design and Engineering 2018 Journal of computational design and engineering Vol.5 No.1
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.
A multi-objective optimization for brush monofilament tufting process design
Ali Salmasnia,Saeed Hasannejad,Hadi Mokhtari 한국CDE학회 2018 Journal of computational design and engineering Vol.5 No.1
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.