An Ant Colony Optimization algorithm for solving the fixed destination multi-depot求解固定目标多仓库的蚁群优化算法 具有非随机参数的多旅行商问题.pdfVIP

  • 5
  • 0
  • 约3.26万字
  • 约 8页
  • 2018-08-26 发布于福建
  • 举报

An Ant Colony Optimization algorithm for solving the fixed destination multi-depot求解固定目标多仓库的蚁群优化算法 具有非随机参数的多旅行商问题.pdf

An Ant Colony Optimization algorithm for solving the fixed destination multi-depot multiple traveling salesman problem with non-random parameters T. Ramadhani, G. F. Hertono, and B. D. Handari Citation: AIP Conference Proceedings 1862, 030123 (2017); doi: 10.1063/1.4991227 View online: /10.1063/1.4991227 View Table of Contents: /toc/apc/1862/1 Published by the American Institute of Physics Articles you may be interested in Solving standard traveling salesman problem and multiple traveling salesman problem by using branch-and- bound AIP Conference Proceedings 1522, 1406 (2013); 10.10

您可能关注的文档

文档评论(0)

1亿VIP精品文档

相关文档