<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Zakharov_et_al_2015a</id>
		<title>Zakharov et al 2015a - Revision history</title>
		<link rel="self" type="application/atom+xml" href="https://www.scipedia.com/wd/index.php?action=history&amp;feed=atom&amp;title=Zakharov_et_al_2015a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Zakharov_et_al_2015a&amp;action=history"/>
		<updated>2026-04-21T20:49:32Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Zakharov_et_al_2015a&amp;diff=195438&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 728237605 to Zakharov et al 2015a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Zakharov_et_al_2015a&amp;diff=195438&amp;oldid=prev"/>
				<updated>2021-01-28T22:53:32Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_728237605&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 728237605&quot;&gt;Draft Content 728237605&lt;/a&gt; to &lt;a href=&quot;/public/Zakharov_et_al_2015a&quot; title=&quot;Zakharov et al 2015a&quot;&gt;Zakharov et al 2015a&lt;/a&gt;&lt;/p&gt;
&lt;table class=&quot;diff diff-contentalign-left&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr style='vertical-align: top;' lang='en'&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan='1' style=&quot;background-color: white; color:black; text-align: center;&quot;&gt;Revision as of 22:53, 28 January 2021&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan='2' style='text-align: center;' lang='en'&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	<entry>
		<id>https://www.scipedia.com/wd/index.php?title=Zakharov_et_al_2015a&amp;diff=195436&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  The most travel delays in daily trips in modern large urban areas take place primarily at signal-controlled junctions due to regular interruption by alternati...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Zakharov_et_al_2015a&amp;diff=195436&amp;oldid=prev"/>
				<updated>2021-01-28T22:53:25Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  The most travel delays in daily trips in modern large urban areas take place primarily at signal-controlled junctions due to regular interruption by alternati...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;&lt;br /&gt;
== Abstract ==&lt;br /&gt;
&lt;br /&gt;
The most travel delays in daily trips in modern large urban areas take place primarily at signal-controlled junctions due to regular interruption by alternating traffic lights. Therefore in urban traffic control road networks alleviation increasing of traffic congestion at signalized junctions becomes one of the most significant issues, facing decision makers at various levels of management. This paper is devoted to development of methodological tools to cope with problem of settings traffic signals for congested transportation network. The global traffic control system is assumed to define timing parameters of signals for the whole transportation network. Users of network are believed to react on any fixed signal setting, assigning according to user-equilibrium of Wardrop. Thus, the global optimal signal settings problem under user network equilibrium conditions is formulated as bi-level optimization program. When travel time is modeled by modified linear BPR cost function, the user-equilibrium flow patterns for two intersecting networks of parallel routes could be obtained as explicit condition of the lower programming level.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Original document ==&lt;br /&gt;
&lt;br /&gt;
The different versions of the original document can be found in:&lt;br /&gt;
&lt;br /&gt;
* [http://dx.doi.org/10.1109/scp.2015.7342176 http://dx.doi.org/10.1109/scp.2015.7342176]&lt;br /&gt;
&lt;br /&gt;
* [https://dspace.spbu.ru/bitstream/11701/2009/1/abstract.pdf https://dspace.spbu.ru/bitstream/11701/2009/1/abstract.pdf]&lt;br /&gt;
&lt;br /&gt;
* [http://xplorestaging.ieee.org/ielx7/7328365/7342029/07342176.pdf?arnumber=7342176 http://xplorestaging.ieee.org/ielx7/7328365/7342029/07342176.pdf?arnumber=7342176],&lt;br /&gt;
: [http://dx.doi.org/10.1109/scp.2015.7342176 http://dx.doi.org/10.1109/scp.2015.7342176]&lt;br /&gt;
&lt;br /&gt;
* [https://ieeexplore.ieee.org/document/7342176 https://ieeexplore.ieee.org/document/7342176],&lt;br /&gt;
: [https://dspace.spbu.ru/bitstream/11701/2009/1/abstract.pdf https://dspace.spbu.ru/bitstream/11701/2009/1/abstract.pdf],&lt;br /&gt;
: [https://dspace.spbu.ru/handle/11701/2009 https://dspace.spbu.ru/handle/11701/2009],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2182608859 https://academic.microsoft.com/#/detail/2182608859]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>