搜索结果: 1-1 共查到“应用数学 quick-and-dirty”相关记录1条 . 查询时间(0.076 秒)
A computational analysis on a hybrid approach: quick-and-dirty ant colony optimization
computational analysis hybrid approach quick-and-dirty colony optimization
2010/9/13
Ant colony optimization (ACO) is a well known metaheuristic. In the literature it has been used for tackling many optimization problems. Often, ACO is hybridized with a local search procedure. All the...