<?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=Li_et_al_2019e</id>
		<title>Li et al 2019e - 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=Li_et_al_2019e"/>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Li_et_al_2019e&amp;action=history"/>
		<updated>2026-04-24T10:04:58Z</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=Li_et_al_2019e&amp;diff=213646&amp;oldid=prev</id>
		<title>Scipediacontent: Scipediacontent moved page Draft Content 977085965 to Li et al 2019e</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Li_et_al_2019e&amp;diff=213646&amp;oldid=prev"/>
				<updated>2021-02-15T09:08:59Z</updated>
		
		<summary type="html">&lt;p&gt;Scipediacontent moved page &lt;a href=&quot;/public/Draft_Content_977085965&quot; class=&quot;mw-redirect&quot; title=&quot;Draft Content 977085965&quot;&gt;Draft Content 977085965&lt;/a&gt; to &lt;a href=&quot;/public/Li_et_al_2019e&quot; title=&quot;Li et al 2019e&quot;&gt;Li et al 2019e&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 09:08, 15 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=Li_et_al_2019e&amp;diff=213645&amp;oldid=prev</id>
		<title>Scipediacontent: Created page with &quot; == Abstract ==  In recent years, free-floating bike-sharing systems (FFBSSs) have been considerably developed in China. As there is no requirement to construct bike stations,...&quot;</title>
		<link rel="alternate" type="text/html" href="https://www.scipedia.com/wd/index.php?title=Li_et_al_2019e&amp;diff=213645&amp;oldid=prev"/>
				<updated>2021-02-15T09:08:55Z</updated>
		
		<summary type="html">&lt;p&gt;Created page with &amp;quot; == Abstract ==  In recent years, free-floating bike-sharing systems (FFBSSs) have been considerably developed in China. As there is no requirement to construct bike stations,...&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;
In recent years, free-floating bike-sharing systems (FFBSSs) have been considerably developed in China. As there is no requirement to construct bike stations, this system can substantially reduce the cost when compared to the traditional bike-sharing systems. However, FFBSSs have also become a critical cause of parking disorder, especially during the morning and evening rush hours. To address this issue, the local governments stipulated that FFBSSs are required to deploy virtual stations near public transit stations and major establishments. Therefore, the location assignment of virtual stations is sufficiently considered in the FFBSSs, which is required to solve the parking disorder and satisfy the user demand, simultaneously. The purpose of this study is to optimize the location assignment of virtual stations that can meet the growing demand of users by analyzing the usage data of their shared bikes. This optimization problem is generally formulated as a mixed-integer linear programming (MILP) model to maximize the user demand. As an alternative solution, this article proposes a clustering algorithm, which can solve this problem in real time. The experimental results demonstrate that the MILP model and the proposed method are superior to the K-means method. Our method not only provides a solution for maximizing the user demand but also gives an optimized design scheme of the FFBSSs that represents the characteristics of virtual stations.&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_977085965-beopen669-3152-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/2019/4308509.pdf http://downloads.hindawi.com/journals/jat/2019/4308509.pdf] under the license https://creativecommons.org/licenses/by&lt;br /&gt;
&lt;br /&gt;
* [http://dx.doi.org/10.1155/2019/4308509 http://dx.doi.org/10.1155/2019/4308509] under the license cc-by&lt;br /&gt;
&lt;br /&gt;
* [http://downloads.hindawi.com/journals/jat/2019/4308509.pdf http://downloads.hindawi.com/journals/jat/2019/4308509.pdf],&lt;br /&gt;
: [http://downloads.hindawi.com/journals/jat/2019/4308509.xml http://downloads.hindawi.com/journals/jat/2019/4308509.xml],&lt;br /&gt;
: [http://dx.doi.org/10.1155/2019/4308509 http://dx.doi.org/10.1155/2019/4308509] under the license http://creativecommons.org/licenses/by/4.0&lt;br /&gt;
&lt;br /&gt;
* [http://dx.doi.org/10.1155/2019/4308509 http://dx.doi.org/10.1155/2019/4308509],&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/2019/4308509 https://www.hindawi.com/journals/jat/2019/4308509],&lt;br /&gt;
: [http://downloads.hindawi.com/journals/jat/2019/4308509.pdf http://downloads.hindawi.com/journals/jat/2019/4308509.pdf],&lt;br /&gt;
: [https://academic.microsoft.com/#/detail/2920509009 https://academic.microsoft.com/#/detail/2920509009]&lt;/div&gt;</summary>
		<author><name>Scipediacontent</name></author>	</entry>

	</feed>