Vehicle Assignment considering Battery Endurance for Electric Vehicle Carsharing Systems

On-demand station-based one-way carsharing is widely adopted for battery electric vehicle sharing systems, which is regarded as a supplement of urban mobility and a promising approach to the utilization of green energy vehicles. The service model of these carsharing systems allows users to select vehicles based on their own judgment on vehicle battery endurance, while users tend to pick up vehicles with the longest endurance distances. This phenomenon makes instant-access systems lose eﬃciency on matching available vehicles with diverse user requests and limits carsharing systems for higher capacity. We proposed a vehicle assignment method to allocate vehicles to users that maximize the utility of battery, which requires the system to enable short-term reservation rather than instant access. The methodology is developed from an agent-based discrete event simulation framework with a ﬁrst-come-ﬁrst-serve logic module for instant access mode and a resource matching optimization module for short-term reservation mode. Results show that the short-term reservation mode can at most serve 20% more users and create 47% more revenue than instant access mode under the scenario of this research. This paper also points out the equilibrium between satisfying more users by eﬃciently allocating vehicles and distracting users by disabling instant access and suggests that the reservation time could be 15 minutes.


Introduction
Carsharing has been regarded as one of the innovative urban shared-use transportation modes since the booming of shared economy and mobile Internet technology. Users are allowed to drive the shared vehicles across the carsharing networks and pay for their hourly rentals. With the awareness of green energy promotion among the public and automobile manufacturers, electric vehicles have penetrated into the carsharing market, which provides environmental benefits for urban mobility [1,2]. Limited battery endurance and time-consuming recharging process at the current stage make electric vehicles lose attractiveness compared with internal combustion engine vehicles on the private car sales market. However, the carsharing market provides a promising breeding ground for electric vehicles since carsharing organizations (CSOs) manage charging station networks and available vehicles, which set users free from concerns on recharging and maintenance by themselves. Many carsharing enterprises introduce electric vehicles into their fleets, e.g., ShareNow and Communauto, while some others operate electric fleet only, e.g., EVCARD [3] and GoFun in China.
e station-based one-way carsharing model is believed to be an appropriate form for electric vehicle carsharing systems (EVCSs, or E-carsharing). Charging piles are usually installed at carsharing stations and users are required to plug in the chargers after parking the cars. For instance, EVCARD operates large charging station networks and allows users to pick up at one station and then drop off at any other station with the charging device plugged in. EVCARD is also an ondemand carsharing service that users can instantly choose any available vehicles with different state of charge (SOC) at the station; i.e., the user can see the exact SOC and battery endurance (possible maximum distance to drive) of the vehicles idling at station from the smartphone APP and instantly select a vehicle without reservation in advance. e on-demand one-way EVCS presents flexibility that users are endowed with the decision right to choose vehicles according to the SOCs as well as their expected trip distances. However, the user's behavior on choosing vehicles limits the matching efficiency between the demand on expected travel distance and the supply of vehicle battery endurance. For instance, some of the users prefer to occupy vehicles with high SOCs even travel shortly, while users that need to drive for long distances could not be satisfied. To mitigate the unbalance of matching on expected travel distance and battery endurance, it is necessary to develop an optimized vehicle assignment mechanism. It is possible to improve vehicle utilization and overall profits for the CSOs by assigning vehicles to users more reasonably rather than choosing by themselves, which helps CSOs to satisfy more users. e demand-vehicle matching also impacts the vehicle floating pattern over the networks and consequently influences the strategy of vehicle relocation and fleet rebalancing.
e study on matching mechanism between expected travel distance of user and battery endurance of vehicle provides a better understanding on EVCS operation and improves the precision of vehicle relocation.
is paper presents the study on the matching mechanism between expected travel distance and battery endurance and assigning vehicles for users, i.e., to appoint vehicles with appropriate endurance distances for users according to their requested travel distances, to improve vehicle utilization and user satisfaction. e remainder of the paper is organized as follows. Section 2 reviews the literature on carsharing operation and electricity management. Section 3 proposes the matching methods including first-come-firstserve (FCFS) and short-term optimization based on a simulation scheme. Section 4 provides a case study and presents the findings by introducing the matching methods. Section 5 concludes the study.

Literature Review
In this section, we first review the classifications of different carsharing systems and point out the orientation of the ondemand one-way EVCS. Subsequently, the electricity problems about electric vehicle operation and management have been summarized. Finally, we introduce problems and methods for vehicle relocation, fleet management, and operation improvement to seek the potential of user-vehicle assignment for improving the efficiency of EVCS.

Categorizing Carsharing Systems.
Carsharing attracts attention around the globe and many carsharing enterprises have emerged since the last decade. New startups continue innovation on service models that present different characteristics and various degrees of flexibility.
At the very beginning stage of research towards carsharing since 2002, Barth and Shaheen originally summarized carsharing systems and categorized them into three models: (1) neighborhood carsharing, (2) station cars, and (3) multi-nodal shared-use vehicle [4]. Cepolina et al. [5] introduced new features for carsharing models including instant access, open-ended reservation, and one-way trip enabling and suggested that CSOs tended to provide better flexibility for users. Ferrero et al. developed a classification method and differentiated carsharing by dimensions such as mode, engine, objectives, time horizon, and methodologies. Remane et al. proposed a taxonomy for carsharing business models and extracted 43 characteristics in double layer and 15 dimensions to classify the carsharing business model. Wang et al. [6] also classified carsharing services into types of round-trip, one-way, station-based, free-floating, reservation-based, and on-demand, which also pointed out that the emerging EV-only carsharing CSOs tended to adopt the station-based on-demand model.
Based on the existing taxonomy and considering the requirement of this study, we summarize the categories of carsharing business in Table 1. A carsharing system presents several characteristics, and combinations of these characteristics shape various kinds of carsharing business, which provide different degrees of flexibility to users [7]. It should be noted that many of the newly launched EVCSs enabled one-way mode and are station-based for the convenience of installing recharging piles and maintaining vehicles, though some of them are free-floating for better flexibility with the sacrifice on vehicle relocation costs [8]. It should be noted that, according to the statistics of Remane et al. [9], 100% of the one-way station-based systems are instant access without any reservation.
Since the one-way station-based on-demand battery electric vehicle carsharing systems play a vital role in the global carsharing business, in this paper, we study the vehicle assignment problem for users according to their desired travel distance under the schemes of instant access and short-term reservation and explore the possibility to improve the operation efficiency.

Electricity Problems in EVCS.
e EVCS performs quite differently from other kinds of carsharing systems because of the limitation of battery endurance and recharging time. Model innovations are made including battery swapping [10] and the operation scheduling algorithm is proposed. Other types of vehicles are also discussed, such as plug-in [11] hybrid electric [12] vehicle charging problem and shared shuttle bus scheduling [13]. For EVCS that we discuss in this paper, the charging scheduling problem is also a big issue [14].
Many studies explored the electricity problems in EVCS from different perspectives, including the "range anxiety," charging station planning, and vehicle routing for charging devices. Hu et al. [15] investigated the effect of battery capacity on electric vehicle sharing systems and suggested that limited battery capacity lowers user satisfaction and vehicle utilization. Hu et al. also mentioned "range anxiety" and a vehicle selection principle [16] that allocates vehicles for users according to SOC for on-demand EVCS. Because the existence of anxiety, they assume that user must choose the vehicle with max SOC. e range anxiety does impact traveler behavior [17] and influence the vehicle floating pattern within networks [18].
To mitigate the range anxiety problem, on the planning level, CSOs can optimize the location of charging stations in EVCS to cover more destinations as well as to save construction costs for not only E-carsharing systems [19,20] but also general electric vehicle drivers [21]. From the user experience aspect, some studies proposed vehicle routing suggestions for users to optimize their routes for charging stations and to relieve their anxiety [22,23].
For the vehicle assignment problem with battery consumption information requests, Zhang et al. proposed an optimization model considering multiple vehicle relays and could output the arrangements of vehicle utilization for users [24]. However, the overall optimization models of networks and event flows should assume all demands are preknown, which could be long-term reservation or precisely predicted. One-way CSOs do not prefer long-term reservation since it loses flexibility and on the other hand the precise prediction of demand is still difficult because carsharing systems are highly stochastic. In our study, we try to focus on the vehicle assignment or selection mechanism in the circumstances of short-term reservation or on-demand. To the best of our knowledge, there is less literature revealing the characteristics, battery matching, and vehicle assignment for short-term and on-demand systems and proposing improvement suggestions for them.

Fleet Management and Operation Improvement.
Extensive studies have been conducted on fleet management, vehicle relocation, and operation decision support.
e optimization approach relies on operation research (OR) techniques to realize the objectives and on sophisticated graph or network modeling to reveal the system dynamics [33,34]. Solutions from OR present the optimum if precise demands are known. is requires system to be long-term reservation type, or strongly assume demand can be accurately and stably predicted [35,36]. Up to now, many studies are exploring demand prediction [37,38] but still not quite accurate and robust enough to drive the optimization. Towards the instant access type, the system presents strong randomness and dynamics; simulation approaches perform well to model the system characteristics. To improve the performance, researchers also attached optimization to the simulation framework [39,40]. Inventory control approaches [41][42][43] are also developed to cope with the dynamic fleet management tactics for instant access systems.
Note that some of the studies above consider fuel fleets rather than electric fleets. EVCS performs different characteristics on range anxiety and charging time, while users are not sensitive to fuel consumption and CSOs are not hindered by refueling for fuel vehicle carsharing systems. Taking electricity characteristics is quite important for EVCS modeling. For instance, the simulation framework of Hu et al. [15] adopted a maximum SOC pick-up strategy as we have discussed above. Wang et al. [42] formulated SOC constraints and integrated them in the overall optimization model, while the actual vehicle selection judged by users on SOCs would highly differ from the system optimization expectation. Ma et al. [43] involved a matching model between required distance and SOC under the objective of maximizing battery utilization, which is also not realistic enough to reveal vehicle selection by users in instant access systems or vehicle assignment in short-term reservation systems. In our paper, we attempt to explore the matching problem between user's desired travel distance and the vehicle's actual SOC, and to provide suggestions for vehicle assignment. is problem has another aspect of property which is the contrast between short-term reservation and the instant access system. e benefit of short-term reservation and the impacts to the experience of users should both be considered. Hence, this paper adopts an agent-based simulation and vehicle assignment optimization to model the short-term reservation and explores the natures of shortterm reservation and instant access.

Agent-Based Simulation
Framework. e methodology of this study is on the simulation basis with an optimization module for vehicle assignment. Agent-based simulation models are fundamental works to depict carsharing systems [15,28]. is paper further develops carsharing agent-based model by considering the vehicle assignment problem. We adopt agents to reveal the status of users and vehicles and introduce a matching mechanism to reveal the vehicle assignment. Agents are as follows.
(i) Users are generated with trip requests. User i is defined by a tuple where O i denotes the origin station, D i denotes the destination station,t 0i denotes the departure time, t 1i denotes the arrival time, d i denotes the travel distance, m i is a 0-1 sign that m i � 1 if user i is matched with a vehicle that can satisfy the user's trip otherwise � 0, r i denotes whether the user is occupying and driving a car on road and r i � 1 if driving otherwise � 0, and s i denotes whether the user is served and s i � 1 if served otherwise � 0. Note that we adopt simulation second (s) to quantify time variables. (ii) Vehicles transport users form one station to another.
Vehicle j is defined by a tuple v j � (e j , p j , t Aj , r Oj ), where e j denotes the instant state of charge (SOC) of vehicle j (defined by the current travel distance endurance, km), p j denotes the position of v j by the latest station where v j is parking, t Aj denotes the arrival time at p j and t Aj � 0 for initialization, and r Oj denotes the occupancy of the vehicle and r Oj � 1 if v j is occupied by a user; otherwise r Oj � 0.
Besides the agents, we define a matching between the user and vehicle: (i) e matching between user and vehicle is defined as a tuple m ij � (u i , v j ). is matching relates a user to a designated vehicle. Once the matching is decided, the users which have been transported and the service chain of vehicles can be speculated.
Note that these variables are time varying, and snapshots related to time instant t as u i (t), v j (t) and m ij (t) can be generated to record trajectories of users and vehicles. e process of the interaction between user agents and vehicle agents is described in Figure 1. Note that the states of vehicles and users change at discrete times and are updated by events; we adopt discrete event simulation (DES) to model the dynamics of the system.

User Interaction Modes Design.
Considering that it has been reviewed that the existing one-way station-based systems are instant access [9] and the overall optimization relies on a strong assumption of long-term reservation or precise demand prediction [36], this research will focus on instant access mode and short-term reservation mode. e interaction modes are defined as follows.
(i) Instant access: First, users emerge and are allowed to inspect the SOCs of all available vehicles at the nearby station. A user will lock a car once the user makes a trip request and places an order. We assume the server system processes the requests one by one in a time sequence, i.e., first-come-first-serve (FCFS) (shown in Figure 2). Note that simultaneously arrived requests in reality will also be processed in a queue with a sequence of other properties like user number. In this simulation system, we generate users sequentially. (ii) Short-term reservation: Users emerge in sequence and are grouped by time batch τ. Users submit departure station, arrival station, and expected departure time to the system. For users whose departure stations are the same and departure times are in the same time batch, the system assigns available vehicles to those users according to some principles (shown in Figure 3).

Instant Access
Mode. e instant access mode can be modeled as an agent-based simulation driven by discrete event simulation (DES) with asynchronous events. e events in this simulation can be found in Figure 4. Details of the events are defined in the following contents. An event list should be generated to ensure the sequence and action of each event.
e event list can be dynamically read and written. Simulation progresses through the simulation seconds and triggers the event when processing it. Event E1. User emerges. All users are generated in a set U � u 1 , u 2 , . . . , u i , . . . , u |U| at the very beginning of simulation, where |U| denotes the number of users in set U.
suppose the request of user i appears instantly at time t 0i and omit the reservation time, where m i � r i � s i � 0 for initialization. Event E2. Vehicle arrives. Vehicles are in set V and are grouped by two sets V I and V R for idling vehicles and running vehicles, respectively. First, considering station n ∈ N where N denotes the set of all stations and the number of stations is |N|, let the set of vehicles in station n be V n , and we have (1) For the running vehicles, there is Note that V R can be ∅ if all vehicles are at stations for initialization. For the running vehicles ∀v j ∈ V R , there must be a m ij relating v j to u i (the matching should be ensured by event E3), and vehicle j would arrive at station D i at t 1i . When the arriving event happens at t 1i (i.e., E2 happens), update the following variables: Event E3. User selects vehicle. ∀u i ∈ U this E3 event happens at t 0i . When E3 happens, ∀v j ∈ V O i , update the SOCs: where R denotes the charging speed (km/s) and e M is the maximum endurance distance of this type vehicle. en matching will be processed as the following two schemes: (a) Maximum SOC selection. Article [15] investigated user's choosing behavior and assumed all users would pick up the vehicle with maximum SOC. e maximum SOC selection can be expressed as follows: where ε denotes a SOC conservation in case that the vehicle is out of energy.
(b) Random selection with range constraint. We also recognized some of the users would randomly choose from vehicles with enough power to reach their destinations. is mechanism is expressed as follows. For station O i and user i, the set of available vehicles is e matching could be where rand(V Ai ) is a function which randomly returns a v j from V Ai . We assume that users can be either maximum SOC selection or random selection, which follows a binary distribution of pr, where pr is the probability that a user is maximum SOC selection. User i falls into scheme (a) according to pr and into scheme (b) according to 1 − pr.
After matching process if m ij � 0 then no action should be taken. Otherwise, the following variables should be updated for user i and vehicle j at time t 0i : Event E4. is is where departure and transport take place. is event would happen at time t 0i + t M after the matching is done, where t M denotes a very short time  interval. For user i after activating event E3, we apply E4 to denote that the user is being transported.
Event E5. User sinks. is event eliminates the user if the user arrives at the destination. is event happens at t 1i if the user was transported.
Note that the users which cannot be served can be marked by s i � 0 and would not be processed again because t 1i in time sequential simulation would be processed only once.

Short-Term Reservation Mode.
e FCFS instant access s-  ystem loses optimality on matching between trip requests and vehicle supply, especially under circumstances that firstcoming users tend to occupy a vehicle with greater SOC. Consequently, the latter users with farther distance requests are more probable to be rejected, and vehicles with lower SOC may idle for a longer time without making profits.
We suggest that adding a matching process by gathering trip distance requests and allocating vehicles for users would increase efficiency. e matching process requires the system to be short-term reservation mode. is mode also enables dynamic vehicle relocation for satisfying more demands. To be focused, we concentrate on SOC matching and do not involve the impacts brought by vehicle relocation.
e methodology of short-term reservation mode follows the DES as well but is with a cyclic event of demand collection. e users are generated the same as instant access mode. Users are grouped by a cycle of τ in short-term reservation mode. Users' expected travel distances would be matched with the endurances of all vehicles. After matching, vehicles will be assigned to users. Users accepted by the system will drive the vehicle to the destinations and then exit the system. is process is driven by a cyclic event and several asynchronous events and can be described as in Figure 5.
Among the events of short-term reservation simulation, events F1, F2, F4, and F5 show similar properties to events E1, E2, E4, and E5, respectively, and will not further be explained. Note that C3 processes quite differently from E3 and is described as follows.
Event C3. Vehicle assignment based on battery utility maximization: Define τ (simulation seconds, s) as the time span to collect user requests. Starting from simulation 0 seconds, when it comes to τs, the first demand collection and vehicle assignment will be processed. Every τs, i.e., the 0s, τs, 2τs, 3τs, . . . , kτs, . . . , Kτs, the matching event is activated. Users are initially generated the same as instant access mode. Note that user's departure time should be later than the time when the matching is processed. Hence, for the kτs at station n, the users can be grouped in a set as For V n , the SOCs should first be updated when C3 happens.
P1. Battery utility maximization. First, we define the concept of battery utility. If the system assigns v j to u i , we define d i · e j as the battery utility of the match m ij .
To further explain it, we visualize an example of the matching in Figure 6(a). A user should at most be assigned to one vehicle, and a vehicle should at most be assigned to one user. One combination shown in this figure is that u 2 is assigned to v 1 and u i is assigned to v 2 . We discover two possible ways to  Journal of Advanced Transportation improve the matching. One is to serve more users; the other is to make full use of the available SOCs. ey can be both captured by maximizing the total battery utility. e battery utility is visualized as the areas in Figure 6(b). If more users are matched with vehicles, the areas should be larger; if the SOC of vehicle better suits the required distance of user, the areas should also be larger (i.e., if assigning a vehicle with long distance to a user who travels nearby, the area would be small). Hence the objective is to maximize the total battery utility. With u i ∈ U kn and v j ∈ V n at kτ known, the matching can be processed as a 0-1 programming model: where decision 0-1 variables x ij mark that the vehicle j is assigned to user i if x ij � 1; otherwise 0; objective (13) is to maximize the utility of battery range; i.e., if more vehicles matched users, and if the expected travel distance of user i comes closer to the matched SOC of vehicle j, the objective value would be greater; constraint (15) ensures that one vehicle should at most be assigned to one user; constraint (16) ensures that one user should at most be served by one car; constraint (18) requires that the battery endurance of vehicle j should be more than the required travel distance of user i with a range conservation ε. P2. Battery utility and subsequent orders maximization. In this research, we doubt that though longrange users are more likely to be satisfied, the shortrange users also have opportunity to drive cars to a near station and following users would continue to rent this vehicle, which might not idle the system significantly, and could be a fact that the endurance range matching loses importance. Consequently, we propose a new principle to consider the potential subsequent trips and prefer to serve trips to "hot" stations that the vehicles would be utilized by latter users rather than be idled.
First, we define weight of station n as the proportion of demands that would depart from it: e objective is rewritten as arg max

s.t. (15)-(18).
It should be noted that short-term reservation mode presents less flexibility than instant access mode so that a portion of users may not turn to accept short-term reservation. It can be assumed that the probability that a user would deny to use carsharing relates to the reservation time τ; i.e., we assume that a function like where ps is the probability that users quit carsharing and f is the function. fcan be an empirical function that returnsdifferent proportions of quited user if τ � 1, 5, 15, 30, 60 minutes. Users set U should be changed to U ′ according to probability.
where rand denotes a random number between 0 and 1.

Data Description.
is study is examined by adopting original transaction data from an EVCS company in Shanghai, China, which involves 56 stations and 2,847 transactions in a month. Note that those transactions represent served trips but not the input demands. To drive the simulation, we randomly generate input demands based on the original transaction data. First, we merge the transactions into one day, and we generate one-day trips from the original one-month data. Second, to avoid the bias of simulation samples, we generate 10 copies of the 2,847 transactions, where each copy records the transactions in a random sequence. Examples of the 10 simulation copies can be found in the online data repository. ird, we group the 2,847 transactions in each copy into four groups. Each group contains different quantity of transactions, which reflect different intensity of input demands. e descriptions of the groupings are shown in Table 2.
110 vehicles are generated in the network, placed at stations, and fully recharged as initialization. e maximum SOC is 100 km of those vehicles and the charging speed is 20 km/hour. e pattern of network and demand intensity is illustrated in Figure 7, where bubbles represent the locations of stations and the size of bubbles represents the intensity of demand.
Additional descriptive statistics of the original data set collected from the recent real operation environment are as follows. One vehicle would serve 5.17 trips per day on average; one station would process 10.16 trips per day on average. e station with maximum volume would serve 49 trips for a day and 10 trips in the peak hour. Features of group B present similar properties with the original data set.
is study handles the demand set two times larger to test the capability of the proposed method.
Besides the transaction data, we also supplement the study with additional questionnaires to calibrate the   Table 3. e survey also revealed users' attitudes towards battery redundancy that the average reserved SOC for users is ε � 10.2 km before they run out of battery. e revenue of the system is calculated by rental time, and the price is RMB 0.6 per minute.

Results.
is section presents the results of testing the system performance under different schemes of instant access (IA) mode, short-term reservation mode with battery utility maximization (STR-BUM), and short-term reservation mode with battery utility and subsequent orders maximization (STR-BUSOM). To test the performance of each scheme, in this section we employ oversaturated demands of group C as inputs. Simulation of each scheme runs 10 times using the 10 copies of random inputs. Boxplots in Figure 8 show the results and compare the number of served and unserved demands across the three schemes.
Results show that the service satisfaction rate is around 70% of all schemes where STR-BUSOM served the most users (633 in average) and IA served the least (565.5 in average). About 288.5 users on average would not be served if IA was adopted, while 221 users would be rejected if STR-BUSOM was adopted. is phenomenon suggests that vehicle assignment by STR can serve more users than first-come-first-serve by IA mode. e performance increment can be detected by the detailed indicators shown in Figure 9. First, if the total numbers of vehicles are the same, the utilization rate of vehicles should be higher so that more users could be served. Figure 9(a) shows that vehicles operated on STR-BUSOM can be utilized for a longer time in average than the other two. e higher utilization rate and more trips satisfied result in a higher amount of revenue (as shown in Figure 9(b)). e vehicles under STR-BUSOM are also driven for farther distances of more than 160 km in average, while in IA the vehicles traveled below 110 km in the simulation day (Figure 9(c)). From the perspective of users, the average travel trip is 28.06 km of STR-BUSOM, which is farther than 20.49 km of IA (Figure 7(d)).
Results of Figures 8 and 9 also imply the reasons accounting for the shortcomings of STR-BUM. Although more users are served than IA, STR-BUM shows a slight increment on vehicle occupied time, which is much lower than STR-BUSOM. It suggests that although STR-BUM matches more users with vehicles (satisfies more demands), vehicles would be idled subsequently at their next stations. However, STR-BUSOM effectively mobilizes vehicles into high-demand stations which are more likely to be utilized by continuous users, so the vehicle occupied time in average is longer. is feature can also be observed by detailed statistics in Figure 10. IA and STR-BUM present relatively similar distributions of travel distance per trip as shown in Figure 10(a), where STR-BUM presents a higher mean value. However, IA serves more trips with shorter distances, and STR-BUM assigns vehicles covering different ranges uniformly. STR-BUSOM is more prone to long distance trips. e statistics on idling time after vehicles arriving until next trips are also analyzed in Figure 10(b). STR-BUSOM reduces vehicle waiting time at stations, which confirms that it is prone to assign vehicles to users whose destinations are high-demand stations. Stations with high demands would be more likely to utilize vehicles to subsequent trips.

Simulation Experiments.
To take deeper insights into the performances of IA and STR models, we designed further simulation experiments under different combinations of parameters. First, we inspect the system performance under different reservation times of τ � 1, 5, 15, 30, 60 minutes, and then we analyze the performance with the demand intensity of groups A to D.
e influence of short-term reservation time period τ is the most concerned parameter. is parameter influences the number of matchable incoming users and available vehicles and impacts user's acceptance of waiting. e result shows that the number of served requests firstly increases and then decreases of STR (as shown in Figure 11). e turning point happens at τ � 15 minutes. e number of served users of STRs drops lower than IA after adjusting the reservation time longer than 15 minutes (Figure 11(a)). e occupied time (Figure 11(b)) and traveled distance (Figure 11(c)) of vehicles on average present similar trends that first increase and then decrease. However, the average traveled distance of served users presents stable trends as shown in Figure 11(d).
We also extracted the results by setting users quit probability to zero.
is is to test the contribution of adopting STR if persuading all users to fully accept STR as they accept IA. As shown in Figure 12, the number of served requests increases if the reservation time τ is enlarged. e increasing rate slows down and the trend levels out when τ increases (Figure 12(a)). e occupied time (Figure 12(b)) and traveled distance (Figure 12(c)) present similar increasing trends as well. Moreover, the average traveled distance of served users in Figure 12(d) also presents stable trends similar to Figure 11(d).
e performances of IA, STR-BUM, and STR-BUSOM under different intensity of demands are also tested. As we employed different groups of trip requests samples, the performances of system under different   vehicle selection schemes present different characteristics as shown in Figure 13. τ � 15 minutes is adopted in this analysis.
e grouping of demands shows features as follows. Group A represents light demands which is about half of group B; group B simulates the modest demand situation  which is close to the volume that is served in reality; group C represents the 1.5 times real demands; and group D represents double demands and simulates the scenario of oversaturation. Each group scenario is tested 10 times with different random demands. e numbers of served demand are similar among IA, STR-BUM, and STR-BUSOM at the scenario of group A (Figure 13(a)). e system performs slightly different if demand is under saturate. STRs performs slightly better than IA but not obviously. If increasing the input demands, the number of satisfied demands increases of STRs, while the increment of IA stops at group B, which also suggests the capacity of IA. e increments of STRs slow down and approximate to some capacities. e satisfaction ratios drop if increasing demands (Figure 13(b)). e occupied time of vehicles also increases if providing more demands but trends to level off (Figure 13(c)).
e revenues under scenarios of group C and group seem similar and STRs could hardly earn more income if demands continue to increase, which implies the contribution of capacity increment made by STRs.

Findings and Discussions.
e results from the case study and additional parameter experiments revealed some helpful findings for further study and industrial practice.

Short-Term Reservation Performs Better than Instant
Access. STRs perform better than IA mode on both satisfied demands and system revenue. is result confirms that adopting short-term reservation and optimizing the vehicle assignment according to users' desired travel distance can satisfy more demand.
is is probably because STRs can reduce the number of rejections on long distance requests. Users with demand with far driving distance can be served more, and users traveling nearby would be matched with vehicles with low SOC. On the other hand, vehicles with low SOC can be utilized by allocating them to users who drive nearby rather than letting them occupy vehicles with high SOC. Allocating vehicles to long distance driving users can earn more revenue by utilizing vehicles and shortening the idling is results in the increment of satisfied demands as well as the utilization rate of vehicles.
Note that the STR-BUSOM performs even better than STR-BUM. is is mainly because BUSOM allocates vehicles to users who drive to "hot spots," so that the vehicle could be soon utilized again. For IA system and STR-BUM system, it is possible for users to drive a vehicle to stations whose following demand is less, and vehicles would be idled for a longer time. However, the BUSOM is directional and selective to users and tends to have bias to serve users with farther distance requests preferentially, especially when the volume of demand is much higher than the vehicle supply capacity.
Since all existing one-way station-based EVCSs are instant access mode, we suggest CSOs to provide short-term reservation trials or service. is study reveals the benefit of short-term reservation; nevertheless, STR also enables vehicle relocation to fulfil more demands, which leads to better efficiency for the system operation. Note that the user's attitude to accept STR is quite important if they are accustomed to instant access service.

User Acceptability Impacts Short-Term Reservation
Mode.
e logic behind the short-term reservation is that the system could allocate vehicles more reasonably if more diverse requests from users are collected by extending the reservation time so that more requests would be served. e paradox is that users might not accept the longer reservation period and would quit the system or divert to other transportation modes. In our study, we investigated user attitude towards shorttime reservation mode against instant access mode by additional questionnaire, and the experiments with simulation adopted the rejection probability of users to reshape the volume of demand. e result suggests that there is an inflection point through different widths of reservation time τ. is implies that there would be an equilibrium between user acceptance towards STR and the width of reservation time.
CSOs are encouraged to motivate or persuade users to accept short-term reservation mode to better benefit from it. Short-term reservation is not difficult to be popularized since the user experience of it is similar to the current forms of online taxi-hailing, e-hailing, and ride-sharing, etc. Note that not all users would adapt to short-term reservation because some users with immediate trip requests would also emerge who are not willing to wait for a long time. In this study, the results suggest that setting the reservation time to 15 minutes would balance the user's needs and short-term resource allocation optimization.

Short-Term Reservation Provides Higher Capacity.
Short-term reservation and instant access are similar for undersaturated demands, but different for oversaturated circumstances. We have discussed that IA serves fewer requests than STRs under similar parameters and scenarios due to higher efficiency of vehicle allocation of STRs. Experiments under different pressures of demand intensity suggest that when IA system touched the ceiling of capacity, STRs can serve even more requests, which implies that STRs present higher capacity to engage higher volume of demand. e reason to account for this increment of capacity lies in the selectivity among the abundant demands that the system can choose users reversely if oversaturated. For FCFS like IA, the system can reach the highest capacity even though more demands emerge, but for the STRs the system dedicatedly allocates vehicles to users that might create more profits. STRs tend to allocate vehicles to users with far distance requirements and create more revenue, and especially for STR-BUSOM, the system will prefer to serve users who would drive to stations that would create more subsequent transactions.
is is supported by the bodies of evidence that the utilization time and driving distance of vehicles of STRs are more than IA system.

Conclusions
is paper presents a simulation modeling process on both users selecting vehicles and optimal assigning vehicles to users for one-way station-based instant-access electric vehicle carsharing systems. e authors were aware of the fact that increasing the efficiency of matching the endurance running distances of available vehicles with the expected travel distances of users would serve more demand and create more profits. Users with requests on farther driving distance would be satisfied by allocating vehicles with higher SOC for them, and vehicles with lower battery endurance would be taken full advantage of by users who are traveling nearby, which avoids the circumstance that users traveling nearby occupy vehicles with higher SOC, leave short-range vehicles idling, and make other users with far distance demand being rejected. e methodology of this research is developed from an agent-based discrete event simulation framework with firstcome-first-serve logic module and resource matching optimization module. e FCFS scheme is adopted to model the existing instant access carsharing service mode, and we proposed a vehicle assignment optimization model to better match the possible driving distances of vehicles with the expected driving distance of users. Moreover, we involved a criterion to allocate vehicles to users who drive vehicles to "hot spot" stations that create more revenue during the following operation.
Results of the case study reveal that the short-term reservation modes involving the vehicle assignment module perform better than the instant access mode, which serves more user requests and increases the revenue. Short-term reservation that considers the following transactions (STR-BUSOM) performs even better than short-term reservation with battery utility maximization only.
is research encourages CSOs to enable short-term reservation for users to increase the capacity of their systems as well as incomes. Note that some parameters are not strictly calibrated and further discussed, e.g., whether users would mostly choose the vehicle with maximum SOC, or whether users would accept short-term reservation or insist on preferring the instant access mode. User behavior aspects should be further examined. is study also left the vehicle relocation alone and studied vehicle assignment only, which indicates that vehicle assignment promotes system performance. Further studies can combine vehicle relocation problems with vehicle assignment problem for not only short-term reservation but also long-term reservation carsharing systems. Maximum endurance distance when the charging is finished, km ε:

Symbol explanation
Reserved distance in case that the vehicle is out of energy p j : e position of v j by the latest station where v j is parking t Aj : e arrival time at p j ; t Aj � 0 for initialization r Oj : e occupancy of the vehicle and r Oj � 1 if v j is occupied by a user; otherwise r Oj � 0 V Ai : A set of available vehicles for user i to satisfy the trip distance rand(V Ai ): A function which randomly returns a v j from V Ai t M : A very short time interval τ: Time interval to gather a batch of requests, i.e., every τs, i.e., the 0s, τs, 2τs, 3τs, . . . , kτs, . . . Kτs the matching event is activated U kn : e set of users at station n during time period k R: Charging rate to extend the running distance, km/s W n : Weight of importance of station n x ij : 0-1 variables, mark that the vehicle j is assigned to user i if x ij � 1; otherwise 0.
Data Availability e original data that supports this paper can be accessed at the website on https://drive.google.com/drive/folders/ 1qZOpGqHCG1dCtUlnMUlFRnPjuh5lp5sZ.

Conflicts of Interest
e authors declare that there are no conflicts of interest regarding the publication of this paper.