<!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 />
    <article-meta>
      <title-group>
        <article-title>Swarm Intelligence Layer to Control Autonomous Agents (SWILT)</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Martina Umlauft</string-name>
          <email>umlauft@lakeside-labs.com</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Walter Laure</string-name>
          <email>Walter.Laure@infineon.com</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Andreas Wuttei</string-name>
          <email>andreas.wuttei@novunex.com</email>
          <xref ref-type="aff" rid="aff3">3</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Alpen-Adria-Universitat Klagenfurt</institution>
          ,
          <country country="AT">Austria</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>In neon Technologies Austria AG</institution>
          ,
          <addr-line>IFAT</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Lakeside Labs GmbH (LLabs) Klagenfurt</institution>
          ,
          <country country="AT">Austria</country>
        </aff>
        <aff id="aff3">
          <label>3</label>
          <institution>Novunex GmbH</institution>
          ,
          <addr-line>NoX</addr-line>
        </aff>
      </contrib-group>
      <fpage>91</fpage>
      <lpage>96</lpage>
      <abstract>
        <p>The project SWILT focuses on swarms of cyber-physical system (CPS)s in industrial plants (e.g., formed of products, machines, or equipment). CPSs nd their application in many disciplines including Internet of Things (IoT), smart mobility, smart grids, Industry 4.0 and smart houses. Swarms of CPSs are even more complex, hard to control and program. To handle the complexity of swarms of CPSs, natural systems can serve as inspiration. Only through their interactions, a collective behaviour emerges to solve complex tasks. SWILT considers the use cases of production scheduling in industrial plants and transportation in logistics. Currently, linear optimization is a widely used approach but due to the increasing complexity it is typically performed only on a subset of the industrial plant. Thus, current methods are unable to cope with the search space of scheduling problems in large industrial plants. Since the problem sizes in these use cases are extremely large and pre-calculated schedules or transportation tables are not su cient, the innovation is to use swarm algorithms with reactive local rules on individual agents which are able to compensate for dynamic system changes via local interactions within their vicinity.</p>
      </abstract>
      <kwd-group>
        <kwd>Cyber-physical system zation</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Project data</title>
      <p>Acronym:
Title:
Start date:
Duration:
Partners:
Website:</p>
    </sec>
    <sec id="sec-2">
      <title>Introduction</title>
      <p>Cyber-physical systems (CPSs) have strongly intertwined hardware and software
components, and nd their application in many disciplines including IoT, smart
mobility, smart grids, Industry 4.0, and smart homes. In many cases, CPSs are
connected to other CPSs forming a system of systems or a swarm. Such swarms
of CPSs are even more complex, hard to control and program. This is re ected in
the current situation of the manufacturing processes for wafers. The production
of wafers is a highly dynamic process. Multiple machines need to be scheduled,
and repeated (between 400 and 1,200 di erent stations during a waferfab). This
results in an NP-hard problem when optimizing the WIP (work in progress)
ow, as there are nearly 2,000 di erent products. Another main challenge is to
integrate human work into optimized logistic processes.</p>
      <p>SWILT focuses on swarms of CPSs in industrial plants (e.g., formed of
products, machines, or equipment). To handle the complexity of swarms of CPSs,
natural systems can serve as inspiration. Therein, many homogeneous and
heterogeneous agents cooperate without central control, executing simple rules
locally. Only through their interactions, a collective behaviour to solve complex
tasks emerges. The SWILT concept embeds the local swarm rules in a
threelayered architecture: L3 - autonomous agents, L2 - swarm control, where each
swarm consists of a set of agents and their computation is intended to run as
5G network application, and L1 - central management (see Fig. 1).
3</p>
    </sec>
    <sec id="sec-3">
      <title>Related Work</title>
      <p>
        Other research activities combine the Particle Swarm Optimization (PSO)
approach with other heuristics to improve its performance[
        <xref ref-type="bibr" rid="ref15 ref9">15, 9</xref>
        ]. The majority
of related work on the application of swarm concepts in production
scheduling build upon PSO or other swarm-based optimization algorithms. A notable
exception is the work by Leit~ao and Barbosa [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ] using swarm agents to create
a self-organizing system for production scheduling. Another important
contribution to controlling swarms of CPSs comes from research on swarm robotics.
Here, many simple small robots are coordinated in a self-organizing way
following the properties of a swarm. While approaches to de ne an intended behaviour
of a robot swarm [
        <xref ref-type="bibr" rid="ref13 ref4 ref5">4, 13, 5</xref>
        ] are inspiring for the research in this project, practical
implementations of robot-swarms are mostly on an experimental basis [
        <xref ref-type="bibr" rid="ref1 ref10">1, 10</xref>
        ] or
with an educational focus [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ]. Overall, the state of the art shows that direct
applications of swarm intelligence (other than using swarm intelligence in an
optimization process), are very uncommon.
4
      </p>
    </sec>
    <sec id="sec-4">
      <title>SWILT Project</title>
      <p>SWILT aims at a direct application of swarm intelligence in industrial
environments. SWILT performs agent-based swarm modelling of an industrial plant
on the use cases of production scheduling and transportation in logistics. Since
the problem sizes in these use cases are extremely large and traditional
precalculated schedules or transportation tables are not su cient, the innovation is
to use swarm algorithms with reactive local rules on individual agents which are
able to compensate dynamic changes in their local vicinity. The project will
identify a library of suitable algorithms, de ne a model for intra- and inter-swarm
communication, and will show how to apply scenario-speci c swarm intelligence
algorithms and how to extend swarm approaches with human-in-the-loop
concepts. To handle the complex communication within an industrial environment
with a huge number of agents and sensors, SWILT will elaborate the features
of 5G for handling the complex communication, such as direct device-to-device
communication and explicit support for communication intelligence at the edge.
The still premature communication technology promises to be an ideal match
for the SWILT layer concept and swarm communications in such an Industry
4.0 application.
4.1</p>
      <sec id="sec-4-1">
        <title>Goals</title>
        <p>To apply swarm intelligence algorithms to cope with NP-hard problems, the
industrial plant must be modelled as a swarm of agents, where a set of components
from the same type, the same category or the same objective can be interpreted
as the swarm. A swarm consists of a large number of simple agents who together
pursue a speci c goal based on local decisions of the agents. Since multiple
components interact, the goal is to construct multiple interacting swarms. Many
swarm intelligence algorithms have already been introduced in literature, but
they are rarely used as local algorithms in industrial plants. In a rst step, a
theoretical analysis of these algorithms is performed in order to test whether
they are suitable for application to swarms in industrial plants. In this analysis,
the requirements of the application case and the requirements of the swarm
algorithm are included. Suitable algorithms are collected, the associated boundary
conditions and requirements documented and adapted to an extensible library of
swarm algorithms for use in industrial plants. Such a library allows us to reuse
algorithms, reproduce future results and achieve higher complexity goals. With
the help of the de ned library for swarm algorithms, further evaluations can be
done. Another goal is to nd a suitable simulation environment. Challenges here
are to de ne a simulation that models the problem accurately enough so that
solutions that are elaborated based on information from such a simulation also
work in the real world, bridging the reality gap. On the one hand this calls for
a rather detailed and accurate simulation model, on the other hand potential
methodologies such as evolutionary methods involve a high number of
simulations which requires to complete thousands of simulations in short time.
Potential algorithms are implemented, tested and analysed, to evaluate the e ects of
swarm algorithms for both use cases. Achieving this aim gives us the ability to
make concrete statements on the usage of swarm algorithms in the industrial
domain. SWILT also envisages several swarms that communicate in di erent
directions, i.e., swarm2swarm, swarm2human and swarm2central communication.
A related goal is to de ne the best suited type or combination of
communication technology. In particular, SWILT will take 5G into account and derive a
communication plan according to the speci c characteristics of 5G. Only with
the application of 5G the SWILT swarm control layer L2 is able to run totally
independent from the underlying environment, to process the data on the edge
as network application and to handle the high amount of data tra c produced
through the mass of agents in the use cases.
4.2</p>
      </sec>
      <sec id="sec-4-2">
        <title>Use Cases</title>
        <p>
          The rst use case addresses scheduling in semiconductor production systems.
This use case is of interest to the application of swarm algorithms, because
calculating optimal schedules is typically out of reach for such large-scale domains.
In wafer production, weekly workloads can involve around 105 operations on 103
machines. [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ]
        </p>
        <p>The main issues are to balance local constraints (for example, a machine
might process lots in batches and thus prefer to wait until a batch is (almost)
full) with competing constraints such as avoiding starvation of processing and
global objectives such as maximizing throughput. In complex processes such as
wafer production, a mixture of di erent products, dynamic changes in the system
and a high number of processing steps and involved machines form a scheduling
problem that due to its complexity can not be solved by exhaustive search during
production.</p>
        <p>Another use case emerges from logistics in industrial plants, where the
integration of human work together with automated systems forms a major
challenge. Due to limited predictability and possibly limited compliance, an optimum
solution including the human factor is expected to be signi cantly di erent from
a logistic schedule of a completed automated system. Here swarm system are
expected to provide the necessary exibility and adaptability to integrate human
work successfully.
4.3</p>
      </sec>
      <sec id="sec-4-3">
        <title>Methodology</title>
        <p>
          The selection of algorithms and the modelling of the industrial plant are
performed upon the requirements/constraint analysis from the use cases. For an
initial test and analysis of these algorithms a common, easily programmable
simulation environment will be established that allows for fast evaluation of
algorithms and exploration of the nature of the problem. A simpli ed model
that still covers the main characteristics can also be used as a benchmark for
potential solutions where existing benchmark problems [
          <xref ref-type="bibr" rid="ref11 ref14 ref3">11, 3, 14</xref>
          ] are not
speci c enough. Moreover, an arti cial test case also allows to be made public in
order to enable a reproducible evaluation of algorithms [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ]. Possible platforms
for a simple simulation model are implementations in Netlogo5, MATLAB6, or
common programming languages with extensions for complex networks such
as Python7/NetworkX8. Based on the initial simulation model, possible
candidates for swarm algorithms will be evaluated. Besides the general paradigm (e.g.,
slime mold behavior, animal swarms, or other biological systems [
          <xref ref-type="bibr" rid="ref2">2</xref>
          ]) modeling
of swarm agents and the ne-tuning of algorithm parameters are issues that will
be addressed.
        </p>
        <p>In parallel, a detailed concept for the data abstraction and communication
will be de ned in form of a catalogue including the requirements and constraints
of the use cases. The concept will also take characteristics of communication
technologies into account, e.g., from the upcoming 5G standard, in order to select
the most appropriate technologies for intra- and inter-swarm communication.</p>
        <p>Based on the use cases and requirements, test scenarios and experiments
are performed to test di erent swarm intelligence algorithms and the
communication framework. In particular, tests and analysis are related to i) the
applied algorithms, ii) their convergence to a de ned goal (related to
requirements/constraints), iii) the quality of inter- and intra-swarm communication
(data abstraction layers). The resulting algorithms will be evaluated
quantitatively in a simulation based on the selected performance metrics. In addition, the
solutions will be reviewed by domain experts in order to assess their applicability
in a real productive setup.
5</p>
      </sec>
    </sec>
    <sec id="sec-5">
      <title>Conclusion and Future Work</title>
      <p>This paper introduced the SWILT project and laid out the basic design
concepts that are pursued by the project. The novelty of the SWILT project is the
application of swarm algorithms as a solution for coordination and scheduling
problems beyond the common application of swarm algorithms for optimization.
Thus the swarm members will be identi ed from hardware and software
elements that are already available in the CPS. Within SWILT, example use cases
are production scheduling in semiconductor manufacturing and transportation
problems in industrial plants that take human operators into account. The main
contribution of SWILT, besides application in the speci c use cases will be the
provision of a general architecture supporting multi-swarm systems with
communication models within and between swarms and to provide means for the
management of such swarm systems.
5 https://ccl.northwestern.edu/netlogo/
6 https://www.mathworks.com/products/matlab.html/
7 https://www.python.org/
8 https://networkx.github.io/</p>
    </sec>
    <sec id="sec-6">
      <title>Acknowledgments</title>
      <p>This work was performed in the course of project SWILT (Swarm Intelligence
Layer to Control Autonomous Agents) supported by FFG { IKT der Zukunft
under contract number 867530.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Arvin</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Murray</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , Zhang,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Yue</surname>
          </string-name>
          ,
          <string-name>
            <surname>S.</surname>
          </string-name>
          : Colias:
          <article-title>An autonomous micro robot for swarm robotic applications</article-title>
          .
          <source>International Journal of Advanced Robotic Systems</source>
          <volume>11</volume>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Camazine</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Deneubourg</surname>
            ,
            <given-names>J.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Franks</surname>
            ,
            <given-names>N.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sneyd</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Theraulez</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bonabeau</surname>
          </string-name>
          , E.:
          <article-title>Self-organization in biological systems</article-title>
          . Princton University Press (
          <year>2001</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Demirkol</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mehta</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Uzsoy</surname>
          </string-name>
          , R.:
          <article-title>Benchmarks for shop scheduling problems</article-title>
          .
          <source>European Journal of Operational Research</source>
          <volume>109</volume>
          (
          <issue>1</issue>
          ),
          <volume>137</volume>
          {
          <fpage>141</fpage>
          (
          <year>1998</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Dorigo</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Trianni</surname>
            ,
            <given-names>V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sahin</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gro</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Labella</surname>
            ,
            <given-names>T.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Baldassarre</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nol</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Deneubourg</surname>
            ,
            <given-names>J.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Mondada</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Floreano</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Gambardella</surname>
            ,
            <given-names>L.M.:</given-names>
          </string-name>
          <article-title>Evolving selforganizing behaviours for a swarm-bot</article-title>
          . autonomous robots. Autonomous Robots p.
          <volume>17</volume>
          :
          <issue>223</issue>
          (
          <year>2004</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Elmenreich</surname>
          </string-name>
          , W.,
          <string-name>
            <surname>D'Souza</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bettstetter</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>de Meer</surname>
          </string-name>
          , H.:
          <article-title>A survey of models and design methods for self-organizing networked systems</article-title>
          . In: W. Elmenreich,
          <string-name>
            <surname>R. D'Souza</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          <article-title>B</article-title>
          .,
          <string-name>
            <surname>de Meer</surname>
          </string-name>
          , H. (eds.)
          <source>In Proceedings of the Fourth International Workshop on Self-Organizing Systems</source>
          . vol.
          <source>LNCS 5918</source>
          , p.
          <fpage>3749</fpage>
          . Springer Verlag. (
          <year>2009</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Elmenreich</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moll</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Theuermann</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lux</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Making computer science results reproducible - a case study using gradle and docker</article-title>
          .
          <source>PeerJ Preprints</source>
          <volume>6</volume>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Jdeed</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhevzhyk</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Steinkellner</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Elmenreich</surname>
            ,
            <given-names>W.</given-names>
          </string-name>
          :
          <article-title>Spiderino { A low-cost robot for swarm research and educational purposes</article-title>
          .
          <source>In: 2017 13th Workshop on intelligent solutions in embedded system</source>
          . pp.
          <volume>35</volume>
          {
          <fpage>39</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2017</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8. Leita~o,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Barbosa</surname>
          </string-name>
          ,
          <string-name>
            <surname>J.</surname>
          </string-name>
          :
          <article-title>Adaptive scheduling based on self-organized holonic swarm of schedulers</article-title>
          .
          <source>IEEE 23rd International Symposium on Industrial Electronics (ISIE)</source>
          pp.
          <volume>1706</volume>
          {
          <issue>1711</issue>
          (
          <year>2014</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jin</surname>
            ,
            <given-names>Y.H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tang</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Huang</surname>
            ,
            <given-names>D.X.</given-names>
          </string-name>
          :
          <article-title>Improved particle swarm optimization combined with chaos</article-title>
          .
          <source>Chaos, Solitons &amp; Fractals</source>
          <volume>25</volume>
          (
          <issue>5</issue>
          ),
          <volume>1261</volume>
          {
          <fpage>1271</fpage>
          (
          <year>2005</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Rubenstein</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ahler</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nagpal</surname>
            ,
            <given-names>R.:</given-names>
          </string-name>
          <article-title>A low cost scalable robot system for collective behaviours</article-title>
          .
          <source>In Proceedings of the IEEE International Conference on Robotics and Automation</source>
          pp.
          <volume>3293</volume>
          {
          <issue>3298</issue>
          (
          <year>2012</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Taillard</surname>
          </string-name>
          , E.:
          <article-title>Benchmarks for basic scheduling problems</article-title>
          .
          <source>European Journal of Operational Research</source>
          <volume>64</volume>
          (
          <issue>2</issue>
          ),
          <volume>278</volume>
          {
          <fpage>285</fpage>
          (
          <year>1993</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Teppan</surname>
            ,
            <given-names>E.C.</given-names>
          </string-name>
          :
          <article-title>Dispatching rules revisited { a large scale job shop scheduling experiment</article-title>
          .
          <source>In: IEEE Symposium Series on Computational Intelligence (SSCI)</source>
          . pp.
          <volume>561</volume>
          {
          <fpage>568</fpage>
          .
          <string-name>
            <surname>IEEE</surname>
          </string-name>
          (
          <year>2018</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Trianni</surname>
          </string-name>
          , V.:
          <article-title>Evolutionary Swarm Robotics</article-title>
          , vol.
          <volume>108</volume>
          . Springer-Verlag Berlin Heidelberg,
          <volume>1</volume>
          <fpage>edn</fpage>
          . (
          <year>2008</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>A hybrid approach to large-scale job shop scheduling</article-title>
          .
          <source>Applied Intelligence</source>
          <volume>32</volume>
          (
          <issue>1</issue>
          ),
          <volume>47</volume>
          {
          <fpage>59</fpage>
          (
          <year>2010</year>
          )
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Zhao</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zhu</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ren</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          :
          <article-title>Integration of process planning and production scheduling based on a hybrid PSO and SA algorithm</article-title>
          .
          <source>International Conference on Mechatronics and Automation</source>
          , Luoyang, Henan pp.
          <volume>2290</volume>
          {
          <issue>2295</issue>
          (
          <year>2006</year>
          )
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>