<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>P. Dwivedi, V. Kant, K. K. Bharadwaj Learning path recommendation based on modi ed variable
length genetic algorithm. Procedia - Education and Information Technologies</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <title-group>
        <article-title>Development and Research of Algorithms for the Formation the Individual Educational Tra jectories of Students in the Digital Educational Platform</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Veronika V. Zaporozhko</string-name>
          <email>zaporozhko vv@mail.osu.ru</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Denis I. Parfenov</string-name>
          <email>fdot it@mail.osu.ru</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Maria Lapina</string-name>
          <email>mlapina@ncfu.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Daniele Sora</string-name>
          <email>sora@dis.uniroma1.it</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>North Caucasus Federal University</institution>
          ,
          <addr-line>Stavropol, Russia, 355017</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Orenburg State University</institution>
          ,
          <addr-line>Orenburg, Russia, 460018</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Sapienza University of Rome</institution>
          ,
          <addr-line>Roma, Italy, 00185</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2019</year>
      </pub-date>
      <volume>23</volume>
      <issue>2</issue>
      <fpage>20</fpage>
      <lpage>23</lpage>
      <abstract>
        <p>At present, the widespread use of modern information technologies in education, including open online courses, ensures the sustainable development of a single digital educational environment. However, one of the key problems of the mass approach to learning is the construction of individual educational trajectories. Taking into account the individual characteristics of each student is an urgent necessity. Achieving this goal is quite feasible when teaching students on individual learning routes. In this paper we have investigated two approaches to solving this problem. The rst approach is based on the use of a genetic algorithm that allows you to form the optimal learning route, designed to meet the personal educational needs and individual capabilities of each student of the online course. The second approach involves the mathematical apparatus of neural networks give recommendations on the further optimal formation of an individual educational trajectory. The paper presents the results of experimental studies and examples of individual trajectories formed on the basis of the proposed algorithms.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>An important direction in improving the education system in many countries is the implementation of the
concept of a modern digital educational environment. Massive open online courses (MOOCs) are considered
as one of the main components of this environment. The advantage of MOOCs is that the learner gets access
to world-class knowledge regardless of his location, social status and other characteristics that are signi cant
for traditional forms of education [Zap17]. Due to a signi cant number of students on MOOC platforms, it is
possible to collect a large amount of data to form a pro le of the learner. However, today the lack of an individual
and di erentiated approach to each student is one of the main drawbacks of MOOCs. This is due to the fact
that existing MOOC platforms mainly implement only one pre-determined learning route by the course author.
Therefore, one of the important areas for improving MOOCs is to provide complex personi cation. The need
for personi cation of learning is a re ection of the natural desire for mankind to take an individual approach to
personal opportunities, features, requests and preferences [Par18]. As part of this study, we proposed an approach
that allows the intellectual management of individual educational trajectories in a particular online course. This
approach is an algorithmic solution that forms the optimal trajectory of an individual learning route for each
student by forming sets of learning objects. The basis for the algorithm for managing individual educational
trajectories in MOOCs is the approach based on a hybrid combination of the Heuristic and cybernetic Data
Mining methods. In particular, a genetic algorithm is used to form an individual set of learning objects. The
constructed algorithm allows to dynamically development and correct the individual educational trajectory of
each student depending on a set of parameters: diagnostic questionnaire results, tests score, features of perception
and memorization of the material and others.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Related Work</title>
      <p>At present, the amount of research devoted to the problem of development an individual educational trajectory
in the implementation of the concept of the digital educational environment is permanently growing. Here are
presented various approaches to the generation of individual learning route.</p>
      <p>Researchers from the National Taiwan Normal University suggested using adaptive computer testing to identify
problems in mastering individual blocks in the online course learning process. The database stores information
about courses with given coe cients of di culty. Based on the results of testing, the selection of appropriate
courses with the lowest coe cient of labor input is carried out. Using the obtained data, the automated system
generates an optimal individual training program for each student, using a genetic algorithm [Hon05].</p>
      <p>A group of Taiwan scientists in their study suggested solving the problem of identifying the ability to learn
and the di culty level of the recommended curriculum's to each other. This problem is key when generate
an individual learning route. To collect data within the framework of the study, the scientists conducted the
assessment of students after mastering each block of educational content. The evaluation was carried out through
computerized adaptive testing. The test results were then used to form the optimal route for each student. The
approach proposed in the study is based on the hybrid use of the genetic algorithm and the case-based reasoning
[Hua07].</p>
      <p>Samia Azough et al. (Morocco) used a genetic algorithm to generate pedagogical paths which are adapted to
the learner pro le and to the current formation pedagogical objective. In its study they developed the description
of an adaptive e-learning system. The system proposed by the authors allows the learner to study courses adapted
to his pro le. To implement adaptive learning, researchers applied two-step work of the genetic algorithm. At
the rst stage, the proposed mechanism is used to form optimal trajectories for the search for learning goals,
taking into account data from the student's pro le. At the second stage, the results obtained were adapted using
data obtained from social networks [Han18].</p>
      <p>A team of researchers from the University of Alcala (Spain) investigated how to perform dynamic selection of
learning objects based on the genetic algorithm for constructing a course structure depending on the input set
of competencies (formed in the learner) and the output (planned learning outcomes) [Mar11].</p>
      <p>A number of studies of scientists from China are devoted to the preparation of individual tasks in the test
form using genetic[Yao14]. The proposed approaches are summarized and implemented in the form of the Online
Automatic Test System for various MOOC platforms.</p>
      <p>A team of researchers from Russia proposed a method for constructing an individual learning route that
meets the requirements of the user. In order to form learning paths, authors use domain ontology, on the
basis of which separate learning objects are selected. Each learning object is complemented by sets of input and
output competences that are ranked according to the Bloom's Revised Taxonomy (Remembering, Understanding,
Applying, Analyzing, Evaluating, Creating). The genetic algorithm is used to construct the most appropriate
educational trajectory from the available learning objects [Shm15].</p>
      <p>Pragya Dwivedi et al. (India) formed individual educational trajectories in an online environment using a
genetic algorithm with a variable length representation. The application of this algorithm provides a exible
duration of the recommended training course for each learner based on his learning style and level of knowledge.
The original data is exported from the student's pro le. Individual educational trajectories are built, taking into
account information about the graduates of the course [Dwi05].</p>
      <p>As part of his research, Sibel Somyurek (Turkey) provided an overview of adaptive multimedia education
systems for the period from 2002 to 2012. The review presented by the author made it possible to identify
technological trends and approaches in this area of research. The author made a special emphasis on modular
structures, intellectual analysis of data, methods of machine learning and neural networks [Gol89].</p>
      <p>Zacharoula Papamitsiou and Anastasios A. Economides (Macedonia) carried out research in the eld of
Learning Analytics and Educational Data Mining, revealing the impact of these technologies on adaptive learning
[Bha10].</p>
      <p>Researcher F. Okubo et. al. (Japan) suggested methods that predict student estimates using the Recurrent
Neural Network based on journal data stored in educational systems [Bha10].</p>
      <p>A team of researchers from Taiwan in their study conducted a de nition of the learner's learning style based
on his behavior in the browser. The proposed approach is based on the use of the multi-layer feed forward neural
network (MLFF). In this study, the authors touched on several factors on the basis of which they assessed the
behavior of the learner in the browser. In their opinion, the main factors are the following: the use of built-in
auxiliary devices (ESD), navigation through links. The use of this approach has made it possible to adapt the
educational environment to the needs and capabilities of the learner [Hua07].</p>
      <p>In a study by R. Stathacopoulou et. al. (Greece) an approach is presented in which neuro-fuzzy synergism is
used to evaluate students in the context of an intellectual learning system. In this study, the authors created a
model of the student, on the basis of which he can evaluate information about his knowledge [Par18].</p>
      <p>In the framework of the study by Cristina Conati et. al. (U.S.A.) in an intellectual learning system explored
the capabilities of the Bayesian neural network for conducting a long-term assessment of knowledge, determining
the plan and predicting the actions of students. The authors noted that the advantage of the proposed approach
is the update of the network in real time. For this, an approximation algorithm based on a stochastic sample
was used. Information from the model is used to help students and adapt the support system [Mar11].</p>
      <p>Thus, the conducted review of researches has shown the urgency of development optimal individual learning
routes and their correct in real time. At the same time, the heuristic algorithms are the main tool that allows
the most e ective management of individual educational trajectories.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Approaches For Forming Of An Individual Learning Trajectory In MOOC's</title>
      <p>In this research to solve the problem of forming an individual learning trajectory in MOOC we will use a hybrid
approach based on a combination of intelligent methods of data analysis and heuristic algorithms. When forming
an individual trajectory, we will take into account the peculiarities of students' perception and memorization of
information (in other words { from the learning style) [Azo10]. At the same time, using the neural networks
algorithm the educational route will be formed on the basis of the learning objects included in the online course
units. Let us dwell in more detail on the implementation of the neural networks approach.</p>
      <p>Let us present the initial data for solving the claimed problem with the help of the mathematical tools of
the genetic algorithm. Having analyzed the subject area of the task, we have identi ed the following tuple,
characterizing the formation process of the individual educational trajectory (IET).</p>
      <p>IET = (S; C; P );
(1)
where S = (sk) { the set of students learning a particular MOOC, k { number of students, K N ; C = U nitx {
MOOC, located in a cloud-based learning environment and consisting of units, x { number of units in a particular
course, x N .</p>
      <p>Each unit of the MOOC contains a speci c set of content groups. Then let G = g1; : : : ; gn { the set of
generalized content type groups, when n { number of these groups, n=4. Each group contains a certain set of learning
objects gi = LOi;j , where LOi;j { the set of LOs in each unit, belonging to the selected generalized group gi
(Table ??). U nitx = G1; : : : ; G4. Then P = P1; : : : ; Pn is a valid set of individual routes for each student.
Each individual learning route should consist of a speci c set of LOi;j di erent types such as Presentations
(slides), textbooks with diagrams, owcharts, pictures, etc.); Infographics (mind maps, charts, diagrams, etc.),
illustrations (pictures, posters); Webinars (video online meetings); Video lessons, recording screencasts, animated
video clips (2D 3D animation); Audio conferencing and online meetings; Audio notes; Audio lessons
(recordings); Workbooks audio; Glossaries (thesaurus, dictionaries); Reading (lecture notes, ebooks, tutorials, manuals,
WUnitx =</p>
      <p>D
Y ( h;sk )bh ;
h=1
WSk =</p>
      <p>Z
Y(ay;sk ) h ;
y=1
reports, articles, interactive textbooks, documents); Quizzes (or tests); Assignments (self-reports, tasks, essays,
exercises, project works, mini action researches); Games (educational games, including simulation video games,
virtual worlds); Virtual laboratories (interactive training systems); Interactive learning models; Workshops.</p>
      <p>Each learning object LOi;j can take part in the formation of an individual learning route with its mandatory
entry into a generalized group gi. For the purposes of formalization, we introduce the Boolean variables 0 or 1,
which describe alternatives to the selection of learning objects, i.e. LOi;j = 0; 1.</p>
      <p>Each object of the sets G and S can be represented as a set of attributes that numerically characterize these
objects. Attributes are de ned on a limited set of positive values. The de nition of characteristics and values of
attributes (parameters) for the identi ed sets. The task of determining the value of the attribute coe cient and
the relative weight of the attribute is solved using empirical data, obtained as a result of the questionnaire, and
expert estimates. To identify the relative weights of these attributes, experts were asked who ranked attribute
values in descending order of importance.</p>
      <p>The weight of each unit in the course is determined by the following formula:
where h;sk - attribute coe cient value h for unit depending on the particular type of student sk; bh {
relative weight of attribute gh for unit .</p>
      <p>To select an individual learning route in MOOC, you also need to nd the weight of the student. The weight
of each student is determined by the following formula
(2)
(3)
where ay;sk - attribute coe cient value a y for student sk, h - relative weight of attribute ay.</p>
      <p>In the process of optimization under consideration, the parameter space under study is su ciently large. The
task does not require a strict global optimum, so it is su cient to nd an acceptable, most suitable (e ective)
solution in a short time.</p>
      <p>To solve the optimization problem, we developed an algorithm for controlling the process of formation of an
educational trajectory using a neural network. Compared to existing analogues, the algorithm uses heuristic
analysis of data streams generated by students during the MOOC study. All the data collected are classi ed
and ranked according to their importance, both for the particular course and for the learner. The exibility
of the proposed solution is due to the ability to dynamically change the educational trajectory in the course
of the course study. The proposed solution is transparent for the trainee, forming an educational trajectory by
selecting the required type of content. Dynamic content formation in the process of studying the course not only
reduces the risks associated with reducing the e ectiveness of information perception, but also allows the learner
to motivate the study of the material. The proposed algorithmic solution allows not only to choose the type of
content in terms of the form of its perception, but also to determine the necessary block (theory or practice).</p>
      <p>To conduct the formation of the educational trajectory as a neural structure, the Kohonen network was
chosen, since it most e ectively performs clustering and classi cation of objects. An equally important factor
is the visualization of the results, which allows, at an early stage, to improve understanding of the structure
and nature of the data, and further re ne the neural network model. Due to the peculiarities of virtual network
functions, support for classi cation in the Kohonen network can be used to identify homogeneous elements,
which will further optimize their choice for lling the course. The training of the Kohonen network is carried
out by the method of successive approximations. Starting with a randomly chosen initial location of the centers,
the algorithm gradually improves it so that it captures the clustering of training data. Another advantage of
the Kohonen network is the ability to identify new clusters. The trained network recognizes clusters in training
data and assigns all data to one or another cluster. If the network then meets a data set that is unlike any of
the known samples, it will independently identify a new cluster of elements. This feature is very relevant, since
it allows you to enter into the online course new types of objects without actually changing the algorithms for
their assignment to students.</p>
      <p>The principle of constructing a neural network system for optimizing the choice of course elements is as
follows. Based on the data received from the training systems, we developed a number of criteria that can not
only identify the course element, but also determine the need for its replacement. The criteria are formulated so
that the answer can always be presented in binary form, that is, 1 - "Yes" or 0 - "No". Based on the obtained
data, a signal vector E = fe1; e2; :::; eng, which is fed to the input of the neural network. The neural network is
a two-dimensional matrix of neurons of dimension n (the number of inputs of each neuron) per m (the number
of neurons). The number of inputs of each neuron is determined in relation to the previously established number
of criteria. The number of neurons m coincides with the required number of partition classes, which corresponds
to the number of unique course elements available on the digital educational platform. The signi cance of each
of the inputs to the neuron is characterized by a numerical value called the weight, and is given in the form of
a matrix X where the elements of the given matrix are the vectors of the weighting coe cients of the bonds
xi;j = nxi1;j ; xi2;j ; ; xin;j o.</p>
      <p>The Kohonen network consists of three layers of neurons. The basis of the network is the hidden layer of
Kohonen. However, in order to obtain results for the simultaneous identi cation and assignment of the course
element in the study, we proposed a modi ed scheme of the output neurons of the Kohonen network (Fig. 1).
input layer
covert layer</p>
      <p>output layer
1
2
3
...
n
1
2</p>
      <p>The hidden layer of the Kohonen neural network is proposed to be divided into two sets. The rst set of
neurons [1:::K] is responsible for identifying the element of the course assigned to the learner in the course of
the course. During the operation of the neural network, by changing the input weights on the output layer,
it activates the linear function Y1, which takes the values [0; n]. At the same time, 0 means that the studied
element of the course refers to the content of a non-critical value in the course of studying a particular course.
For example, technical information or guidelines for working with the most digital educational platform. The
numbers from 1 to n correspond to the speci c course element identi ed by the neural network model. The
second set of neurons [L:::Z] analyzes the load state of the course element being examined and at the output
initializes the function Y2, taking values [0; 1], where 0 element does not require replacement for the trainee, -1
- means that the content needs to be changed.</p>
      <p>To train the neural network in the framework of the study, the method of multi-page training was used.
From the mathematical point of view, the training of neural networks is a multiparameter problem of nonlinear
optimization. In the classical method of back propagation of an error (single-mode), the training of neural
networks is considered as a set of one-criterion optimization problems. The criterion for each task is the quality
of the solution of one example from the training sample. At each iteration of the backward propagation algorithm,
the parameters of the neural networks are modi ed to improve the solution of one example. Thus, in the learning
process, one-criteria optimization problems are cyclically solved.</p>
      <p>From the theory of optimization, it follows that in the solution of multicriteria problems, parameter modi
cations should be performed using several criteria at once. Moreover, one example cannot be con ned to evaluating
the changes in the values of parameters. In order to take into account several criteria, parameters are aggregated
or integrated, which may be, for example, the sum, weighted sum or the square root of the sum of the squares
of the solution estimates of individual examples.</p>
      <p>In particular, in the present studies, the change in weights was carried out after checking the entire training
sample, while the error function was calculated as:</p>
      <p>E(w) =
where, k - number of the training pair in the training sample, k = 1; 2; ; n1 + n2; n1 - number of vectors
of the rst class; n2 - number of vectors of the second class. As test tests show, training with the use of batch
mode, as a rule, converges faster than learning by individual examples. The received information from the
neural network is used to optimize the educational trajectory within the online course. To do this, a map of the
optimal location of the course elements for a particular learner is formed, as well as possible changes, taking into
account the individual characteristics of the learner and the information accumulated in the learning process.
By analyzing the two maps and the heuristic forecasting algorithm, the learning management system makes a
decision about adjusting the course structure and restructuring the training routes for the learner. At the same
time, both maps are dynamic objects, formed not only as certain events occur in the digital educational platform,
but also with a speci ed time interval, selected individually for each student.
4</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusion And Future Works</title>
      <p>In the framework of the our research we outlined the solution to the complex task of forming an individual
educational trajectory in MOOC based on the selection of the type of content. A mathematical tools based on
the application of a genetic algorithm is described. We also describe in the algorithm for the intelligent control
of individual educational trajectories in MOOCs based on the neural network approach. Now we are testing
the portal (http://56bit.ru/) for online courses in computer science. As part of our research, it is established
that the proposed algorithm increases the e ectiveness and quality of the knowledge obtained in the course of
mastering the online course chosen by the student's. This result are expressed in the achievement of student's
planned learning outcomes, growth in the motivation of course participants, their satisfaction with the learning
process.</p>
      <p>Our further developments will be related to ensuring a permanent correction of the calculated individual
educational trajectories based on student's academic history, achievements and rating. In the future, we apply
clustering for the di erentiation of students into homogeneous groups. This is necessary for the issuance of
personal recommendations and selection of students for joint implementation of projects within the online course.
To identify students who may not be able to cope with the performance of the assessment task, we will use
forecasting methods.
5</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgements References</title>
      <p>The reported study was funded by RFBR according to the research project 18-37-00400 and 19-47-560011.
[Hon05] C. M. Hong, C. M. Chen, M. H. Chang Personalized Learning Path Generation Approach for Web-based</p>
      <p>Learning. 4th WSEAS Int. Conf. on E-ACTIVITIES, 62{68, 2005.
[Hua07] M. J. Huang, H. S. Huang Constructing a personalized e-learning system based on genetic algorithm
and case-based reasoning approach. Procedia - Expert Systems with Applications, 33(3):551{564, 2007.
[Bha10] A. M. F. Bhaskar, M. M. Das, T. Chithralekha, S. Sivasatya Genetic Algorithm Based Adaptive
Learning Scheme Generation For Context Aware E-Learning. Procedia - International Journal on
Computer Science and Engineering, 2(4):1271{1279, 2010.
[Mar11] L. de-Marcos, et.c. Genetic algorithms for courseware engineering. Procedia - International Journal of</p>
      <p>Innovative Computing, Information and Control, 7(7):1{27, 2011.
[Zha18] X. Zhang, L. Cao, Y. Yin Individualized Learning through MOOC: Online Automatic Test System
Based on Genetic Algorithm. 16 Proceedings of the International Conference on Intelligent Information
Processing, 2018.
[Gol89] D. E. Goldberg Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley,
432, 1989.
[Zap17] V. Zaporozhko, D. Parfenov, I. Parfenov. Approaches to the description of model massive open online
course based on the cloud platform in the educational environment of the university. International
Conference on Smart Education and Smart e-Learning, 75:177{187, 2017.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [Shm15]
          <string-name>
            <given-names>V.</given-names>
            <surname>Shmelev</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Karpova</surname>
          </string-name>
          ,
          <string-name>
            <surname>A. Dukhanov</surname>
          </string-name>
          <article-title>An Approach of Learning Path Sequencing based on Revised Bloom's Taxonomy and Domain Ontologies with the use of Genetic Algorithms</article-title>
          . Procedia - Computer Science,
          <volume>66</volume>
          :
          <fpage>711</fpage>
          {
          <fpage>719</fpage>
          ,
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <surname>[Hua07] M. J. Huang</surname>
            ,
            <given-names>H. S.</given-names>
          </string-name>
          <string-name>
            <surname>Das</surname>
            ,
            <given-names>M. Y.</given-names>
          </string-name>
          <string-name>
            <surname>Chen</surname>
          </string-name>
          .
          <article-title>Constructing a personalized e-learning system based on genetic algorithm and case-based reasoning approach</article-title>
          .
          <source>Procedia - Expert Systems with Applications</source>
          ,
          <volume>33</volume>
          (
          <issue>3</issue>
          ):
          <volume>551</volume>
          {
          <fpage>564</fpage>
          ,
          <year>2007</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [Par18]
          <string-name>
            <given-names>D.</given-names>
            <surname>Parfenov</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Zaporozhko</surname>
          </string-name>
          .
          <article-title>Developing SMART educational cloud environment on the basis of adaptive massive open online courses</article-title>
          .
          <source>Conference Internationalization of Education in Applied Mathematics and Informatics for HighTech Applications</source>
          ,
          <year>2093</year>
          :
          <volume>35</volume>
          {
          <fpage>41</fpage>
          ,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>[Mar11] L. de-Marcos</surname>
            ,
            <given-names>J. J.</given-names>
          </string-name>
          <string-name>
            <surname>Martinez</surname>
            ,
            <given-names>J. A.</given-names>
          </string-name>
          <string-name>
            <surname>Gutierrez</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          <string-name>
            <surname>Barchino</surname>
            ,
            <given-names>J. R.</given-names>
          </string-name>
          <string-name>
            <surname>Hilera</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          <string-name>
            <surname>Oton</surname>
            ,
            <given-names>J. M.</given-names>
          </string-name>
          <string-name>
            <surname>Gutierrez</surname>
          </string-name>
          .
          <article-title>Genetic algorithms for courseware engineering</article-title>
          . Procedia - International
          <source>Journal of Innovative Computing, Information and Control</source>
          ,
          <volume>7</volume>
          (
          <issue>7</issue>
          ):1{
          <fpage>27</fpage>
          ,
          <year>2011</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [Azo10]
          <string-name>
            <given-names>S.</given-names>
            <surname>Azough</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Bellafkih</surname>
          </string-name>
          ,
          <string-name>
            <surname>El</surname>
            <given-names>H.</given-names>
          </string-name>
          <string-name>
            <surname>Bouyakhf. Adaptive</surname>
          </string-name>
          E
          <article-title>-learning using Genetic Algorithms</article-title>
          . Procedia - IJCSNS
          <source>International Journal of Computer Science and Network Security</source>
          ,
          <volume>10</volume>
          (
          <issue>7</issue>
          ):
          <volume>237</volume>
          {
          <fpage>244</fpage>
          ,
          <year>2010</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>