<!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>Integrated Approach to Building a Microscopic City Model</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Ilia Ludan</string-name>
          <email>ludanilya@gmail.com</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Evgeny Maiorov</string-name>
          <email>benjamin1437@mail.ru</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Johan David Motta</string-name>
          <email>johanmotta10@gmail.com</email>
          <xref ref-type="aff" rid="aff2">2</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Oleg Saprykin</string-name>
          <email>saprykinon@ssau.ru</email>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Samara National Research, University</institution>
          ,
          <addr-line>Samara, Russian Federation</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Samara National, Research University</institution>
          ,
          <addr-line>Samara, Russian, Federation</addr-line>
        </aff>
        <aff id="aff2">
          <label>2</label>
          <institution>Santana, Samara National Research, University</institution>
          ,
          <addr-line>Samara, Russian, Federation</addr-line>
        </aff>
      </contrib-group>
      <abstract>
        <p>Due to the rapidly growing number of urban residents, a number of changes take place that affect the socio-economic processes of the city and the state generally. To solve the problems associated with transport systems, we can use special software for modeling, due to inability to influence the system in real life. However, the main issue that researches face during the creating of transportation models is inaccessibility of citizens' mobility data. The paper is devoted to developing methods and software of automated creation of transport microscopic models based on open data for any urban area. We propose the processing pipeline that consume the open data about city population and transport infrastructure and produce routes for agents of microscopic simulation. The developed method was implemented using the Python programming language in the Zeppelin interactive environment. The software was tested on data from the city of Samara (Russia). The obtained results show acceptability of proposed method and possible ways to improve the accuracy of model.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        matrix can be created. The application of this method dramatically decreases the possibility to obtain an inadequate model.
This area of research is currently relevant [
        <xref ref-type="bibr" rid="ref2 ref3 ref4 ref5 ref6">2-6</xref>
        ].
      </p>
      <p>
        Another modern source of population movement data is information from social networks, such as Foursquare and
Facebook. The method is based on the processing of geolocation data included in posts and photos. Having processed a
rather large amount of data, it is possible to compile statistics showing the intensity of population movement in certain areas
of the city at certain intervals. There is now a lot of research in this area as new social networks are emerging and being used
[
        <xref ref-type="bibr" rid="ref10 ref7 ref8 ref9">7-10</xref>
        ].
      </p>
      <p>
        The most accurate method for obtaining data of residents` mobility was proposed by Klaas Friso [
        <xref ref-type="bibr" rid="ref11">11</xref>
        ]. The high accuracy
of the method is a result of the fact that the data is taken from the entire population using cellular communication. This
technique allows for obtaining actual data, however, the processing of large datasets from different operators is very difficult.
At the same time, the application of the method may be limited to the level of the Legislation of some countries, as well as
the disagreement of subscribers to the processing of their personal data.
      </p>
      <p>
        The model-driven approach is popular among the researchers too and used when GPS or mobile data are not accessible.
Filippo Simini [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], who uses the universal model for mobility and migration uses gravitational method to obtain data on
population movements throughout the country. This method allows tracing the trade flows in the country, as well as between
countries, migration flows, and even intercity telephone calls. The gravitational method was proposed by W. Reilly [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ].
The universal law of gravitation has become an idea for constructing a gravitational-type model. Applying this law to the
transport system, it turns out that the objects are the points generating and absorbing traffic flows [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ], and the total volume
of the incoming and outgoing flow is taken as the object mass. It is possible to replace the physical distance with any costs
[
        <xref ref-type="bibr" rid="ref15">15</xref>
        ] associated with the movement.
      </p>
      <p>
        An idea for constructing the entropy model [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ] was suggested by physics, and specific for the second law of
thermodynamics. It is accepted by law that any closed physical system tends to achieve a stable equilibrium state, which is
characterized by the maximum entropy of this system. The entropy method was first applied to the transport processes of A.
Wilson [
        <xref ref-type="bibr" rid="ref17">17</xref>
        ]. The principle of the entropy method is that the system of residents’ movement on the city road network has a
fairly large number of uncontrolled elements. Related to the fact that our research is devoted to city transportation, it is
necessary to consider the transport system as a closed one.
      </p>
      <p>
        Michael Balmer compares two types of modeling in his work [
        <xref ref-type="bibr" rid="ref18">18</xref>
        ]: micro-simulation model and a traditional assignment
model. The traditional assignment model is based on the use of OD matrices to reflect the movement of large population
flows [
        <xref ref-type="bibr" rid="ref19">19</xref>
        ]. The main advantage of the micro-simulation model is that it is possible to simulate the movement of each agent
individually [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ].
      </p>
      <p>
        Modern transport simulation systems allow creating the visual representation of traffic flows. Currently, there is a wide
specter of transport simulation software, a few of the more popular examples are T7F/TSIS, SUMO [
        <xref ref-type="bibr" rid="ref21">21</xref>
        ], TRANSYT,
VISUM, MATsim, Aimsun. They allow the verification of transport infrastructure changes, without special economic and
time costs. Moreover there is research to build OD matrices from microscopic simulation outcome [22].
      </p>
      <p>Despite a large number of studies in the field of transport modeling, some issues still remain. The most important issue
is related to a model creating automation. This paper is devoted to developing methods and software of automated creation
of transport microscopic models for any urban area based on open data. The developed system provides the ability to obtain
the up-to-date information from open Internet resources, process it, and apply it for transportation model creating or updating.
As an example of open resource, we consider OpenStreetMap that provides information about city infrastructure collected
by volunteers. Using information from OpenStreetMap, we have defined transportation supply and demand for building a
microscopic transportation model. The proposed approach allows getting models with acceptable quality using only data
from public resources.
2</p>
    </sec>
    <sec id="sec-2">
      <title>Transportation city model</title>
      <p>The study proposes to use modeling for investigating capabilities to change the road network structure to increase its
capacity. Modeling is used to study real objects by building models to reveal their latent characteristics, and also influence
them. There are several types of modeling that allow creating a model of a specific object. Applied to natural and technical
sciences, it is customary to distinguish the following types of modeling: conceptual, physical, structural-functional,
mathematical, and simulation. The choice of the type of modeling depends on the goal of the research.</p>
      <p>In our study, we use simulation, which allows us to build models describing processes, in our case, transportation
processes. The basis for choosing this method is the dynamic nature of the transport system, as well as the inability to create
a static model.</p>
      <p>To date, there are a number of software applications that make it possible to create a transport model of the city at various
levels of detail - from macroscopic to microscopic [23]. In this work, we use microscopic simulation, to create a microscopic
model. The advantage of microscopic simulation is the ability to model individual elements, in this case, vehicles and
transport infrastructure objects.</p>
      <p>The main goal is creation of a universal method (Fig. 1), which would be suitable for modeling the transport processes
of any city using open data.</p>
      <p>Creation of the most accurate model is possible by solving several problems [24]: splitting the city into traffic analysis
zones (TAZ), constructing OD matrices, and building activity chains. The most accurate model of transport processes is
created by dividing the city into traffic analysis zone of a certain size, within which the citizens do not use transport; however,
they use public or personal transport for traveling between zones.
2.1</p>
      <sec id="sec-2-1">
        <title>Traffic Analysis Zones</title>
        <p>The division by TAZ is the foundation of correct elaboration of transport flow models [25]. Starting from these divisions,
we can elaborate an image that allows the identification of several economic, political and social aspects of the city in
question.</p>
        <p>The concept of TAZ can be understood as the elementary area used for the analysis of transport models. With them, we
can determine the flow of vehicles and pedestrians moving from region A to region B. At the time of the splitting of zones,
the main criterion to be taken into account the points of the largest density flow, around which regions are formed, playing
down such criteria as the physical size of the regions as suggested in fundamentals of transport modeling [26].</p>
        <p>In the establishment of the Traffic Analysis Zone, it is important to choose areas where a relation between the origin and
destination exists. For the determination of the scale of the transport regions it is necessary to keep in mind that the more the
size of said area increases, the less effective the model will be.</p>
        <p>On the criteria described above, the regions were extracted according to the main road arteries and natural boundaries
(Fig. 2). The proposed approach allows the models performance to be more accurate and provides better possibilities for
improvement. In addition, each region can be subdivided, to correspondingly make a model on this specific area. Therefore
we obtain scalable model which can be adapted to solve transportation problems at different levels with less handling of data
and information.
2.2</p>
      </sec>
      <sec id="sec-2-2">
        <title>Origin-Destination Matrices</title>
        <p>We used the gravitation model to construct the OD matrix because it has sufficient quality for urban areas and is not very
sensitive to computational resources. The transport gravity model relates to the intensity of the flow. Between the total
number of departures from the i-th zone and arrivals to the j-th zone and the cost of travel between zones i and j (1).

 =   ∗</p>
        <p>Where N is the total number of departure areas, and M is the total number of arrival areas. In this model, the distance
between areas is considered the distance between the centers of these areas.</p>
        <p>There is an opportunity to receive data from any GIS required for finding the intensity of the flow based on information
about residential buildings and organizations of the city. To involve organizations into a model we need to receive geographic
and attribute data about them. We also need information about residential buildings: number of stores and coordinates. With
all of this information, we can compare the average number of working or living people in each organization and residential
building. Coordinates will allow the location of residential buildings and organizations to be displayed on the city map.
After dividing the city into traffic analysis zones and constructing the OD matrix, it is necessary to distribute the agents in
the model according to the obtained data and to build a route for each of them. This is the process of activity chains building.
To obtain them, it is necessary to determine which TAZ region each road section belongs to. For this purpose, the operation
intersection is performed, which allows overlaying the two tables and intersecting the data sets. After that, agents are
distributed along the road network. Start, finish and intermediate points are assigned according to the OD matrix. The last
step is to combine all obtained data to visualize the simulation process, and then to compare the resulting model with the
actual situation on the city's road network. If necessary, the model is corrected using additional data from the actual transport
network.
3</p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>Implementation</title>
      <p>
        The automated method of microscopic transport models building was implemented using Python programming language.
We have used the data for the city of Samara (Russia) for debugging the model [
        <xref ref-type="bibr" rid="ref20">20</xref>
        ].
      </p>
      <p>Innovations in GIS make possible the modeling of transport processes using open data, (e.g. OpenStreetMap. Interface
can be used and adapted to modeling and editing Traffic Analysis Zones with OSM SlippyMap Generator (Fig. 3)).</p>
      <p>For visualization, the resulting matrix was colored in characteristic colors (Fig. 4). The less the intensity between the two
transport areas, the shade of the matrix cell is closer to red, and vice versa, the higher the intensity, the closer to green.</p>
      <p>To build the activity points it is necessary to separate road network sections by TAZ districts. Using the OSMnx library
is a way to automatically get geodata of the city. Geodata can be obtained only by just entering the name of the city. There
we can receive data about coordinates and type of organizations and residential buildings of the city of Samara in the format
of GeoDataFrame (GDF). The next step of the method is to divide the city into transport areas. To implement this method,
the GeoPandas library was used to perform various manipulations with a geographic database, which contains various tables
with initial data: names of streets, districts, roads and so on.</p>
      <p>After obtaining a database with the coordinates of roads and areas, it becomes necessary to determine the affiliation of
roads to a certain area. In the library, there is special operations to perform various overlays of two spatial tables, as well as
visualize them. In the study, by means of the sjoin operation, the traffic analysis zone (TAZ) and their roads are united.</p>
      <p>The next step in the method of activity chain constructing is to create a file containing general data on the affiliation of
all the city roads to a particular transport area. The final step of the method is the entry of all the data obtained into the
SUMO program for further modeling.</p>
      <p>The next steps are processing the received data in programs OD2TRIPS and DUAROUTER. OD2TRIPS allows defining
the start and end points of a path, but it does not have the ability to compile route on real roads. In other words, program
OD2TRIPS creates the starting point of the agent's movement and the end point of its path. In turn, the DUAROUTER
program serves to compile a route along those roads, the data of which were obtained in the TAZ file. These programs are
complementary to each other and create a well-constructed direction of traffic flows.</p>
      <p>After using the created method of constructing activity chains and putting all the data in the SUMO program, it is possible
to start modeling urban transport processes (Fig. 5). The application of this method is possible for any city, subject to
obtaining data on the transport areas of the city and their residents.</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusions</title>
      <p>The developed method allows easily building a microscopic model of an interested urban area. However, at this moment, it
has certain shortcomings and limitations. The main issue is inconsistency of the model sections with real traffic in some road
network. For example, in the case of the city of Samara, most of the agents are moving along the Moskovskoye and
Zavodskoye highways, ignoring roads that are no less used in real life, such as Novo-Sadovaya or Kirovskaya. There is also
the problem of the emergence of new agents in the middle of the road, while they should appear near residential buildings.
Generally, this issue is related to inaccuracy of open data or missing some information about transport infrastructure objects.
This limitation requires manual verification and fixing the model, so it can only work automatically in the simplest cases.</p>
      <p>Despite all the shortcomings listed above, the method of constructing activity chains completely works. Even today it
can be used to create a model of transport processes in other cities. The advantage of the developed method is that only initial
data is needed in order to create activity chains and OD matrices for the city (i.e. information on transport areas and number
of residents of a particular transport area).</p>
      <p>Further work is intended to reduce the scale of TAZ areas, which should lead to improvement of the model because it
will reflect the urban area in more detail. Another pending task is developing a method for obtaining information about city
organizations and clarifying information about residents.</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgements</title>
      <p>This work was supported by the Ministry of Education and Science of the Russian Federation.
22. Saprykin, O., Saprykina, O.: Multilevel Modelling of Urban Transport Infrastructure, In Proceedings of the 1st
International Conference on Vehicle Technology and Intelligent Transport Systems (VEHITS-2015). Portugal, Lisbon:
SCITEPRESS, 2015: 78-82.
23. Chen, M., Bernstein, D.H., Chien, S.I., Mouskos, K.: Simplified formulation of toll design problem, Transportation</p>
      <p>Reseach, 1999.
24. Martinez, L.M., Viegas, J.M., Silva, E.A.: A traffic analysis zone definition: a new methodology and algorithm,</p>
      <p>Springer Science+Business Media, LLC, 2009.
25. Gorev, A.E., Buttger, K., Prokhorov, A.V., Gizatullin, R.R.: Transport modeling fundamentals, St. Petersburg, Kosta,
2015, 168 p.
26. Saprykin, O., Saprykina, O.: Validation of Transport Infrastructure Changes via Microscopic Simulation: A Case Study
for the City of Samara, Russia, In Proceedings of the 5th IEEE International Conference on Models and Technologies
for Intelligent Transportation Systems (MT-ITS 2017) in Naples, Italy, 26-28 June, 2017: 788-793.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Bundesministeriumfür</given-names>
            <surname>Verkehr</surname>
          </string-name>
          .
          <article-title>Bau und Wohnungswesen (BMVBW)</article-title>
          .
          <source>: Neubauvon Bundesautobahnen</source>
          ,
          <year>2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Gasnikov</surname>
            ,
            <given-names>A.V.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Klenov</surname>
            ,
            <given-names>S.L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nurminskiy</surname>
            ,
            <given-names>E.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kholodov</surname>
            ,
            <given-names>Y.A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Shamrai</surname>
            ,
            <given-names>N.B.</given-names>
          </string-name>
          :
          <article-title>Vvedeniye v matematicheskoye modelirovanie transportnykh potokov</article-title>
          ,
          <year>2010</year>
          ,
          <string-name>
            <surname>MFTI.</surname>
          </string-name>
          (In Russian).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Moreira-Matias</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Time-evolving O-D matrix estimation using high-speed GPS data streams</article-title>
          ,
          <source>Expert Systems With Applications</source>
          ,
          <year>2016</year>
          ,
          <volume>44</volume>
          :
          <fpage>275</fpage>
          -
          <lpage>288</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Russell</surname>
            ,
            <given-names>J.S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ye</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Anderson</surname>
            ,
            <given-names>B.D.O.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Hmam</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sarunic</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          :
          <article-title>Cooperative Localisation of a GPS-Denied UAV in 3-Dimensional Space Using Direction of Arrival Measurements, IFAC</article-title>
          , vol.
          <volume>50</volume>
          ,
          <year>2017</year>
          , issue
          <volume>1</volume>
          :
          <fpage>8019</fpage>
          -
          <lpage>8024</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Singh</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Sujit</surname>
          </string-name>
          , P.B.:
          <article-title>Landmarks based path planning for UAVs in GPS-denied areas</article-title>
          ,
          <source>IFAC</source>
          , vol
          <volume>49</volume>
          ,
          <year>2016</year>
          , issue
          <volume>1</volume>
          :
          <fpage>396</fpage>
          -
          <lpage>400</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kim</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Park</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jung</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yi</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <source>Automated Complex Urban Driving based on Enhanced Environment Representation with GPS/map, Radar, Lidar and Vision</source>
          , IFAC, vol.
          <volume>49</volume>
          ,
          <year>2016</year>
          , issue
          <volume>11</volume>
          :
          <fpage>190</fpage>
          -
          <lpage>195</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Kheiri</surname>
            ,
            <given-names>A.A.</given-names>
          </string-name>
          :
          <article-title>Intra-urban movement flow estimation using location based social networking data, The International Archives of the Photogrammetry</article-title>
          ,
          <source>Remote Sensing and Spatial Information Sciences, Volume XL-1/W5</source>
          , 2015 International Conference on Sensors &amp;
          <article-title>Models in Remote Sensing</article-title>
          &amp; Photogrammetry, Kish Island, Iran.
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Wang</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          :
          <article-title>The data-driven null models for information dissemination tree in social networks</article-title>
          ,
          <source>Physica A: Statistical Mechanics and its Applications</source>
          ,
          <year>2017</year>
          ,
          <volume>484</volume>
          :
          <fpage>394</fpage>
          -
          <lpage>411</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Yu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Xiao</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Yao</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ding</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jin</surname>
          </string-name>
          , H.:
          <article-title>Using check-in features to partition locations for individual users in location based social network</article-title>
          ,
          <source>Information Fusion</source>
          ,
          <year>2017</year>
          ,
          <volume>37</volume>
          :
          <fpage>86</fpage>
          -
          <lpage>97</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Jiao</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ran</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Chen</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Meng</surname>
            ,
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Li</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          :
          <article-title>Data-Driven Approach to Operation and Location Considering Range Anxiety of One-Way Electric Vehicles Sharing System</article-title>
          ,
          <source>Energy Procedia</source>
          ,
          <year>2017</year>
          ,
          <volume>105</volume>
          :
          <fpage>2287</fpage>
          -
          <lpage>2294</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Friso</surname>
            ,
            <given-names>K.</given-names>
          </string-name>
          :
          <article-title>Enriching the transport model of the Rotterdam region by cell phone data, Models and Technologies for Intelligent Transportation Systems (MT-ITS</article-title>
          ),
          <year>2015</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Simini</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>A universal model for mobility and migration patterns</article-title>
          , Macmillan Publishers Limited,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Reilly</surname>
            ,
            <given-names>W.J.:</given-names>
          </string-name>
          <article-title>The law of retail gravitation</article-title>
          , New York,
          <year>1931</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Wiedemann</surname>
          </string-name>
          , R.: Simulation des Straßenverkehrsflusses,
          <source>PhD-thesis</source>
          , University of Karlsruhe, Germany,
          <year>1974</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Beckmann</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>McGuire</surname>
            ,
            <given-names>C.B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Winsten</surname>
            ,
            <given-names>C.B.</given-names>
          </string-name>
          :
          <article-title>Studies in the economics of transportation</article-title>
          ,
          <source>RM 1488. Santa Monica: RAND Corporation</source>
          ,
          <year>1955</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          16.
          <string-name>
            <surname>Fang</surname>
            ,
            <given-names>S.C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rajasekera</surname>
            ,
            <given-names>J.R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tsao</surname>
          </string-name>
          , H.-S.J.:
          <source>Entropy optimization and mathematical programming</source>
          , Kluwer Academic Publisher,
          <year>1997</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          17. Wilson,
          <string-name>
            <surname>A.G.</surname>
          </string-name>
          :
          <article-title>Entropy in urban and regional modeling</article-title>
          , London: Pion,
          <year>1970</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref18">
        <mixed-citation>
          18.
          <string-name>
            <surname>Balmer</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <source>Generating Day Plans Based on Origin-Destination</source>
          ,
          <year>2005</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref19">
        <mixed-citation>
          19.
          <string-name>
            <surname>Roughgarden</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Tardos</surname>
          </string-name>
          , E.:
          <article-title>How bad is selfish routing?</article-title>
          <source>Journal of the ACM</source>
          ,
          <year>2002</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref20">
        <mixed-citation>
          20.
          <string-name>
            <surname>Krajzewicz</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Erdmann</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Behrisch</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bieker</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          :
          <article-title>Recent Development and Applications of SUMO - Simulation of Urban Mobility</article-title>
          ,
          <source>International Journal On Advances in Systems and Measurements</source>
          ,
          <year>2012</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref21">
        <mixed-citation>
          21.
          <string-name>
            <surname>Hofer</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Jäger</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Füllsack</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          :
          <article-title>Generating Realistic Road Usage Information and Origin-Destination Data for Traffic Simulations: Augmenting Agent-Based Models with Network Techniques</article-title>
          , In: Cherifi C.,
          <string-name>
            <surname>Cherifi</surname>
            <given-names>H.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Karsai</surname>
            <given-names>M.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Musolesi</surname>
            <given-names>M</given-names>
          </string-name>
          .
          <article-title>(eds) Complex Networks &amp; Their Applications VI</article-title>
          .
          <source>COMPLEX NETWORKS 2017. Studies in Computational Intelligence</source>
          ,
          <volume>689</volume>
          , pages
          <fpage>1223</fpage>
          -
          <lpage>1233</lpage>
          . Springer, Cham,
          <year>2018</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>