Optimization of bike-sharing parking spot layout based on usage requirements

2020 ◽  
Vol 11 (01) ◽  
pp. 2050007
Author(s):  
Di Sun ◽  
Jin Zhou ◽  
Furong Wan ◽  
Zhiqiang Sun ◽  
Xueying Gao
Keyword(s):  
Location Model ◽  
Location Optimization ◽  
Parking Spot ◽  
Shortest Distance ◽  
Bike Sharing ◽  
Attraction Model ◽  
Parking Demand ◽  
Optimal Quantity

In this paper, two problems that exist in parking spot layout of bike-sharing which need to be solved are addressed. One is the size of parking spot, while another is the location of parking spot. First, the generation and attraction model of traffic travel is used to predict the usage requirements of bike-sharing, to acquire the parking requirements of bike-sharing. Then, we establish the best station spacing model to calculate the optimal quantity of parking spots. Moreover, the method of shortest distance clustering is applied to cluster the parking demand spots. Finally, the location optimization of bike-sharing parking spot is carried out by using gravity location model. In summary, the layout of bike-sharing parking spot is finished based on the abovementioned four steps.

Location Model and Algorithm of Construction Waste Recycling Centers for Service Reliability

2015 ◽  
Vol 24 (2) ◽  
pp. 287-297 ◽  
Author(s):  
Qiu Xie ◽  
Xing Rong Fan ◽  
Qiong He ◽  
Yu Yang
Keyword(s):  
Optimization Model ◽  
Waste Recycling ◽  
Location Model ◽  
Social Effects ◽  
Service Reliability ◽  
Construction Waste ◽  
Location Selection ◽  
Location Optimization ◽  
Delivery Reliability ◽  
Selection For

AbstractPresently, most studies focus on the minimization of the costs and negative social effects of the location of construction waste recycling centers; however, the influence of the location on future operation is usually ignored. Aiming at solving these problems, a location model for the maximization of service reliability was devised. Service reliability includes the recycling reliability of the construction waste and the delivery reliability of the recycled product. Through maximizing service reliability, the location deviation as a result of arrival delay is expected to be reduced and the service reliability improved. Then, two important parameters in our model were solved on the basis of correlative mathematical theories. Finally, an example was implemented to verify our location optimization model. A genetic algorithm was used to obtain optimal solutions, and the solutions were analyzed. Through establishing a location optimization model, a possible better solution to location problems may be obtained to help in implementing location selection for recycling centers.

scholarly journals Autonomous vehicles and urban space management

2021 ◽  
Vol 110 ◽  
pp. 169-181
Author(s):  
Dahlen SIQUEIRA SILVA ◽  
Csaba CSISZÁR ◽  
Dávid FÖLDES
Keyword(s):  
Urban Space ◽  
Autonomous Vehicles ◽  
Estimation Method ◽  
Real Data ◽  
Vehicle Ownership ◽  
Space Management ◽  
Traffic Lane ◽  
Bike Sharing ◽  
Urban Parking ◽  
Parking Demand

Discussions on how urban space would be transformed by the use of autonomous vehicles (AVs) are scarce. This study identifies the impacts caused by the shared use of AVs on urban parking and urban space management. An estimation method was formulated considering the reduction in parking demand, the possible alteration in vehicle ownership, and the reallocation of urban space. A case study was performed in a 673,220 m2 area through scenarios created by using real data of parking spaces and the results of previous studies. Results showed that parking spaces can be saved with the use of shared AVs, which would allow the reallocation of urban space to new uses (for example, implementation of around 12,000 bike-sharing docking spots, 10 km bike lanes, 7 km additional traffic lane or 140 ‘parklets’). The results contribute to revealing the positive impacts of AVs.

scholarly journals Emerging Technologies and Methods in Shared Mobility Systems Layout Optimization of Campus Bike-Sharing Parking Spots

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Tangyi Guo ◽  
Jie Yang ◽  
Liu He ◽  
Kun Tang
Keyword(s):  
Travel Time ◽  
Traffic Management ◽  
Rapid Development ◽  
Construction Cost ◽  
Study Analysis ◽  
Parking Spot ◽  
Average Travel Time ◽  
Shared Mobility ◽  
Bike Sharing ◽  
Scientific Decision

The rapid development of bike sharing has posed some challenges to the traffic management on campus. The bike sharing on campus has problems such as messy parking, and some buildings in the peak hours have no bikes to borrow. Thus, alternative parking spots are proposed based on the layout principle of parking spots for bicycles. An optimization model of the layout of campus bike-sharing parking spots with travel time and construction cost as the optimization goal is established, and the branch and bound algorithm is used to solve the model. Finally, the study analysis is carried out by optimizing the layout of the bike-sharing parking spot of Nanjing University of Science and Technology. The results show that, after optimizing the layout of parking spots, the average travel time of users is reduced by 6.0%, and the total construction cost is reduced by 27.3%. While being convenient for campus bike-sharing users, it also provides scientific decision-making support for the campus traffic management.

Estimating the parking demand of free-floating bike sharing: A journey-data-based study of Nanjing, China

2020 ◽  
Vol 244 ◽  
pp. 118764 ◽  
Author(s):  
Mingzhuang Hua ◽  
Xuewu Chen ◽  
Shujie Zheng ◽  
Long Cheng ◽  
Jingxu Chen
Keyword(s):  
Bike Sharing ◽  
Parking Demand

Location Model of Processing Factory of Crop Residues Fodder

ICLEM 2010 ◽  
2010 ◽  
Author(s):  
Yufeng Sun ◽  
Quanguo Zhang ◽  
Guangyin Xu
Keyword(s):  
Crop Residues ◽  
Location Model

Location Model for Mixed Data Using Winsorization with Comedian

2018 ◽  
Vol 9 (12) ◽  
pp. 1847-1850
Author(s):  
LathaV LathaV ◽  
P Rajalakshmi
Keyword(s):  
Location Model ◽  
Mixed Data

Path Planning of Mobile Robot Using Improved Artificial Bee Colony Algorithm

2020 ◽  
Vol 38 (9A) ◽  
pp. 1384-1395
Author(s):  
Rakaa T. Kamil ◽  
Mohamed J. Mohamed ◽  
Bashra K. Oleiwi
Keyword(s):  
Mobile Robot ◽  
Comparative Research ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Dynamic Control ◽  
Computational Time ◽  
Bee Colony ◽  
Shortest Distance ◽  
Minimum Number ◽  
Cubic Polynomial

A modified version of the artificial Bee Colony Algorithm (ABC) was suggested namely Adaptive Dimension Limit- Artificial Bee Colony Algorithm (ADL-ABC). To determine the optimum global path for mobile robot that satisfies the chosen criteria for shortest distance and collision–free with circular shaped static obstacles on robot environment. The cubic polynomial connects the start point to the end point through three via points used, so the generated paths are smooth and achievable by the robot. Two case studies (or scenarios) are presented in this task and comparative research (or study) is adopted between two algorithm’s results in order to evaluate the performance of the suggested algorithm. The results of the simulation showed that modified parameter (dynamic control limit) is avoiding static number of limit which excludes unnecessary Iteration, so it can find solution with minimum number of iterations and less computational time. From tables of result if there is an equal distance along the path such as in case A (14.490, 14.459) unit, there will be a reduction in time approximately to halve at percentage 5%.

Sign in / Sign up

Export Citation Format

Share Document