See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/236645932

Application of Genetic Algorithms in Knitting Technology

Article  in  Journal of the Textile Institute · October 2005

DOI: 10.1533/joti.2004.0064

CITATIONS READS

16 165

2 authors, including:

Mirela Blaga
Gheorghe Asachi Technical University of Iasi
62 PUBLICATIONS   149 CITATIONS   

SEE PROFILE

Some of the authors of this publication are also working on these related projects:

E-learning course for innovative textile fields - Advan2Tex View project

TexMatrix - Matrix of knowledge for innovation and competitiveness in textile enterprises View project

All content following this page was uploaded by Mirela Blaga on 26 January 2018.

The user has requested enhancement of the downloaded file.

This article was downloaded by: [Universitatea Tehnica Gheorghe Asachi]
On: 16 January 2013, At: 08:13
Publisher: Taylor & Francis
Informa Ltd Registered in England and Wales Registered Number: 1072954 Registered office: Mortimer
House, 37-41 Mortimer Street, London W1T 3JH, UK

Journal of The Textile Institute

Publication details, including instructions for authors and subscription information:
http://www.tandfonline.com/loi/tjti20

Application of genetic algorithms in knitting

technology
M. Blaga & M. Draghici
a
‘Gh. Asachi’ Technical University, Faculty of Textiles and Leather, Iasi, Romania
b
‘Gh. Asachi’ Technical University, Faculty of Textiles and Leather, Iasi, Romania
Version of record first published: 08 Jul 2010.

To cite this article: M. Blaga & M. Draghici (2005): Application of genetic algorithms in knitting technology, Journal of The
Textile Institute, 96:3, 175-178

To link to this article: http://dx.doi.org/10.1533/joti.2004.0064

PLEASE SCROLL DOWN FOR ARTICLE

Full terms and conditions of use: http://www.tandfonline.com/page/terms-and-conditions

This article may be used for research, teaching, and private study purposes. Any substantial or systematic
reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to
anyone is expressly forbidden.

The publisher does not give any warranty express or implied or make any representation that the contents
will be complete or accurate or up to date. The accuracy of any instructions, formulae, and drug doses
should be independently verified with primary sources. The publisher shall not be liable for any loss, actions,
claims, proceedings, demand, or costs or damages whatsoever or howsoever caused arising directly or
indirectly in connection with or arising out of the use of this material.
 Application of genetic algorithms in knitting
technology
doi:10.1533/joti.2004.0064
M. Blaga and M. Draghici
‘Gh. Asachi’ Technical University, Faculty of Textiles and Leather, Iasi, Romania

Abstract: The paper presents an original software, Knitting Machine Simulator (KMS), developed
to design and to optimize a knitting machine’s cam profiles. The program applies a genetic algorithm
over a real-time knitting machine simulation in order to test the generated cam profiles.
Downloaded by [Universitatea Tehnica Gheorghe Asachi] at 08:13 16 January 2013

Key words: Genetic algorithm, knitting, cams, software, optimization. DirectX, KMS.

WHAT IS A GENETIC ALGORITHM? Generate Evaluate Are Yes Best

initial objective optimization
individuals
A genetic algorithm applies the principles of evolution population function criteria met?

found in nature to the problem of finding an optimal No

solution to a solver problem. In a genetic algorithm, the
problem is encoded in a series of bit strings that are
manipulated by the algorithm.
In practical problems, we often want to optimize more
than one measure of performance at once. The measures
may conflict with each other, and it can be unsatisfactory
to combine them into a single optimization objective, or
reduce them in some way so that only one is optimized.
By using evolutionary computation, parallel
optimization techniques such as genetic algorithms (GA)
mean we can find a set of Pareto – optimal solutions, in
which each cost is found so that the whole set is no worse
than any other set of solutions. A decision maker can make
the final decision between the sets of solutions in an
informed way. The use of the additional information from
the evolutionary process can be incorporated to improve
the choice offered to the decision maker.
Evolutionary algorithms model natural processes, such
as selection, recombination, mutation and migration.
Figure 1 shows the structure of a simple genetic algorithm
(Chipperfield and Fleming, 2003).
Evolutionary algorithms differ substantially from more
traditional search and optimization methods. The most
significant differences are:
• Evolutionary algorithms search a population of points
in parallel, not a single point;
Corresponding Author:
Mirela Blaga
‘Gh. Asachi’ Technical University, Textile and Leather Faculty
53 D. Mangeron Str.
700050, Iasi, Romania
Tel: +40 740078570
Email: mblaga@tex.tuiasi.ro
Start Selection
Generate new
population Recombination
Mutation
Figure 1 Structure of a simple genetic algorithm.
• Evolutionary algorithms do not require derivative
information or other auxiliary knowledge;
• Evolutionary algorithms use probabilistic transition
rules, not deterministic ones;
• Evolutionary algorithms can provide a number of
potential solutions to a given problem. The final choice
is left to the user.
KMS SOFTWARE APPLICATION, DEVELOPED BY THE
AUTHORS
The Knitting Machine Simulator (KMS) – Cams
Generator Module represents a software developed to
design a knitting machine’s cam profiles. The program
applies a genetic algorithm over a real-time knitting
machine simulation in order to test the generated cam
profiles. The KMS program uses a genetic evolving
algorithm, adapted for optimizing the knitting machine’s
cam profile. The benefit of the method is that numerous
parameters and situations can be taken into account and
the precision of the final cam profile is adjustable and
very high.
The user has the possibility to establish the following
geometrical characteristics of the raising cam (Draghici

© The Textile Institute 0159 175 JOTI 2004 Vol. 96 No. 3 pp. 175–178
 M. Blaga and M. Draghici
and Blaga, 2004): the height (h), the bottom length (L),
and the top length of the cam (l). The difference between
the top and bottom length will determine its angle (α).
When shaping the cam, the algorithm will not change its
profile beyond these dimensions. In order to obtain the
profile optimization, the program generates an individual
population, named ‘chromosomes’.
Each chromosome will contain dates referring to the
profile of a cam, using genes. The number of genes is the
same for all individuals of the same population. To describe
a cam profile using genes, dividing the height of the cam
with the number of genes in the chromosome is used, a
value describing the length of the cam at the height of the
gene being attributed to each cam. An example of a gene
information generated cam can be seen in Fig. 2.
Downloaded by [Universitatea Tehnica Gheorghe Asachi] at 08:13 16 January 2013
The software offers the facilities detailed in the following
sections.
Generation of an initial population
The first cam is generated starting from the user-specified
characteristics and will have a linear profile. The others
will be obtained by applying the mutation operator upon
the linear profile cam. A cam will be generated until the
number of chromosomes specified by the user is reached.
Evaluation of the population
The evaluation of the population has as its purpose the
attribution of a mark to each individual from the current
population. The mark is given depending on the shear
force on the butt of the needle. The shear force is the
force that determines the destruction of the needle butt
(Fig. 3).
For the evaluation of the shear force, each cam undergoes
a simulated working test. The test consists of one run of
the cam. During its movement, the impact between the
needle butts and the cam is detected, and the forces
appearing at the collision are calculated, recording the
shear forces and applying an impulse to the needle,
depending on the impact. The optimization of the
maximum shear force leads to a reduction in the initial
l
h
α L
Legend: h – cam height; l – cam top length; L – cam bottom
length; α – cam angle.
Figure2 Cam generated by gene information.
JOTI 2005 Vol. 96 No. 3
Figure 3 The calculated forces at the impact between the needle
butt and the cam
Legend: Dark force: the force that raises the needle; Light force:
the shear force.
impact between the cam and the needle butt, and the
optimization of the average and dispersion ensures the
search for a cam with a profile as uniform as possible and
with the least variations of the shear force.
Selection of chromosomes
The selection of chromosomes takes place to eliminate
the specimens that have weak results from the new family.
The program utilizes a selection algorithm based on sorting
which utilizes selection pressure. The final mark of the
cam depends on the family to which it belongs. Its
belonging to a family is decided through the calculation
of the distance between the chromosomes using the
Hamming method, which establishes the number of genes
by which two chromosomes differ. This criteria allows
the search within a wider range of solutions and ensures
selection of the optimal profile.
Generation of a new population
In the new population, only the chromosomes with the
best grades will be copied (the elitist strategy) to keep the
good characteristics of these. After the crossing and
mutation, cams with wrong profiles can be obtained (Fig.
4) and they are excluded from the next family; the cam
with a better profile (Fig. 5) than that of the previous
generation cam will have more descendents.
After the evaluation of a new population of
chromosomes, the algorithm is restored from the
‘population evaluation’ step.
BRIEF PROGRAM INTERFACE PRESENTATION
The program is designed in Visual C++, based on a user-
friendly interface (Fig. 6) using Direct X technology. The
program records every action made and the cam profiles
in separate files on the hard-disk. Each generation is stored
in a separate folder; the last two populations are saved.
176 doi:10.1533/joti.2004.0064 © The Textile Institute
 Application of genetic algorithms in knitting technology
Downloaded by [Universitatea Tehnica Gheorghe Asachi] at 08:13 16 January 2013

Figure 4 Cam with wrong profile. Figure 5 Cam with better profile.

Figure 7 ‘Select Machine/Simulation Settings’ window.

Figure 6 The main menus of the KMS.

This way, the program can be restored from the last step.
If the final position is not finalized, the program returns
to the generation before last. To start a new search, the
‘Genetic algorithm’ window is used. Here the test name
is inserted, the file-path location, the number of genes,
and the number of chromosomes of the current test, as
well as dates regarding the cam to be generated: base
length, top length, height and width of the cam.
The ‘Select Machine/Simulation’ window (Fig. 7) sets
different machine configurations, such as the number of
needle beds, the needle number on which the test will
take place, the angle between the needle beds, the distance
between them, the knockover depth, the knitting speed Figure 8 ‘KMS Cams Generator’ in the cam setting stage.

© The Textile Institute doi:10.1533/joti.2004.0064 177 JOTI 2005 Vol. 96 No. 3

 M. Blaga and M. Draghici
and the knitting cycles during which the test of the cam
will happen.
The user may setup the following characteristics:
– the time evolution method, which can be a constant or
a variable between frames;
– the constant time duration established in the ‘Time’
field
The ‘Cams Generator Module’ has also a routine that
allows the visualization of obtained marks by the
chromosomes of a population and the visualization and
printing of a 2-dimensional image of the cam profile, named
‘KMS–Mesh Profile Viewer’. Figure 8 represents the KMS
Cams Generator in the cam-setting stage.
Downloaded by [Universitatea Tehnica Gheorghe Asachi] at 08:13 16 January 2013
CONCLUSIONS
The ‘Knitting Machine Simulator – Cams Generator
Module’ (KMS) is based on the principles and method of
genetic algorithms, which applied in textile fields is opening
a new challenge for knitting cam designers. The software
is fully compatible with all Microsoft Windows platforms,
so does not involve supplementary costs for the user. The
JOTI 2005 Vol. 96 No. 3
View publication stats
advantage of the method is that data are obtained in real
time, from the simulation, not pre-calculated values, so
an interval of initial impact points on the cam can be
obtained that the program will consider when modeling
the profile of the cam. The utilization of KMS software
in knitting machine cam design ensures a reduction of
the time for the design process of about 25%, which will
involve lower costs for this phase.
The ‘Knitting Machine Simulator – Cams Generator
Module’ (KMS) represents an original tool for the
generating and optimization of cam profiles for knitting
machines.
REFERENCES
CHIPPERFIELD, A. and FLEMING, P. J., 2003. An Overview of
Evolutionary Algorithms for Control Systems Engineering,
Department of Automatic Control and Systems
Engineering, University of Sheffield.
(
DRAGHICI, M. and BLAGA, M. 2004. Knitting Machine Simulator
– Cams Generator Modules, Proceedings of the IX
International Conference on the Theory of Machines and
Mechanisms, Technical University of Liberec, Department
of Textile Machine Design, Czech Republic.
178 doi:10.1533/joti.2004.0064 © The Textile Institute