<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">A study on Station-based Carsharing Service&apos;s Price Prediction Methods</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<persName><forename type="first">Beibut</forename><surname>Amirgaliyev</surname></persName>
							<email>amirgaliyev@gmail.com</email>
						</author>
						<author>
							<persName><forename type="first">Dana</forename><surname>Rakym</surname></persName>
							<email>rakymdana@gmail.com</email>
						</author>
						<author>
							<persName><forename type="first">Shynar</forename><surname>Bolatova</surname></persName>
							<email>bolatova.shynar@gmail.com</email>
						</author>
						<author>
							<affiliation key="aff0">
								<orgName type="institution">Astana IT University</orgName>
								<address>
									<addrLine>С1, Mangilik el str</addrLine>
									<postCode>010000</postCode>
									<settlement>Astana</settlement>
									<country key="KZ">Kazakhstan</country>
								</address>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff1">
								<orgName type="department">Information Technology and Implementation (IT&amp;I-2022)</orgName>
								<address>
									<addrLine>November 30 -December 02</addrLine>
									<postCode>2022</postCode>
									<settlement>Kyiv</settlement>
									<country key="UA">Ukraine</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">A study on Station-based Carsharing Service&apos;s Price Prediction Methods</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">84FAADE6ACA62B380D4E86ABF9F5CDA3</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T03:55+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<textClass>
				<keywords>
					<term>Carsharing</term>
					<term>carsharing price</term>
					<term>car rent price</term>
					<term>car rent budget</term>
					<term>price forecasting</term>
				</keywords>
			</textClass>
			<abstract>
<div xmlns="http://www.tei-c.org/ns/1.0"><p>One of the types of carsharing service consumption is station-based carsharing which has no parking lots and management companies. The paper studies station-based carsharing service's price and methods of price prediction for such kind of services. The relevance of the paper is to define the optimal method of predicting car rent price according to the data provided by the carsharing company "Turo" in US. The purpose of the paper is to overview of different methods of price forecasting which can contribute to the increase in profitability of carsharing services by predicting appropriate prices in accordance with key factors affecting the demand for this kind of service.</p><p>The research defines characteristics that affect pricing in carsharing services and explores the application of three price prediction methods for the service of car renting &amp; car sharing in order to define an appropriate way of price formulation. To accomplish the research the following steps have been performed: analysis of the price formulation factors in market of car renting, exploring and analysis of data or indicators for better pricing, finding and optimizing the way of indicating price under demand uncertainty. There the methods of theoretical research were used: literature review, observation, market research, statistical analysis.</p></div>
			</abstract>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="1.">Introduction</head><p>Carsharing is a type of short-term car rental with a minute or hourly payment, usually used for short trips around the city or the surrounding area. Car sharing harmoniously combines the advantages of a personal car and the absence of the need to spend money on its maintenance, it is more convenient than public transport and cheaper than a taxi. There are several types of carsharing service. One of them is "free-floating", when cars are freely placed around the city without the use of stations. To use car sharing services, the user needs to select the nearest free car on the city map through the mobile application and book it remotely. In this paper station-based carsharing was considered.</p><p>Traditionally, station-based carsharing is similar to a regular car rental, but there are no parking lots and management companies. And the service does not own the car. The service allows customers to rent their own car or rent someone else's in a short time: the lessor registers on the site and fills out a questionnaire, indicating the details of his car, and tenants can choose a suitable car for themselves. In the case of mutual agreement, the owner of the car and the lessee draw up a rental agreement between themselves.Advances in technology provide an improvement for carsharing: apps or web-sites are often used to book carsharing services on the go, providing fast checkout, a personalized experience for users, and continuous monitoring and collection, analysis of usage data for businesses (Laoutaris et al, 2014). <ref type="bibr" target="#b0">[1]</ref>. This method of carsharing has obvious advantages -the prices are very variable, depending on the brand of the car, its condition and year of manufacture. In addition, the choice of cars is much wider than that of classic carsharing, which are often mono-branded. The prices of this service are a key factor influencing the demand for the service and directly on the company's profit. Implementing trip pricing greatly increases profitability. Therefore, it is important to research and identify ways to determine the prices of the car sharing service. To do this, the price of each service must be selected and determined in an optimal way. Research related to pricing service in one-way carsharing systems suggests different solutions. Particularly, they belong to the following categories: strategic, tactical and operational decisions. Strategic decisions are the location, number and capacity of carsharing stations, which should be made over a long period of time. Tactical decisions include fleet size and trip price, which typically are more flexible to modify than strategic decisions. The relocations of vehicles and personnel are an operational decision that can change from day to day according to actual demand. The number of station ride requests varies by hour, day, and week due to inherent demand uncertainty. It is therefore challenging to jointly optimize the long-term strategic/tactical decisions and the real-time operation decisions considering uncertainty in demand (Huang, An, Correia, Rich &amp; Ma, 2021) <ref type="bibr" target="#b1">[2]</ref>.</p><p>The secret to forecasting user demand is having a thorough grasp of the travel preferences of carsharing customers. Scholars have carried out a number of research for the examination of user travel characteristics. Kang et al. used transaction data from a carsharing operator in Seoul, South Korea, to perform multiple linear regression modeling on factors that influence users' travel behavior. They used the quantity of carsharing transactions as a dependent variable and three groups of independent variables: environment, demographics, and transportation variables <ref type="bibr" target="#b2">[3]</ref>.</p><p>Sioui et al. <ref type="bibr" target="#b3">[4]</ref>, Luca et al. <ref type="bibr" target="#b4">[5]</ref>, and Efthymiou et al. <ref type="bibr" target="#b5">[6]</ref> used questionnaires to collect statistical data on users' travel patterns and discovered that various variables, including age, gender, and income, had an impact on users' travel choices. Tian Lijun and colleagues developed a dynamic model of individual route choice in order to investigate the impact of personal preference on the evolution of route flow <ref type="bibr" target="#b6">[7]</ref>. The introduction of the user's preferences allowed for continuous model rule updating. The outcome demonstrated that psychological elements, both subjective and objective, will influence travelers' choice of route. (Wang, C., Bi, J., Sai, Q., &amp; Yuan, Z., 2021) <ref type="bibr" target="#b7">[8]</ref>.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="2.">Related work</head><p>In one-way station-based carsharing services there is a problem of instability in the demand for car rental services depending on time and place. Inappropriate prices for services can lead to losses and instability in the company's income. The main way to remedy this situation is to individually assign prices charged to customers, depending on the indicators affecting the demand for a particular service, such as the number of available vehicles, time, weather conditions and other factors. This method of income adjustment can bring higher profits through the selection of the highest optimal prices for services. In the paper of Jorge, Molnar and Correia (2015) <ref type="bibr" target="#b8">[9]</ref> there was proposed a model that considers demand as a function of price and searches for the prices that maximize the profit of the daily operation of a one-way carsharing company.</p><p>Since the model is non-linear and the objective function is non-concave, they used ILS as a metaheuristic to solve the problem. For setting the prices, stations were grouped into zones and time was divided into time intervals. Therefore, trip prices varied between each OD pair of zones according to the time interval in which the trip begins. In this article (Jorge et al., 2015) <ref type="bibr" target="#b8">[9]</ref> there was developed a mixed-integer nonlinear programming method, that determines which prices to select and charge for a given period of time to maximize profits given all-day trips and price elasticity of demand. Authors of the article <ref type="bibr" target="#b8">(Jorge et al., 2015)</ref> [9] demonstrated that system balancing has a very important role in reducing the costs and increasing profitability of carsharing systems. Their perfectly balanced solution has a higher profit than the imbalanced one.</p><p>The paper of Huang et al. (2021) <ref type="bibr" target="#b1">[2]</ref> determines a novel strategy that combines long-term prices, real-time relocations and access trips for the demand-supply imbalance problem under demand uncertainty. The carsharing vehicle fleet size and the price of trips are optimized in order to maximize the total profits of the operator by anticipating the vehicle relocations and access trips via walking or biking in the operational planning under uncertain demand. A two-stage stochastic programming is formulated on the basis of a service rate. A gradient search algorithm, a genetic algorithm and an iterated local search algorithm are proposed as a means to solve the program. To reduce computation time, parallel computing is used for solving different demand scenarios. A case study is conducted to demonstrate the applicability of the algorithms and to generate insights with respect to the management of one-way carsharing systems. The case study is based on a real traffic network and randomly generated demand formations from Poisson distributions. Huang, Kai &amp; An, Kun &amp; Homem de Almeida Correia, Gonçalo &amp; Rich, J. &amp; Ma, Wanjing. (2021) <ref type="bibr" target="#b1">[2]</ref>. According to the results of optimization in the article "An innovative approach to solve the carsharing demand-supply imbalance problem under demand uncertainty" which shows that the price of carsharing plays an important role in solving the problem of long-term imbalance. A higher price reduces demand at high demand stations during peak hours while keeping the system profitable. Taking into account the operational decisions for a typical day, moving vehicles in real time to virtual movement zones can reduce the problem of imbalance. For the entire car sharing system, using a pricing strategy, performing real-time vehicle movements and allowing access roads, more than 84% of all carsharing requests can be served.</p><p>Giorgione, Ciari &amp; Viti (2019) <ref type="bibr" target="#b9">[10]</ref> in their paper described the steps of analysis by examining the properties of various demand-side pricing policies and what trends observe. To meet the goal of the paper (Giorgione et al., 2019) <ref type="bibr" target="#b9">[10]</ref>, there were introduced two new attributes: income and Value of Time (VOT). The introduction of this variable influences the reaction of users to pricing schemes and helps to better model the behavior of different groups of users. And concluded that carsharing users with an average VOT tends to take resources from users with a lower VOT that will migrate to other means of transportation while pricing only slightly affects high VOT users.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.">Methods</head><p>This study uses quantitative techniques to perform exploratory data analysis. The method of exploratory data analysis includes the data containing the information analyzed to answer the research question, data visualization and supervised algorithms such as Random Forest, XGBoost and Decision Tree for price forecasting of the carsharing service.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.1">XGBoost Algorithm</head><p>This machine learning algorithm XGBoost is based on a decision tree and uses a gradient boosting framework. The gradient boosting method creates new models that perform the task of predicting the errors and residuals of all previous models, which are then summed in turn and then the final prediction is made.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.2">Decision Tree Algorithm</head><p>The tree algorithm, as the name says, has a tree structure and functions in a tree-like manner, like a stem grows, starting from the collection of information from the root node and ending with the decision made by the leaves.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="3.3">Random-Forest Algorithm</head><p>In this study, in order to get higher accuracy during prediction, prediction with random forest algorithm is applied. The random forest algorithm, which consists of a large number of individual trees in the form of decisions, is well suited for research where you need to make a choice from a large amount of data. It is also convenient in cases where the sequence of performing a finite number of actions necessary to find a solution is unknown. Each individual tree in the random forest produces a class prediction, and the class with the most votes become our model's prediction. The grid search approach is often too costly as many combinations are tested. In these cases, it is easier to use randomized search, which evaluates only a user-specified number of random combinations for each hyperparameter at each iteration. Thus, this algorithm makes it possible to test more hyperparameters, which makes it possible to see a more complete and accurate picture.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="4.">Data acquisition</head><p>In this article, algorithms for analyzing and predicting prices for car sharing services were carried out using car rental price data from Turo, the best existing peer-to-peer car rental and car sharing service based in San Francisco, USA. The data was taken from the kaggle platform from the profile of Christopher Lambert and contains information about 8475 vehicles in the car rental industry in a JSON file. There was also a lack of publicly available data on carsharing, which made it impossible to make a comparative analysis. The first step was to collect data suitable for analysis. They were originally not prepared for training. Manipulations were performed to transform the raw dataset into a more usable one. In addition, steps were taken to reduce duplicate data, and a certain amount of data was grouped together to show consistency and increase versatility.</p><p>The dataset has 19 main columns and its subcolumns: "distance", "reviewCount", "businessClass", "renterTripsTaken", "rating", "images", "deliveryLabel", "distanceLabel", "owner", "rentableFromSearchedAirport", " rate", "distanceWithUnit", "freeDeliveryPromotion", "location", "responseTime", "vehicle", "newListing", "responseRate", "instantBookDisplayed".</p><p>Here are descriptions of the main useful datapoints in the dataset:  Response Rate: The Response Rate is the number of times on average a host replied to a rental request (in percent). In case no data was present, it was imputed with a 0 percent.</p><p> Make, Model, Year: Represents the Make of the Car, Model of the Car, and the year in which the car was released.</p><p> Renter Trips Taken: This represents the number of times the car has been rented from that particular renter.</p><p> Scalar: The distance driven during the rental.  Instant Book Displayed: Whether the car could be booked without any request processing time to the renter.</p><p> Average Daily Price: The price for each particular car rental. This is our response variable.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="5.">Results</head><p>After conducting an exploratory data analysis, we tried to determine whether there is a statistically significant relationship between the variables in the dataset and the average daily place. As a result of studying the relationship of attributes in the dataset, we determined the correlation of data with the average price (avgDaylyPrice) of the service (Figure <ref type="figure" target="#fig_0">1</ref>).</p><p>When it comes to prediction using machine learning, there are no one-size-fits-all solutions. As data scientists, we consider a variety of heavy-duty algorithms to identify the best ones. But this is not enough. It is necessary to tune the hyperparameter selection algorithm. Therefore, after preparing the data for testing and choosing a learning model, we use three supervised learning algorithms of the prediction algorithm were applied: Random Forest, XGBoost and Decision Tree algorithms.</p><p>For regression issues, three standard evaluation metrics were used: Mean Absolute Error (MAE)</p><formula xml:id="formula_0">𝑀𝐴𝐸 = ∑ |𝒚 𝒊 − 𝒙 𝒊 | 𝒏 𝒊=𝟏 𝒏 Mean Squared Error (MSE) 𝑴𝑺𝑬 = 𝟏 𝑵 • (𝒀 𝒊 − 𝒀 𝒊 ̂)𝟐 Root Mean Squared Error (RMSE): 𝑅𝑀𝑆𝐸 = √ ∑ ‖𝒚(𝒊) − 𝒚 ̂(𝒊)‖ 𝟐 𝑵 𝒊=𝟏 𝑵 or 𝑅𝑀𝑆𝐸 = √ ∑ (𝑃𝑟𝑒𝑑𝑖𝑐𝑡𝑒𝑑 𝑖 − 𝐴𝑐𝑡𝑢𝑎𝑙 𝑖 𝑁 𝑖=1</formula><p>) 2  </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>𝑁</head><p>Because MAE is the average error, it is the most straightforward of these metrics to comprehend. Since MSE "punishes" larger errors, which tends to be useful in the real world, it is more widely used than MAE. Due to its ability to be interpreted in "y" units, RMSE is even more widely used than MSE. These are all loss functions because minimizing them is what we want to do. As a result, there were evaluated following indicators of evaluation metrics (Table <ref type="table" target="#tab_0">1</ref>).   </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Results of evaluation metrics for regression problems</head><p>According to the mean error indicators it seems that decision tree model gives the least accurate result, since its error is the lowest. Moreover, at this point we are only evaluating our models on the train set, so the risk of overfitting for decision trees is quite high. To understand better the performances of the models there can be used an alternative strategy: cross-validation. </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="6.">Conclusion</head><p>During the research made on exploring the effectiveness of cost prediction algorithms of the carsharing system was found out that among three considered algorithms: XGBoost, random forest and decision tree algorithms -XGBoost and random forest showed significantly less error level and appeared to be more effective than decision trees. In the future we would like to make more automation: write a couple of functions to speed up the pre-processing part; build a pipeline to automate the preprocessing transformations and use more models: we would like to try SVM, NN and MLP.</p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head n="7.">Acknowledgement</head><p>This research has been funded by the Science Committee of the Ministry of Education and Science of the Republic of Kazakhstan (Grant No. BR10965311 "Development of the intelligent information and telecommunication systems for municipal infrastructure: transport, environment, energy and data analytics in the concept of Smart City"). </p></div>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Model</head></div><figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_0"><head>Figure 1 :</head><label>1</label><figDesc>Figure 1: Correlation Matrix with key values</figDesc><graphic coords="5,72.00,72.00,421.40,284.99" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_1"><head>Figure 2 :</head><label>2</label><figDesc>Figure 2: Prioritized key parameters of correlation</figDesc><graphic coords="5,72.00,374.43,439.15,336.75" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" xml:id="fig_2"><head>Figure 3 :</head><label>3</label><figDesc>Figure 3: Comparison of RMSE mean by regression methods</figDesc><graphic coords="6,169.25,279.01,256.50,256.50" type="bitmap" /></figure>
<figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head>Table 1</head><label>1</label><figDesc></figDesc><table /></figure>
		</body>
		<back>
			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Assessing the potential of ride-sharing using mobile and social data: a tale of four cities</title>
		<author>
			<persName><forename type="first">B</forename><surname>Cici</surname></persName>
		</author>
		<author>
			<persName><forename type="first">A</forename><surname>Markopoulou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">E</forename><surname>Frias-Martinez</surname></persName>
		</author>
		<author>
			<persName><forename type="first">N</forename><surname>Laoutaris</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Proceedings of the 2014 ACM International Joint Conference on Pervasive and Ubiquitous Computing</title>
				<meeting>the 2014 ACM International Joint Conference on Pervasive and Ubiquitous Computing</meeting>
		<imprint>
			<date type="published" when="2014">2014</date>
			<biblScope unit="page" from="201" to="211" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">An innovative approach to solve the carsharing demand-supply imbalance problem under demand uncertainty</title>
		<author>
			<persName><forename type="first">K</forename><surname>Huang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>An</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">H</forename><surname>De Almeida Correia</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Rich</surname></persName>
		</author>
		<author>
			<persName><forename type="first">W</forename><surname>Ma</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Transportation Research Part C: Emerging Technologies</title>
		<imprint>
			<biblScope unit="volume">132</biblScope>
			<biblScope unit="page">103369</biblScope>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Finding factors that influence carsharing usage: Case study in seoul</title>
		<author>
			<persName><forename type="first">J</forename><surname>Kang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">K</forename><surname>Hwang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">S</forename><surname>Park</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Sustainability</title>
		<imprint>
			<biblScope unit="volume">8</biblScope>
			<biblScope unit="issue">8</biblScope>
			<biblScope unit="page">709</biblScope>
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b3">
	<analytic>
		<title level="a" type="main">How carsharing affects the travel behavior of households: a case study of Montréal, Canada</title>
		<author>
			<persName><forename type="first">L</forename><surname>Sioui</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Morency</surname></persName>
		</author>
		<author>
			<persName><forename type="first">M</forename><surname>Trépanier</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">International journal of sustainable transportation</title>
		<imprint>
			<biblScope unit="volume">7</biblScope>
			<biblScope unit="issue">1</biblScope>
			<biblScope unit="page" from="52" to="69" />
			<date type="published" when="2013">2013</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b4">
	<analytic>
		<title level="a" type="main">Modelling users&apos; behaviour in inter-urban carsharing program: A stated preference approach</title>
		<author>
			<persName><forename type="first">S</forename><surname>De Luca</surname></persName>
		</author>
		<author>
			<persName><forename type="first">R</forename><surname>Di Pace</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Transportation research part A: policy and practice</title>
		<imprint>
			<biblScope unit="volume">71</biblScope>
			<biblScope unit="page" from="59" to="76" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b5">
	<analytic>
		<title level="a" type="main">Modeling the propensity to join carsharing using hybrid choice models and mixed survey data</title>
		<author>
			<persName><forename type="first">D</forename><surname>Efthymiou</surname></persName>
		</author>
		<author>
			<persName><forename type="first">C</forename><surname>Antoniou</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Transport Policy</title>
		<imprint>
			<biblScope unit="volume">51</biblScope>
			<biblScope unit="page" from="143" to="149" />
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b6">
	<analytic>
		<title level="a" type="main">Study on daily travel behavior considering path preference based on Dogit model</title>
		<author>
			<persName><forename type="first">L</forename><surname>Tian</surname></persName>
		</author>
		<author>
			<persName><forename type="first">X</forename><surname>Jiang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">T</forename><surname>Liu</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Y</forename><surname>Zhao</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Transp. Syst. Eng. Inf</title>
		<imprint>
			<biblScope unit="volume">16</biblScope>
			<biblScope unit="page" from="228" to="235" />
			<date type="published" when="2016">2016</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b7">
	<analytic>
		<title level="a" type="main">Analysis and prediction of carsharing demand based on data mining methods</title>
		<author>
			<persName><forename type="first">C</forename><surname>Wang</surname></persName>
		</author>
		<author>
			<persName><forename type="first">J</forename><surname>Bi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Q</forename><surname>Sai</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Z</forename><surname>Yuan</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Algorithms</title>
		<imprint>
			<biblScope unit="volume">14</biblScope>
			<biblScope unit="issue">6</biblScope>
			<biblScope unit="page">179</biblScope>
			<date type="published" when="2021">2021</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b8">
	<analytic>
		<title level="a" type="main">Trip pricing of one-way station-based carsharing networks with zone and time of day price variations</title>
		<author>
			<persName><forename type="first">D</forename><surname>Jorge</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><surname>Molnar</surname></persName>
		</author>
		<author>
			<persName><surname>De Almeida</surname></persName>
		</author>
		<author>
			<persName><forename type="first">G</forename><forename type="middle">H</forename><surname>Correia</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Transportation Research Part B: Methodological</title>
		<imprint>
			<biblScope unit="volume">81</biblScope>
			<biblScope unit="page" from="461" to="482" />
			<date type="published" when="2015">2015</date>
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b9">
	<analytic>
		<title level="a" type="main">Availability-based dynamic pricing on a round-trip carsharing service: an explorative analysis using agent-based simulation</title>
		<author>
			<persName><forename type="first">G</forename><surname>Giorgione</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Ciari</surname></persName>
		</author>
		<author>
			<persName><forename type="first">F</forename><surname>Viti</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="j">Procedia Computer Science</title>
		<imprint>
			<biblScope unit="volume">151</biblScope>
			<biblScope unit="page" from="248" to="255" />
			<date type="published" when="2019">2019</date>
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
