共享单车路径规划问题的优化研究
Optimization research on shared bicycle route planning problem
AI总结:
针对共享单车供需失衡问题,本文结合港区停放点容量、车辆性能与空间分布,构建考虑实际能耗的VRP再平衡路径模型,并通过贪心算法比较提出改进算法与优化框架。
摘要:
在共享单车网络中,需求与供给之间的平衡被打破,导致共享资源被浪费,并增加了运营商的管理成本。因此,本文从东京都港区共享单车停放点容量、运输车辆的有效性能以及空间分布特征出发,分析了自行车再平衡问题(即VRP问题,专有名词),并构建了一个考虑实际能耗的共享单车再平衡路径优化模型。最后,我们使用不同的贪心算法求解该模型,比较了各算法的再平衡效果,并基于真实数据开发了一个再平衡优化框架,以及一个面向共享单车再平衡问题的优化框架。我们提出了一种改进算法。
英文摘要:
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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。