  In bicycle share networks, the balance between demand and supply is
disrupted. As a result, shared resources are wasted and management costs for
operators increase. Therefore, in this paper, we analyze the cycle relocation
problem from the port point capacity of shared bicycles in Minato-ku, Tokyo,
the effective performance of transport vehicles, and the characteristics of
spatial distribution. : VRP problem, proper noun) and construct an optimization
model for shared cycle relocation routes that takes into account actual energy
consumption. Finally, we use different greedy algorithms to solve the model,
compare the relocation effects of the algorithms, and develop an optimized
framework for relocation based on real data and an optimized framework for
shared cycle relocation problem. We propose an improved algorithm.
