首页> 外文期刊>Quality Control, Transactions >Shared Bikes Scheduling Under Users’ Travel Uncertainty
【24h】

Shared Bikes Scheduling Under Users’ Travel Uncertainty

机译:用户旅行不确定性的共享自行车调度

获取原文
获取原文并翻译 | 示例
           

摘要

With the rise of green concept, shared bikes are booming. The accompanying unbalanced scheduling problem is a scientific problem that needs to be solved urgently. Aiming at the problem of shared bikes scheduling with travel uncertainty, a multi-objective integer programming model is established based on the consideration of static demand of fix time period, station capacity limit, penalty cost and other practical factors. In addition, this paper gives the basic formula to calculate the parameters in the model. An algorithm based on "ant colony algorithm'' is then given to solve the model. Taking the massive data provided by the "Mobike'' company in 2017 as an example, this paper uses the program analysis data to prove the feasibility and effectiveness of the model and get the initial optimization plan. Finally, the data simulation is carried out to verify the feasibility and accuracy of the optimization scheme and the optimization scheme is adjusted accordingly to obtain the final optimization scheme. The research results show that the final optimization scheme proposed in this paper has certain reference value for the scheduling problem of Shanghai "Mobike.''
机译:随着绿色概念的兴起,共享自行车正在蓬勃发展。伴随的不平衡调度问题是需要紧急解决的科学问题。针对与旅行不确定性的共享自行车的问题,基于考虑到修复时间段,站容量限制,惩罚成本和其他实际因素的静态需求,建立了多目标整数规划模型。此外,本文提供了计算模型中参数的基本公式。然后给出了基于“蚁群算法”的算法来解决模型。以2017年“Mobike”公司提供的大规模数据为例,采用程序分析数据来证明可行性和有效性模型并获得初始优化计划。最后,执行数据仿真以验证优化方案的可行性和准确性,并且相应地调整优化方案以获得最终优化方案。研究结果表明,本文提出的最终优化方案对上海“移动”的调度问题具有一定的参考价值。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号