Open AccessOptimal Operation Solution for Public Bicycles Based on Genetic Algorithm
Author(s) -
Pinhong Zeng
Publication year - 2021
Publication title -
international journal of circuits, systems and signal processing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.156
H-Index - 13
ISSN - 1998-4464
DOI - 10.46300/9106.2021.15.124
Subject(s) - renting , shortest path problem , computer science , scheduling (production processes) , genetic algorithm , mathematical optimization , job shop scheduling , point (geometry) , public transport , budget constraint , constraint (computer aided design) , operations research , engineering , mathematics , transport engineering , schedule , economics , graph , civil engineering , geometry , neoclassical economics , theoretical computer science , operating system , mechanical engineering
Aiming at the various problems with the scheduling of urban public bicycles, this paper conducted a research on the shortest path between rental points and employed the Floyd algorithm to find the optimal route. Based on the conditions of limited number of bicycle transportation vehicles and in different time slots the bicycle rental points were required to restore to the original number of bicycles, a constraint scheduling model was established according to the bicycle supply-demand relationships of the rental points, and the Genetic Algorithm (GA) was used to solve the model to find the shortest path. In terms of balancing the bicycles at each rental point, this paper re-distributed the initial bicycles according to the different demands of each rental point in different time slots, and solved the problem using the solution of the first problem to obtain the optimal vehicle route. This research is a useful reference for solving difficulties in public bicycle scheduling.