z-logo
open-access-imgOpen Access
A multi-objective optimization for brush monofilament tufting process design
Author(s) -
Ali Salmasnia,
Saeed Hasannejad,
Hadi Mokhtari
Publication year - 2017
Publication title -
journal of computational design and engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.764
H-Index - 24
eISSN - 2288-5048
pISSN - 2288-4300
DOI - 10.1016/j.jcde.2017.08.001
Subject(s) - mathematical optimization , multi objective optimization , metaheuristic , travelling salesman problem , pareto principle , process (computing) , computer science , mathematics , operating system
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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom