<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1665-6423</journal-id>
<journal-title><![CDATA[Journal of applied research and technology]]></journal-title>
<abbrev-journal-title><![CDATA[J. appl. res. technol]]></abbrev-journal-title>
<issn>1665-6423</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional Autónoma de México, Instituto de Ciencias Aplicadas y Tecnología]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1665-64232015000100012</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Decision Support for Route Search and Optimum Finding in Transport Networks under Uncertainty]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Szücs]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,University of Technology and Economics Department of Telecommunications and Media Informatic ]]></institution>
<addr-line><![CDATA[Budapest ]]></addr-line>
<country>Hungría</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>00</month>
<year>2015</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>00</month>
<year>2015</year>
</pub-date>
<volume>13</volume>
<numero>1</numero>
<fpage>125</fpage>
<lpage>134</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1665-64232015000100012&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1665-64232015000100012&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1665-64232015000100012&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[The aim of this paper is to find solution for route planning in road network for a user, and to find the equilibrium in the path optimization problem, where the roads have uncertain attributes. The concept is based on the Dempster-Shafer theory and Dijkstra's algorithm, which help to model the uncertainty and to find the best route, respectively. Based on uncertain influencing factors an interval of travel time (so called cost interval) of each road can be calculated. An algorithm has been outlined for determining the best route comparing the intervals and using decision rules depending on the user's attitude. Priorities can be defined among the rules, and the constructed rule based mechanism for users' demands is great contribution of this paper. The first task is discussed in more general in this paper, i.e. instead of travel time a general cost is investigated for any kind of network. At the solution of the second task, where the goal is to find equilibrium in transport network at case of uncertain situation, the result of the first task is used. Simulation tool has been used to find the equilibrium, which gives only approximate solution, but this is sufficient and appropriate solution for large networks. Furthermore this is built in a decision support system, which is another contribution of this work. At the end of the paper the implementation of the theoretical concept is presented with a test bed of a town presenting effects of different uncertain influencing factors for the roads.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Dijkstra's algorithm]]></kwd>
<kwd lng="en"><![CDATA[Dempster-Shafer theory]]></kwd>
<kwd lng="en"><![CDATA[transportation planning]]></kwd>
<kwd lng="en"><![CDATA[routing]]></kwd>
<kwd lng="en"><![CDATA[uncertainty]]></kwd>
<kwd lng="en"><![CDATA[Wardrop equilibrium]]></kwd>
<kwd lng="en"><![CDATA[decision support system]]></kwd>
<kwd lng="en"><![CDATA[rule base]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[  	    <p align="center"><font face="verdana" size="4"><b>Decision Support for Route Search and Optimum Finding in Transport Networks under Uncertainty</b></font></p>  	    <p align="center">&nbsp;</p>     <p align="center"><b><font face="verdana" size="2">G. Sz&uuml;cs</font></b><font face="verdana" size="2"></font></p>      <p align="justify">&nbsp;</p>     <p align="justify"><font face="verdana" size="2"><i>Department of Telecommunications and Media Informatics Budapest University of Technology and Economics</i>. <a href="mailto:szucs@tmit.bme.hu">szucs@tmit.bme.hu</a></font></p>      <p align="justify">&nbsp;</p>     <p align="justify"><font face="verdana" size="2"><b>ABSTRACT</b></font></p>      <p align="justify"><font face="verdana" size="2">The aim of this paper is to find solution for route planning in road network for a user, and to find the equilibrium in the path optimization problem, where the roads have uncertain attributes. The concept is based on the Dempster&#45;Shafer theory and Dijkstra's algorithm, which help to model the uncertainty and to find the best route, respectively. Based on uncertain influencing factors an interval of travel time (so called cost interval) of each road can be calculated. An algorithm has been outlined for determining the best route comparing the intervals and using decision rules depending on the user's attitude. Priorities can be defined among the rules, and the constructed rule based mechanism for users' demands is great contribution of this paper. The first task is discussed in more general in this paper, i.e. instead of travel time a general cost is investigated for any kind of network. At the solution of the second task, where the goal is to find equilibrium in transport network at case of uncertain situation, the result of the first task is used. Simulation tool has been used to find the equilibrium, which gives only approximate solution, but this is sufficient and appropriate solution for large networks. Furthermore this is built in a decision support system, which is another contribution of this work. At the end of the paper the implementation of the theoretical concept is presented with a test bed of a town presenting effects of different uncertain influencing factors for the roads.</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Keywords:</b> Dijkstra's algorithm, Dempster&#45;Shafer theory, transportation planning, routing, uncertainty, Wardrop equilibrium, decision support system, rule base. </font></p> 	    ]]></body>
<body><![CDATA[<p align="justify">&nbsp;</p> 	    <p align="justify"><font face="verdana" size="2"><a href="/pdf/jart/v13n1/v13n1a12.pdf" target="_blank">DESCARGAR ART&Iacute;CULO EN FORMATO PDF</a></font></p>  	    <p align="justify">&nbsp;</p>     <p align="justify"><font face="verdana" size="2"><b>References</b></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;1&#93;&nbsp;Y. G. Wang, C. B.Z hang, Y. Cao and B. H. Liu, "Access for Performance of Transportation Planning and Operations: Case Study in Beijing Metropolitan Region", Journal of Applied Research and Technology, 2012, Vol. 10, No. 4, pp. 491&#45;504.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852903&pid=S1665-6423201500010001200001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;2&#93; E. Frejinger and M. Bierlaire, "Capturing correlation with sub networks in route choice models", Transportation Research Part B, 41, 2007, pp. 363&#45;378.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852905&pid=S1665-6423201500010001200002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;3&#93; J. D&iacute;az&#45;Ram&iacute;rez, Y. Garz&oacute;nand J. I. Huertas, </font><font face="verdana" size="2">"Considering Competition to Solve a Flight Schedule and Aircraft Routing Problem for Small Airlines", Journal of Applied Research and Technology, 2012, Vol. 10, No. 4, pp. 557&#45;566.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852907&pid=S1665-6423201500010001200003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;4&#93; H. M. Deeand D. C. Hogg,"Navigational strategies in behaviourmodeling", Artificial Intelligence, Vol. 173 (2), 2009, pp. 329&#45;342.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852909&pid=S1665-6423201500010001200004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;5&#93; L. C, Chen, Y. C. Lai, Y. H. Yeh, J. W. Lin, C. N. Lai, and H. C. Weng,"Enhanced Mechanisms for Navigation and Tracking Services in Smart Phones",Journal of Applied Research and Technology, 2013, Vol. 11, No. 2, 272&#45;282.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852911&pid=S1665-6423201500010001200005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;6&#93; S. Lim, C. Sommer, E. Nikolovaand D. Rus,"Practical Route Planning Under Delay Uncertainty: Stochastic Shortest Path Queries",RSS&#45;Robotics: Science and Systems,VIII., 2012.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852913&pid=S1665-6423201500010001200006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;7&#93; A. Hadjali, A. Mokhtariand O. Pivert,"Expressing and processing complex preferences in route planning queries: Towards a fuzzy&#45;set&#45;based approach",Fuzzy Sets and Systems, 2012, 196, pp. 82&#45;104.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852915&pid=S1665-6423201500010001200007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;8&#93; C. Demetrescu and G. F. Italiano/'Fully dynamic all pairs shortest paths with real edge weights", Journal of Computer and System Sciences, 2006, Volume 72, Issue 5, August, Pages 813&#45;837.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852917&pid=S1665-6423201500010001200008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;9&#93; S. Vukmirovic, A. Erdeljan, L. Imreand D. Capko,"Optimal Workflow Scheduling in Critical Infrastructure Systems with Neural Networks" Journal of Applied Research and Technology, 2012, Vol. 10, No. 2, pp. 114&#45;121.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852919&pid=S1665-6423201500010001200009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;10&#93; J. A. Malpica, M. C. Alonso and M. A. Sanz, "Dempster&#45;Shafer Theory in geographic information systems: A survey", Expert Systems with Applications, 2007, Volume 32, Issue 1, pp. 47&#45;55.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852921&pid=S1665-6423201500010001200010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;11&#93;&nbsp;G. Sz&uuml;cs and Gy.Sallai,"Route Planning with Uncertain Information using Dempster&#45;Shafer theory",3rd International Conference Engineering Management and Service Sciences (EMS 2009), Session of City Operation and Development, September 20&#45;22, 2009, Beijing, China.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852923&pid=S1665-6423201500010001200011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;12&#93; J. G. Wardrop, "Some Theoretical Aspects of Road Traffic Research",Proceedings of the Institute of Civil Engineers, 1952, Part II, pp. 325&#45;378.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852925&pid=S1665-6423201500010001200012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;13&#93; I. Chabini, H.Jiang, P. MacneilleandR.Miller,"Parallel Implementation of Dynamic Traffic Assignment Models", Presented at the IEEE International Conference on Systems, Man and Cybernetics, October 2003, Washington DC.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852927&pid=S1665-6423201500010001200013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;14&#93; S. J.Liand G. Y.Chen,"Multiclass, Two&#45;criteria Traffic Network Equilibrium Models and Vector Variational Inequalities", Systems Engineering &#45; Theory and Practice, 2008, Volume 28, Issue 1, pp. 141&#45;145.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852929&pid=S1665-6423201500010001200014&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;15&#93; E. W.Dijkstra,"A note on two problems in connection with graphs",NumerischeMathematik </font><font face="verdana" size="2">1959, 1, pp. 269&#45;271.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852931&pid=S1665-6423201500010001200015&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;16&#93; A. P. Dempster,"The Dempster&#45;Shafer calculus for statisticians",International Journal of Approximate Reasoning, 2008, Volume 48, Issue 2, pp. 365&#45;377.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852933&pid=S1665-6423201500010001200016&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;17&#93; A. Nagurney,"Spatial Equilibrium in Transport Networks", in David Hensher et al. (ed) Handbook of Transport Geography and Spatial Systems, Handbooks in Transport, 2004, Vol. 5, Elsevier, pp. 583&#45;608.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852935&pid=S1665-6423201500010001200017&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;18&#93; D.B oyce, D. H. Lee and B. Ran,"Analytical Models of the Dynamic Traffic Assignment Problem", Networks and Spatial Economics, 2001, Vol. 1, Numbers 3&#45;4, pp. 377&#45;390.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852937&pid=S1665-6423201500010001200018&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;19&#93; D. E. Kaufman, J. Nonis and R. L.Smith,"A mixed integer linear programming model for dynamic route guidance",Transportation Research Part B: Methodological, 1998, Volume 32, Issue 6, pp. 431&#45;440.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852939&pid=S1665-6423201500010001200019&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;20&#93; M. Florian, M. Mahut and N.Tremblay,"Application of a simulation&#45;based dynamic traffic assignment model", European Journal of Operational Research, 2008, 189, </font><font face="verdana" size="2">pp. 1381&#45;1392.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852941&pid=S1665-6423201500010001200020&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;21&#93; Y. Zhangand X. D. Chen,"An Optimization Model for the Vehicle Routing Problem in Multiproduct Frozen Food Delivery",Journal of Applied Research and Technology, 2014, 12(2), pp. 239&#45;250.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852943&pid=S1665-6423201500010001200021&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;22&#93; A. Bustos, L. Herreraand E. Jim&eacute;nez,"Efficient Frontier for Multi&#45;Objective Stochastic Transportation Networks in International Market of Perishable Goods",Journal of Applied Research and Technology, 2014, 12(4), pp. 654&#45;665.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852945&pid=S1665-6423201500010001200022&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;23&#93; S. C. Dafermos and F. T. Sparrow, "The Traffic Assignment Problem for a General Network", Journal of Research of the National Bureau of Standards, 1969, 73B, pp.91&#45;118.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4852947&pid=S1665-6423201500010001200023&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>     ]]></body>
<body><![CDATA[ ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Y. G.]]></given-names>
</name>
<name>
<surname><![CDATA[hang]]></surname>
<given-names><![CDATA[C. B.Z]]></given-names>
</name>
<name>
<surname><![CDATA[Cao]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[B. H.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Access for Performance of Transportation Planning and Operations: Case Study in Beijing Metropolitan Region]]></article-title>
<source><![CDATA[Journal of Applied Research and Technology]]></source>
<year>2012</year>
<volume>10</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>491-504</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Frejinger]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Bierlaire]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Capturing correlation with sub networks in route choice models]]></article-title>
<source><![CDATA[Transportation Research Part B]]></source>
<year>2007</year>
<volume>41</volume>
<page-range>363-378</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Díaz-Ramírez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Garzónand]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Huertas]]></surname>
<given-names><![CDATA[J. I.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Considering Competition to Solve a Flight Schedule and Aircraft Routing Problem for Small Airlines]]></article-title>
<source><![CDATA[Journal of Applied Research and Technology]]></source>
<year>2012</year>
<volume>10</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>557-566</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Deeand]]></surname>
<given-names><![CDATA[H. M.]]></given-names>
</name>
<name>
<surname><![CDATA[Hogg]]></surname>
<given-names><![CDATA[D. C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Navigational strategies in behaviourmodeling]]></article-title>
<source><![CDATA[Artificial Intelligence]]></source>
<year>2009</year>
<volume>173</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>329-342</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[L. C]]></given-names>
</name>
<name>
<surname><![CDATA[Lai]]></surname>
<given-names><![CDATA[Y. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Yeh]]></surname>
<given-names><![CDATA[Y. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Lin]]></surname>
<given-names><![CDATA[J. W.]]></given-names>
</name>
<name>
<surname><![CDATA[Lai]]></surname>
<given-names><![CDATA[C. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Weng]]></surname>
<given-names><![CDATA[H. C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Enhanced Mechanisms for Navigation and Tracking Services in Smart Phones]]></article-title>
<source><![CDATA[Journal of Applied Research and Technology]]></source>
<year>2013</year>
<volume>11</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>272-282</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lim]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Sommer]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Nikolovaand]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Rus]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[Practical Route Planning Under Delay Uncertainty: Stochastic Shortest Path Queries]]></source>
<year>2012</year>
<publisher-name><![CDATA[RSS-Robotics: Science and Systems,VIII]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hadjali]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Mokhtariand]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Pivert]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Expressing and processing complex preferences in route planning queries: Towards a fuzzy-set-based approach]]></article-title>
<source><![CDATA[Fuzzy Sets and Systems]]></source>
<year>2012</year>
<volume>196</volume>
<page-range>82-104</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Demetrescu]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Italiano]]></surname>
<given-names><![CDATA[G. F.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Fully dynamic all pairs shortest paths with real edge weights]]></article-title>
<source><![CDATA[Journal of Computer and System Sciences]]></source>
<year>2006</year>
<volume>72</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>813-837</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vukmirovic]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Erdeljan]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Imreand]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Capko]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Optimal Workflow Scheduling in Critical Infrastructure Systems with Neural Networks]]></article-title>
<source><![CDATA[Journal of Applied Research and Technology]]></source>
<year>2012</year>
<volume>10</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>114-121</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Malpica]]></surname>
<given-names><![CDATA[J. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Alonso]]></surname>
<given-names><![CDATA[M. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Sanz]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Dempster-Shafer Theory in geographic information systems: A survey]]></article-title>
<source><![CDATA[Expert Systems with Applications]]></source>
<year>2007</year>
<volume>32</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>47-55</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Szücs]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Sallai]]></surname>
<given-names><![CDATA[Gy.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Route Planning with Uncertain Information using Dempster-Shafer theory]]></article-title>
<source><![CDATA[3rd International Conference Engineering Management and Service Sciences (EMS 2009)]]></source>
<year>Sept</year>
<month>em</month>
<day>be</day>
<publisher-loc><![CDATA[Beijing ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wardrop]]></surname>
<given-names><![CDATA[J. G.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Some Theoretical Aspects of Road Traffic Research]]></article-title>
<source><![CDATA[Proceedings of the Institute of Civil Engineers]]></source>
<year>1952</year>
<page-range>325-378</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chabini]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Jiang]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Macneilleand]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Miller]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Parallel Implementation of Dynamic Traffic Assignment Models]]></article-title>
<source><![CDATA[IEEE International Conference on Systems, Man and Cybernetics]]></source>
<year>Octo</year>
<month>be</month>
<day>r </day>
<publisher-loc><![CDATA[Washington^eDC DC]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liand]]></surname>
<given-names><![CDATA[S. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[G. Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Multiclass, Two-criteria Traffic Network Equilibrium Models and Vector Variational Inequalities]]></article-title>
<source><![CDATA[Systems Engineering - Theory and Practice]]></source>
<year>2008</year>
<volume>28</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>141-145</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dijkstra]]></surname>
<given-names><![CDATA[E. W.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A note on two problems in connection with graphs]]></article-title>
<source><![CDATA[NumerischeMathematik]]></source>
<year>1959</year>
<volume>1</volume>
<page-range>269-271</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dempster]]></surname>
<given-names><![CDATA[A. P.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[The Dempster-Shafer calculus for statisticians]]></article-title>
<source><![CDATA[International Journal of Approximate Reasoning]]></source>
<year>2008</year>
<volume>48</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>365-377</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nagurney]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Spatial Equilibrium in Transport Networks]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Hensher]]></surname>
<given-names><![CDATA[David]]></given-names>
</name>
</person-group>
<source><![CDATA[Handbook of Transport Geography and Spatial Systems]]></source>
<year>2004</year>
<volume>5</volume>
<page-range>583-608</page-range><publisher-name><![CDATA[Handbooks in TransportElsevier]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[oyce]]></surname>
<given-names><![CDATA[D.B]]></given-names>
</name>
<name>
<surname><![CDATA[Lee]]></surname>
<given-names><![CDATA[D. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Ran]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Analytical Models of the Dynamic Traffic Assignment Problem]]></article-title>
<source><![CDATA[Networks and Spatial Economics]]></source>
<year>2001</year>
<volume>1</volume>
<numero>3</numero><numero>4</numero>
<issue>3</issue><issue>4</issue>
<page-range>377-390</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kaufman]]></surname>
<given-names><![CDATA[D. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Nonis]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Smith]]></surname>
<given-names><![CDATA[R. L.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A mixed integer linear programming model for dynamic route guidance]]></article-title>
<source><![CDATA[Transportation Research Part B: Methodological]]></source>
<year>1998</year>
<volume>32</volume>
<numero>6</numero>
<issue>6</issue>
<page-range>431-440</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Florian]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Mahut]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Tremblay]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Application of a simulation-based dynamic traffic assignment model]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2008</year>
<volume>189</volume>
<page-range>1381-1392</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhangand]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[X. D.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[An Optimization Model for the Vehicle Routing Problem in Multiproduct Frozen Food Delivery]]></article-title>
<source><![CDATA[Journal of Applied Research and Technology]]></source>
<year>2014</year>
<volume>12</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>239-250</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bustos]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Herreraand]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Jiménez]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Efficient Frontier for Multi-Objective Stochastic Transportation Networks in International Market of Perishable Goods]]></article-title>
<source><![CDATA[Journal of Applied Research and Technology]]></source>
<year>2014</year>
<volume>12</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>654-665</page-range></nlm-citation>
</ref>
<ref id="B23">
<label>23</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dafermos]]></surname>
<given-names><![CDATA[S. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Sparrow]]></surname>
<given-names><![CDATA[F. T.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[The Traffic Assignment Problem for a General Network]]></article-title>
<source><![CDATA[Journal of Research of the National Bureau of Standards]]></source>
<year>1969</year>
<volume>73B</volume>
<page-range>91-118</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
