<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
		<id>http://www.colloquiam.com/wd/index.php?action=history&amp;feed=atom&amp;title=238%2C295ok</id>
		<title>238,295ok - Revision history</title>
		<link rel="self" type="application/atom+xml" href="http://www.colloquiam.com/wd/index.php?action=history&amp;feed=atom&amp;title=238%2C295ok"/>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=238,295ok&amp;action=history"/>
		<updated>2026-05-13T21:21:55Z</updated>
		<subtitle>Revision history for this page on the wiki</subtitle>
		<generator>MediaWiki 1.27.0-wmf.10</generator>

	<entry>
		<id>http://www.colloquiam.com/wd/index.php?title=238,295ok&amp;diff=222045&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 918542790 to 238,295ok</title>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=238,295ok&amp;diff=222045&amp;oldid=prev"/>
				<updated>2021-03-23T02:18:47Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_918542790&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 918542790&quot;&gt;Draft Content 918542790&lt;/a&gt; to &lt;a href=&quot;/public/238,295ok&quot; title=&quot;238,295ok&quot;&gt;238,295ok&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 02:18, 23 March 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>http://www.colloquiam.com/wd/index.php?title=238,295ok&amp;diff=222044&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  High-speed railways have been developing quickly in recent years and have become a main travel mode between cities in many countries, especially China. Studyi...&quot;</title>
		<link rel="alternate" type="text/html" href="http://www.colloquiam.com/wd/index.php?title=238,295ok&amp;diff=222044&amp;oldid=prev"/>
				<updated>2021-03-23T02:17:01Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  High-speed railways have been developing quickly in recent years and have become a main travel mode between cities in many countries, especially China. Studyi...&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;
High-speed railways have been developing quickly in recent years and have become a main travel mode between cities in many countries, especially China. Studying passengers’ travel choices on high-speed railway networks can aid the design of efficient operations and schedule plans. The Tong and Richardson algorithm that is used in this model offers a promising method for finding the optimal path in a schedule-based transit network. However, three aspects of this algorithm limit its application to high-speed railway networks. First, these networks have more complicated common line problems than other transit networks. Without a proper treatment, the optimal paths cannot be found. Second, nonadditive fares are important factors in considering travel choices. Incorporating these factors increases the searching time; improvement in this area is desirable. Third, as high-speed railways have low-frequency running patterns, their passengers may prefer to wait at home or at the office instead of at the station. Thus, consideration of a waiting penalty is needed. This paper suggests three extensions to improve the treatments of these three aspects, and three examples are presented to illustrate the applications of these extensions. The improved algorithm can also be used for other transit systems.&lt;br /&gt;
&lt;br /&gt;
Document type: Article&lt;br /&gt;
&lt;br /&gt;
== Full document ==&lt;br /&gt;
&amp;lt;pdf&amp;gt;Media:Draft_Content_918542790-beopen1401-6802-document.pdf&amp;lt;/pdf&amp;gt;&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://downloads.hindawi.com/journals/jat/2017/9216864.pdf http://downloads.hindawi.com/journals/jat/2017/9216864.pdf] under the license https://creativecommons.org/licenses/by&lt;br /&gt;
&lt;br /&gt;
* [http://dx.doi.org/10.1155/2017/9216864 http://dx.doi.org/10.1155/2017/9216864] under the license cc-by&lt;br /&gt;
&lt;br /&gt;
* [http://downloads.hindawi.com/journals/jat/2017/9216864.pdf http://downloads.hindawi.com/journals/jat/2017/9216864.pdf],&lt;br /&gt;
: [http://downloads.hindawi.com/journals/jat/2017/9216864.xml http://downloads.hindawi.com/journals/jat/2017/9216864.xml],&lt;br /&gt;
: [http://dx.doi.org/10.1155/2017/9216864 http://dx.doi.org/10.1155/2017/9216864]&lt;br /&gt;
&lt;br /&gt;
* [http://dx.doi.org/10.1155/2017/9216864 http://dx.doi.org/10.1155/2017/9216864],&lt;br /&gt;
: [https://doaj.org/toc/0197-6729 https://doaj.org/toc/0197-6729],&lt;br /&gt;
: [https://doaj.org/toc/2042-3195 https://doaj.org/toc/2042-3195] under the license http://creativecommons.org/licenses/by/4.0/&lt;br /&gt;
&lt;br /&gt;
* [https://www.hindawi.com/journals/jat/2017/9216864 https://www.hindawi.com/journals/jat/2017/9216864],&lt;br /&gt;
: [http://downloads.hindawi.com/journals/jat/2017/9216864.pdf http://downloads.hindawi.com/journals/jat/2017/9216864.pdf],&lt;br /&gt;
: [https://core.ac.uk/display/80971150 https://core.ac.uk/display/80971150],&lt;br /&gt;
: [http://hub.hku.hk/bitstream/10722/238638/1/content.pdf http://hub.hku.hk/bitstream/10722/238638/1/content.pdf],&lt;br /&gt;
: [http://hub.hku.hk/handle/10722/237313 http://hub.hku.hk/handle/10722/237313],&lt;br /&gt;
: [https://scholars.cityu.edu.hk/en/publications/three-extensions-of-tong-and-richardsons-algorithm-for-finding-the-optimal-path-in-schedulebased-railway-networks(b9a77c2b-5d5f-4902-a4ca-e69c4a5f2c34).html https://scholars.cityu.edu.hk/en/publications/three-extensions-of-tong-and-richardsons-algorithm-for-finding-the-optimal-path-in-schedulebased-railway-networks(b9a77c2b-5d5f-4902-a4ca-e69c4a5f2c34).html],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2562410910 https://academic.microsoft.com/#/detail/2562410910]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>