An improved genetic algorithm in shared bicycle parking point allocation
by Guanlin Chen; Jiawei Shi; Huang Xu; Tian Li; Wujian Yang
International Journal of Security and Networks (IJSN), Vol. 15, No. 3, 2020

Abstract: Aiming to solve the problem of inadequate parking places for shared bicycles especially during peak hours, an improved genetic algorithm for parking point allocation is proposed in this paper. We integrate linear regression algorithm with the genetic algorithm to increase the direct of individual mutation, which leads to avoiding falling into local optimum. Meanwhile, we use linear regression to haste the convergence speed of genetic algorithm which ensures the new method can improve efficiency while allocating parking point. For the sake of carrying out the experiment accurately and conveniently, we use geohash to encode the locations of parking points and bicycles into short letters and numbers. According to the analysis of experimental results, it proves the improved algorithm is superior to the conventional method for parking point allocation.

Online publication date: Mon, 21-Sep-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Security and Networks (IJSN):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com