计算机工程2012，Vol.38Issue(20)：128-131,4.DOI:10.3969/j.issn.1000-3428.2012.20.033
一种交互式最大最小蚂蚁算法
An Interactive Max-Min Ant Algorithm
摘要
Abstract
A novel Interactive Max-Min Ant System(IMMAS) is proposed to overcome the weakness that conventional Ant Colony Optimization (ACO) algorithm can not effectively solve the problem of qualitative system whose optimization indices are unable or difficult to be quantificated. In order to enhance searching performance of the algorithm and reduce user fatigue, pheromone on the paths is limited to a maximum-minimum intervals and updated by the globally best solution, and IMMAS user only need select a mostly interesting individual of current generation, and need not evaluate quantization of every solution. In the test of the application to the car styling design, the proposed algorithm achieves good search ability and high convergence speed.关键词
蚁群优化/人机交互/汽车造型/用户疲劳/信息素/定性系统Key words
Ant Colony Optimization(ACO)/ human-computer interaction/ car styling/ user fatigue/ pheromone/ qualitative system分类
信息技术与安全科学引用本文复制引用
黄永青,杨凡,张俊岭,胡为成..一种交互式最大最小蚂蚁算法[J].计算机工程,2012,38(20):128-131,4.基金项目
教育部人文社会科学研究青年基金资助项目(11YJC630074,11YJC630283) （11YJC630074,11YJC630283）
安徽省自然科学基金资助项目(090416247,1208085MG121) （090416247,1208085MG121）
安徽省高等学校省级自然科学研究基金资助项目(KJ2012A269,KJ2010B458,KJ2009B105Z) （KJ2012A269,KJ2010B458,KJ2009B105Z）
