Research Article
Bike-Sharing Static Rebalancing by Considering the Collection of Bicycles in Need of Repair
Algorithm 1
The initial particle swarm algorithm.
Input: The number of bike stations, the cost matrix and the supply and demand per station | Output: The initial solution (also known as the initial particle) | Begin | Initialize the discrete particle swarm based on the population parameter and the dimensional | of particles, known as | Loading the base data i.e., the cost matrix and supply and demand per station | While do | Begin | Load | Route | | for do | repeat | Load = Load + ( is the supply account, is the demand account) | Free Space = Capacity - Load (Capacity is the capacity of the vehicle) | if Load > Capacity or Free Space < | | end | for do | repeat | r; | for to do | (r) = | end | end | end | | end | Return Route | end |
|