期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 220, 期 3, 页码 831-843出版社
ELSEVIER
DOI: 10.1016/j.ejor.2012.02.038
关键词
Combinatorial optimization; Metaheuristics; Ant colony optimization; Sequential ordering problems; Team orienteering problems; Probabilistic traveling salesman problems
Ant colony system is a well known metaheuristic framework, and many efficient algorithms for different combinatorial optimization problems have been derived from this general framework. In this paper some directions for improving the original framework when a strong local search routine is available, are identified. In particular, some modifications able to speed up the method and make it competitive on large problem instances, on which the original framework tends to be weaker, are described. The resulting framework, called Enhanced Ant Colony System is tested on three well-known combinatorial optimization problems arising in the transportation field. Many new best known solutions are retrieved for the benchmarks available for these optimization problems. (C) 2012 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据