<?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=Danesi_et_al_2012a</id>
		<title>Danesi et al 2012a - 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=Danesi_et_al_2012a"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Danesi_et_al_2012a&amp;action=history"/>
		<updated>2026-05-05T08:04:01Z</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=Danesi_et_al_2012a&amp;diff=216891&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 743399739 to Danesi et al 2012a</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Danesi_et_al_2012a&amp;diff=216891&amp;oldid=prev"/>
				<updated>2021-02-16T11:32:57Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_743399739&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 743399739&quot;&gt;Draft Content 743399739&lt;/a&gt; to &lt;a href=&quot;/public/Danesi_et_al_2012a&quot; title=&quot;Danesi et al 2012a&quot;&gt;Danesi et al 2012a&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 11:32, 16 February 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=Danesi_et_al_2012a&amp;diff=216890&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  SUMMARY    This article describes a static assignment method for a class of emerging public transport systems called personal rapid transit (PRT). PRT is a fu...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Danesi_et_al_2012a&amp;diff=216890&amp;oldid=prev"/>
				<updated>2021-02-16T11:32:52Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  SUMMARY    This article describes a static assignment method for a class of emerging public transport systems called personal rapid transit (PRT). PRT is a fu...&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;
SUMMARY    This article describes a static assignment method for a class of emerging public transport systems called personal rapid transit (PRT). PRT is a fully automated public transportation system where small-size vehicles run on exclusive guideways.        Because of its automated, on-demand service, PRT must be able to automatically reroute empty vehicles after use to supply stations with waiting passengers. Consequently, any PRT traffic assignment must take into account the flow of empty vehicles as well as the flow of vehicles with passengers.        The PRT assignment methods described in this work are based on linear programming models. One of the assignment methods has been applied to a realistic PRT network, and the statically assigned flows have been compared with averaged link flows produced by a PRT microsimulation. It is shown that the proposed static assignment method is not only useful to identify capacity bottlenecks of the planned PRT network but also serves to benchmark the microsimulator's vehicle management algorithms. Copyright © 2012 John Wiley &amp;amp; Sons, Ltd.&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://hdl.handle.net/11585/127571 http://hdl.handle.net/11585/127571]&lt;br /&gt;
&lt;br /&gt;
* [https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fatr.1196 https://api.wiley.com/onlinelibrary/tdm/v1/articles/10.1002%2Fatr.1196],&lt;br /&gt;
: [http://dx.doi.org/10.1002/atr.1196 http://dx.doi.org/10.1002/atr.1196] under the license http://doi.wiley.com/10.1002/tdm_license_1.1&lt;br /&gt;
&lt;br /&gt;
* [https://onlinelibrary.wiley.com/doi/full/10.1002/atr.1196 https://onlinelibrary.wiley.com/doi/full/10.1002/atr.1196],&lt;br /&gt;
: [https://trid.trb.org/view/1217640 https://trid.trb.org/view/1217640],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2160529455 https://academic.microsoft.com/#/detail/2160529455]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>