首页> 外文会议>World Conference on Mechanical Engineering and Intelligent Manufacturing >Research on Scheduling Optimization of Free-floating Bike Sharing Based on Improved Ant Colony Algorithm
【24h】

Research on Scheduling Optimization of Free-floating Bike Sharing Based on Improved Ant Colony Algorithm

机译:基于改进蚁群算法的自由浮动自行车共享调度优化研究

获取原文

摘要

In order to reduce the transportation cost of enterprises, reduce customer waiting time, aiming at the current problem of resource allocation of shared bicycles, a new mathematical model of ant colony algorithm with soft time window is built, which aims at the lowest transportation cost and the shortest customer waiting time. In this paper, a scheduling strategy based on improved ant colony algorithm is proposed, which improves the search accuracy and global search ability by improving state transition rules, local pheromone and global pheromone update rules. Then an example is given to test the improved ant colony algorithm. The results show that, compared with genetic algorithm and traditional ant colony algorithm, this algorithm greatly reduces the cost of enterprise by 10.1% and 7.7%. Specifically, transportation costs and customer waiting can be reduced. It is conducive to the sustainable development of the industry.
机译:为了降低企业的运输成本,降低客户等待时间,瞄准当前的资源分配问题的共用自行车的资源分配问题,建立了一个新的蚁群算法的数学模型,建立了软时间窗口,旨在以最低的运输成本和最低的运输成本 最短的客户等待时间。 本文提出了一种基于改进蚁群算法的调度策略,通过改进状态转换规则,本地信息素和全局信息素更新规则来提高搜索精度和全局搜索能力。 然后给出一个例子来测试改进的蚁群算法。 结果表明,与遗传算法和传统蚁群算法相比,该算法大大降低了企业成本10.1%和7.7%。 具体而言,可以减少运输成本和客户等待。 它有利于该行业的可持续发展。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号