首页> 外文会议>International Conference on Digital Manufacturing Automation >A Novel Quantum Ant Colony Algorithm for the Choice for the Site of the Urban Public Transport Station Problem
【24h】

A Novel Quantum Ant Colony Algorithm for the Choice for the Site of the Urban Public Transport Station Problem

机译:一种新型量子蚁群算法,为城市公共交通站问题的选择

获取原文

摘要

In this paper, according to the characteristics and influence factors of the site of the urban public transport station problem, a mathematical model of the urban public transport station problem was established. Quantum Ant Colony Algorithm was used to solve the model, with Lanzhou city of Gansu Province as example, the algorithm was experimented and the experimental results show that the novel algorithm can acquire the optimal solution that is accord with the practice, moreover, the novel algorithm has much more practical.
机译:本文根据城市公共交通站点问题的特点和影响因素,建立了城市公共交通站问题的数学模型。 Quantum蚁群算法用于解决模型,随着甘肃省兰州市为例,实验结果表明,新颖的算法可以获得符合实践的最佳解决方案,而且新颖的算法更实用。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号